Where to Pay Attention in Sparse Training for Feature Selection?
Ghada Sokar, Zahra Atashgahi, Mykola Pechenizkiy, Decebal Constantin Mocanu
Abstract
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 1 .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext afb9d4ce-154a-4c97-99bb-13b9bdeb902cCited by top-tier papers8
- E2ENet: Dynamic Sparse Feature Fusion for Accurate and Efficient 3D Medical Image SegmentationBoqian Wu, Qiao Xiao, Shiwei Liu, Lu Yin et al.NeurIPS 2024 · 29 citations
- Interpretable Deep Clustering for Tabular DataJonathan Svirsky, Ofir LindenbaumICML 2024 · 19 citations
- Bridging Trustworthiness and Open-World Learning: An Exploratory Neural Approach for Enhancing Interpretability, Generalization, and RobustnessShide Du, Zihan Fang, Shiyang Lan, Yanchao Tan et al.ACM MM 2023 · 12 citations
- Joint Feature and Differentiable k-NN Graph Learning using Dirichlet EnergyLei Xu, Lei Chen, Rong Wang, Feiping Nie et al.NeurIPS 2023 · 6 citations
- Indirectly Parameterized Concrete AutoencodersAlfred Nilsson, Klas Wijk, Sai Bharath Chandra Gutha, Erik Englesson et al.ICML 2024 · 4 citations
Builds on12
- Rigging the Lottery: Making All Tickets WinnersUtku Evci, Trevor Gale, Jacob Menick, Pablo Samuel Castro et al.ICML 2020 · 723 citations
- Learning N: M Fine-grained Structured Sparse Neural Networks From ScratchAojun Zhou, Yukun Ma, Junnan Zhu, Jianbo Liu et al.ICLR 2021 · 301 citations
- Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse TrainingShiwei Liu, Lu Yin, Decebal Constantin Mocanu, Mykola PechenizkiyICML 2021 · 146 citations
- Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning BetterSameer Bibikar, Haris Vikalo, Zhangyang Wang, Xiaohan ChenAAAI 2022 · 133 citations
- MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the EdgeGeng Yuan, Xiaolong Ma, Wei Niu, Zhengang Li et al.NeurIPS 2021 · 124 citations
Related papers
- Fractal Autoencoders for Feature SelectionXinxing Wu, Qiang ChengAAAI 2021 · 33 citations
- Selective Deep Autoencoder for Unsupervised Feature SelectionWael Hassanieh, Abdallah A. ChehadeAAAI 2024 · 16 citations
- Efficient Neural Architecture Search via Proximal IterationsQuanming Yao, Ju Xu, Wei-Wei Tu, Zhanxing ZhuAAAI 2020 · 108 citations
- Progressive Feature Interaction Search for Deep Sparse NetworkChen Gao, Yinfeng Li, Quanming Yao, Depeng Jin et al.NeurIPS 2021 · 17 citations
- SAND: One-Shot Feature Selection with Additive Noise DistortionPedram Pad, Hadi Hammoud, Mohamad Dia, Nadim Maamari et al.ICML 2025
