AutoNFS: Automatic Neural Feature Selection
Not on the map. Why?
Abstract (arXiv)
Feature selection (FS) is a fundamental challenge in machine learning, particularly for high-dimensional tabular data, where interpretability and computational efficiency are critical. Existing FS methods often cannot automatically detect the number of attributes required to solve a given task and involve user intervention or model retraining with different feature budgets. Additionally, they either neglect feature relationships (filter methods) or require time-consuming optimization (wrapper methods). To address these limitations, we propose AutoNFS, which combines the FS module based on Gumbel-Sigmoid sampling with a predictive model evaluating the relevance of the selected attributes. The model is trained end-to-end using a differentiable loss and automatically determines the minimal set of features essential to solve a given downstream task. Unlike many wrapper-style approaches, AutoNFS introduces a low and predictable training overhead and avoids repeated model retraining across feature budgets. In practice, the additional cost of the masking module is largely independent of the number of input features (beyond the unavoidable cost of processing the input itself), making the method scalable to high-dimensional tabular data. We evaluate AutoNFS on well-established classification and regression benchmarks as well as real-world metagenomic datasets. The results show that AutoNFS is competitive with, and often improves upon, strong classical and neural FS baselines while selecting fewer features on average across the evaluated benchmarks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 57 references that are in the map. First posted on arXiv 17 Mar 2025.
Builds on
22 of 57 references.
References · 22
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2021Revisiting Deep Learning Models for Tabular Datacited by 740
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
- 2019Stochastic Beams and Where to Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacementcited by 211
- 2020Fast Differentiable Sorting and Rankingcited by 197
- 2014Controlling the false discovery rate via knockoffscited by 97
- 2019Concrete Autoencoders for Differentiable Feature Selection and Reconstructioncited by 90
- 2018EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAEcited by 87
- 2019LassoNet: A Neural Network with Feature Sparsitycited by 82
10 more
- 2019Reparameterizable Subset Sampling via Continuous Relaxationscited by 70
- 2023Learning to Maximize Mutual Information for Dynamic Feature Selectioncited by 56
- 2018Deep Knockoffscited by 41
- 2017Classification with Costly Features using Deep Reinforcement Learningcited by 34
- 2021Locally Sparse Neural Networks for Tabular Biomedical Datacited by 34
- 2023A Performance-Driven Benchmark for Feature Selection in Tabular Deep Learningcited by 24
- 2023ProtoGate: Prototype-based Neural Networks with Global-to-local Feature Selection for Tabular Biomedical Datacited by 18
- 2022Fast Feature Selection with Fairness Constraintscited by 4
- 2021Adaptive Group Lasso Neural Network Models for Functions of Few Variables and Time-Dependent Datacited by 2
- 2024Conditional Gumbel-Softmax for constrained feature selection with application to node selection in wireless sensor networkscited by 1
Built on by
Not cited yet.