A Nonparametric Statistics Approach to Feature Selection in Deep Neural Networks with Theoretical Guarantees
Junye Du, Zhenghao Li, Zhutong Gu, Long Feng

TL;DR
This paper introduces a gradient-descent-free feature selection method for deep neural networks that guarantees consistency and performs well in high-dimensional, nonlinear settings with complex feature interactions.
Contribution
It reformulates neural networks as index models and uses Stein's formula for feature selection, providing theoretical guarantees without relying on traditional optimization.
Findings
Guarantees feature selection consistency with n = Ω(p^2)
Achieves nonlinear selection consistency with n = Ω(s log p)
Demonstrates strong empirical performance on simulations and real data
Abstract
This paper tackles the problem of feature selection in a highly challenging setting: , where is the set of relevant features and is an unknown, potentially nonlinear function subject to mild smoothness conditions. Our approach begins with feature selection in deep neural networks, then generalizes the results to H{\"o}lder smooth functions by exploiting the strong approximation capabilities of neural networks. Unlike conventional optimization-based deep learning methods, we reformulate neural networks as index models and estimate using the second-order Stein's formula. This gradient-descent-free strategy guarantees feature selection consistency with a sample size requirement of , where is the feature dimension. To handle high-dimensional scenarios, we further…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques · Statistical Methods and Inference
