A Brain-inspired Algorithm for Training Highly Sparse Neural Networks
Not on the map. Why?
Abstract (arXiv)
Sparse neural networks attract increasing interest as they exhibit comparable performance to their dense counterparts while being computationally efficient. Pruning the dense neural networks is among the most widely used methods to obtain a sparse neural network. Driven by the high training cost of such methods that can be unaffordable for a low-resource device, training sparse neural networks sparsely from scratch has recently gained attention. However, existing sparse training algorithms suffer from various issues, including poor performance in high sparsity scenarios, computing dense gradient information during training, or pure random topology search. In this paper, inspired by the evolution of the biological brain and the Hebbian learning theory, we present a new sparse training approach that evolves sparse neural networks according to the behavior of neurons in the network. Concretely, by exploiting the cosine similarity metric to measure the importance of the connections, our proposed method, Cosine similarity-based and Random Topology Exploration (CTRE), evolves the topology of sparse neural networks by adding the most important connections to the network without calculating dense gradient in the backward. We carried out different experiments on eight datasets, including tabular, image, and text datasets, and demonstrate that our proposed method outperforms several state-of-the-art sparse training algorithms in extremely sparse neural networks by a large gap. The implementation code is available on https://github.com/zahraatashgahi/CTRE
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 2; 2025: 1; 2026: 1.
8 papers.
- 2023Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Trainingcited by 16
- 2023Supervised Feature Selection with Neuron Evolution in Sparse Neural Networkscited by 7
- 2024Unveiling the Power of Sparse Neural Networks for Feature Selectioncited by 3
- 2022ManiFeSt: Manifold-based Feature Selection for Small Data Setscited by 2
- 2023Adaptive Sparsity Level during Training for Efficient Time Series Forecasting with Transformerscited by 1
- 2024Boosting Robustness in Preference-Based Reinforcement Learning with Dynamic Sparsitycited by 0
- 2025Switch-Based Multi-Part Neural Networkcited by 0
- 2026Constrained Hebbian Learning Supports Efficient Representational Allocation under Structural Constraintscited by 0
- 2026Constrained Hebbian Learning Supports Efficient Representational Allocation under Structural Constraints17 Jul 2026
- 2025Switch-Based Multi-Part Neural Network25 Apr 2025
- 2024Unveiling the Power of Sparse Neural Networks for Feature Selection8 Aug 2024
- 2024Boosting Robustness in Preference-Based Reinforcement Learning with Dynamic Sparsity10 Jun 2024
- 2023Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training21 Jun 2023
- 2023Adaptive Sparsity Level during Training for Efficient Time Series Forecasting with Transformers28 May 2023
- 2023Supervised Feature Selection with Neuron Evolution in Sparse Neural Networks10 Mar 2023
- 2022ManiFeSt: Manifold-based Feature Selection for Small Data Sets18 Jul 2022