Biobjective gradient descent for feature selection on high dimension, low sample size data - Université d'Évry
Article Dans Une Revue PLoS ONE Année : 2024

Biobjective gradient descent for feature selection on high dimension, low sample size data

Résumé

Even though deep learning shows impressive results in several applications, its use on problems with High Dimensions and Low Sample Size, such as diagnosing rare diseases, leads to overfitting. One solution often proposed is feature selection. In deep learning, along with feature selection, network sparsification is also used to improve the results when dealing with high dimensions low sample size data. However, most of the time, they are tackled as separate problems. This paper proposes a new approach that integrates feature selection, based on sparsification, into the training process of a deep neural network. This approach uses a constrained biobjective gradient descent method. It provides a set of Pareto optimal neural networks that make a trade-off between network sparsity and model accuracy. Results on both artificial and real datasets show that using a constrained biobjective gradient descent increases the network sparsity without degrading the classification performances. With the proposed approach, on an artificial dataset, the feature selection score reached 0.97 with a sparsity score of 0.92 with an accuracy of 0.9. For the same accuracy, none of the other methods reached a feature score above 0.20 and sparsity score of 0.35. Finally, statistical tests validate the results obtained on all datasets.

Dates et versions

hal-04667445 , version 1 (04-08-2024)

Identifiants

Citer

Tina Issa, Eric Angel, Farida Zehraoui. Biobjective gradient descent for feature selection on high dimension, low sample size data. PLoS ONE, 2024, 19 (7), pp.e0305654. ⟨10.1371/journal.pone.0305654⟩. ⟨hal-04667445⟩
139 Consultations
0 Téléchargements

Altmetric

Partager

More