Abstract: The evolutionary feature selection algorithm is combined with model evaluation during training to learn feature subsets that maximize speech/non-speech distribution distances. The technique enables ensembling of low-cost models over similar features subspaces increases classification accuracy and has similar computational complexity in practice. Prior to training the models, feature analysis is conducted via an evolutionary feature selection algorithm which measures fitness for each feature subset in the population by its k-fold cross validation score. PCA and LDA based eigen-features are computed for each subset and fitted with a Gaussian Mixture Model from which combinations of feature subsets with Maximum Mean Discrepancy scores are obtained. During inference, the resulting features are extracted from the input signal and given as input to the trained neural networks.

Abstract: The evolutionary feature selection algorithm is combined with model evaluation during training to learn feature subsets that maximize speech/non-speech distribution distances. The technique enables ensembling of low-cost models over similar features subspaces increases classification accuracy and has similar computational complexity in practice. Prior to training the models, feature analysis is conducted via an evolutionary feature selection algorithm which measures fitness for each feature subset in the population by its k-fold cross validation score. PCA and LDA based eigen-features are computed for each subset and fitted with a Gaussian Mixture Model from which combinations of feature subsets with Maximum Mean Discrepancy scores are obtained. During inference, the resulting features are extracted from the input signal and given as input to the trained neural networks.