SLM: End-to-end Feature Selection via Sparse Learnable Masks
Not on the map. Why?
Abstract (arXiv)
Feature selection has been widely used to alleviate compute requirements during training, elucidate model interpretability, and improve model generalizability. We propose SLM -- Sparse Learnable Masks -- a canonical approach for end-to-end feature selection that scales well with respect to both the feature dimension and the number of samples. At the heart of SLM lies a simple but effective learnable sparse mask, which learns which features to select, and gives rise to a novel objective that provably maximizes the mutual information (MI) between the selected features and the labels, which can be derived from a quadratic relaxation of mutual information from first principles. In addition, we derive a scaling mechanism that allows SLM to precisely control the number of features selected, through a novel use of sparsemax. This allows for more effective learning as demonstrated in ablation studies. Empirically, SLM achieves state-of-the-art results against a variety of competitive baselines on eight benchmark datasets, often by a significant margin, especially on those with real-world challenges such as class imbalance.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 30 of its 55 references that are in the map. First posted on arXiv 6 Apr 2023.
Builds on
30 of 55 references.
References · 30
- 2017Attention Is All You Needcited by 59,932
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2019Invariant Risk Minimizationcited by 1,832
- 2017Learning Important Features Through Propagating Activation Differencescited by 1,454
- 2018Deep Graph Infomaxcited by 1,101
- 2021Perceiver: General Perception with Iterative Attentioncited by 1,089
- 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
- 2019TabNet: Attentive Interpretable Tabular Learningcited by 640
- 2016From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classificationcited by 337
- 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
18 more
- 2016Rationalizing Neural Predictionscited by 281
- 2019Sparse Sequence-to-Sequence Modelscited by 167
- 2017Visualizing Deep Neural Network Decisions: Prediction Difference Analysiscited by 166
- 2019Adaptively Sparse Transformerscited by 154
- 2018Explaining Image Classifiers by Counterfactual Generationcited by 144
- 2019Interpretable Neural Predictions with Differentiable Binary Variablescited by 126
- 2019Learning with Fenchel-Young Lossescited by 117
- 2019Concrete Autoencoders for Differentiable Feature Selection and Reconstructioncited by 90
- 2019LassoNet: A Neural Network with Feature Sparsitycited by 81
- 2019The HSIC Bottleneck: Deep Learning without Back-Propagationcited by 77
- 2020An Information Bottleneck Approach for Controlling Conciseness in Rationale Extractioncited by 69
- 2019Explicit Sparse Transformer: Concentrated Attention Through Explicit Selectioncited by 61
- 2017Sparse-Input Neural Networks for High-dimensional Nonparametric Regression and Classificationcited by 39
- 2020FsNet: Feature Selection Network on High-dimensional Biological Datacited by 23
- 2020Efficient Marginalization of Discrete and Structured Latent Variables via Sparsitycited by 21
- 2021SPECTRA: Sparse Structured Text Rationalizationcited by 19
- 2013Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximationcited by 11
- 2020Adversarial Validation Approach to Concept Drift Problem in User Targeting Automation Systems at Ubercited by 2
Built on by
Citing papers per year: 2024: 1.
1 paper.