mlsanityData to 14 Oct 2026

Where to Pay Attention in Sparse Training for Feature Selection?

arXiv 2211.14627 ↗First posted 26 Nov 2022cs.LG cs.CVcited by 15

Not on the map. Why?

Abstract (arXiv)

A new line of research for feature selection based on neural networks has recently emerged. Despite its superiority to classical methods, it requires many training iterations to converge and detect informative features. The computational time becomes prohibitively long for datasets with a large number of samples or a very high dimensional feature space. In this paper, we present a new efficient unsupervised method for feature selection based on sparse autoencoders. In particular, we propose a new sparse training algorithm that optimizes a model's sparse topology during training to pay attention to informative features quickly. The attention-based adaptation of the sparse topology enables fast detection of informative features after a few training iterations. We performed extensive experiments on 10 datasets of different types, including image, speech, text, artificial, and biological. They cover a wide range of characteristics, such as low and high-dimensional feature spaces, and few and large training samples. Our proposed approach outperforms the state-of-the-art methods in terms of selecting informative features while reducing training iterations and computational costs substantially. Moreover, the experiments show the robustness of our method in extremely noisy environments.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Builds on 28 of its 82 references that are in the map. First posted on arXiv 26 Nov 2022.

Builds on

28 of 82 references.

References · 28

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  3. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  4. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
  5. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
  6. 2016FMA: A Dataset For Music Analysiscited by 207
  7. 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
  8. 2020The Hardware Lotterycited by 160
  9. 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 110
  10. 2019Concrete Autoencoders for Differentiable Feature Selection and Reconstructioncited by 90
  11. 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
  12. 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 79
16 more
  1. 2021Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Bettercited by 55
  2. 2020SpaceNet: Make Free Space For Continual Learningcited by 53
  3. 2021Dynamic Sparse Training for Deep Reinforcement Learningcited by 49
  4. 2019Sparse evolutionary Deep Learning with over one million artificial neurons on commodity hardwarecited by 48
  5. 2020Sparse Weight Activation Trainingcited by 45
  6. 2021Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsitycited by 44
  7. 2018Multi-objective Evolutionary Federated Learningcited by 42
  8. 2020Quick and Robust Feature Selection: the Strength of Energy-efficient Sparse Training for Autoencoderscited by 28
  9. 2021Selfish Sparse RNN Trainingcited by 26
  10. 2015Survey on Feature Selectioncited by 25
  11. 2020FsNet: Feature Selection Network on High-dimensional Biological Datacited by 23
  12. 2020Topological Insights into Sparse Neural Networkscited by 22
  13. 2017Kernel Feature Selection via Conditional Covariance Minimizationcited by 20
  14. 2021Truly Sparse Neural Networks at Scalecited by 16
  15. 2021Sparse Training Theory for Scalable and Efficient Agentscited by 13
  16. 2018Learning to Recognize Musical Genre from Audiocited by 9

Built on by

Cited by year

Citing papers per year: 2023: 6; 2024: 5; 2025: 4.

15 papers.

Sort:

Similar, not cited

Close in wording, no citation either way

  1. 2026Improving Sparse Autoencoder with Dynamic Attention
  2. 2026Gradients for Interventions and Activations for Detection: Targeted Feature Learning in Language Models
  3. 2026SoftSAE: Dynamic Top-K Selection for Adaptive Sparse Autoencoders
  4. 2025Time-Aware Feature Selection: Adaptive Temporal Masking for Stable Sparse Autoencoder Training
  5. 2024Adaptive Sparse Allocation with Mutual Choice & Feature Choice Sparse Autoencoders
  6. 2026Mind the Tail: Data Selection Through Sparse Concepts
  7. 2025Which Sparse Autoencoder Features Are Real? Model-X Knockoffs for False Discovery Rate Control
  8. 2026Scaling Attention via Feature Sparsity