Sparse-Input Neural Network using Group Concave Regularization
Bin Luo, Susan Halabi

TL;DR
This paper introduces a novel sparse-input neural network framework using group concave regularization, improving feature selection and prediction accuracy in high-dimensional data settings.
Contribution
It proposes a new regularization approach with theoretical guarantees, addressing limitations of previous methods like group LASSO in neural networks.
Findings
Effective feature selection in high-dimensional neural networks
Finite-sample guarantees for variable selection and prediction
Validated through simulations and real data applications
Abstract
Simultaneous feature selection and non-linear function estimation is challenging in modeling, especially in high-dimensional settings where the number of variables exceeds the available sample size. In this article, we investigate the problem of feature selection in neural networks. Although the group least absolute shrinkage and selection operator (LASSO) has been utilized to select variables for learning with neural networks, it tends to select unimportant variables into the model to compensate for its over-shrinkage. To overcome this limitation, we propose a framework of sparse-input neural networks using group concave regularization for feature selection in both low-dimensional and high-dimensional settings. The main idea is to apply a proper concave penalty to the norm of weights from all outgoing connections of each input node, and thus obtain a neural net that only uses a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Machine Learning and ELM · Stochastic Gradient Optimization Techniques
MethodsFeature Selection
