Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science
Not on the map. Why?
Abstract (arXiv)
Through the success of deep learning in various domains, artificial neural networks are currently among the most used artificial intelligence methods. Taking inspiration from the network properties of biological neural networks (e.g. sparsity, scale-freeness), we argue that (contrary to general practice) artificial neural networks, too, should not have fully-connected layers. Here we propose sparse evolutionary training of artificial neural networks, an algorithm which evolves an initial sparse topology (ErdHos-R'enyi random graph) of two consecutive layers of neurons into a scale-free topology, during learning. Our method replaces artificial neural networks fully-connected layers with sparse ones before training, reducing quadratically the number of parameters, with no decrease in accuracy. We demonstrate our claims on restricted Boltzmann machines, multi-layer perceptrons, and convolutional neural networks for unsupervised and supervised learning on 15 datasets. Our approach has the potential to enable artificial neural networks to scale up beyond what is currently possible.
Key facts. Cited by 325 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Jul 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 55; 2022: 60; 2023: 67; 2024: 60; 2025: 54; 2026: 29.
325 papers.
Sort:
By area:
- 2021ResMLP: Feedforward networks for image classification with data-efficient trainingcited by 338
- 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 227
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2024A Survey on Efficient Inference for Large Language Modelscited by 197
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2022More ConvNets in the 2020s: Scaling up Kernels Beyond 51x51 using Sparsitycited by 142
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 107
- 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
- 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 83
38 more
- 2022SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapterscited by 83
- 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
- 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 77
- 2021Can Subnetwork Structure be the Key to Out-of-Distribution Generalization?cited by 75
- 2022DisPFL: Towards Communication-Efficient Personalized Federated Learning via Decentralized Sparse Trainingcited by 74
- 2022Deep Differentiable Logic Gate Networkscited by 67
- 2023Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMscited by 61
- 2022The State of Sparse Training in Deep Reinforcement Learningcited by 60
- 2021Initialization and Regularization of Factorized Neural Layerscited by 58
- 2021AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networkscited by 58
- 2022SparCL: Sparse Continual Learning on the Edgecited by 55
- 2021Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Bettercited by 54
- 2021Dynamic Sparse Training for Deep Reinforcement Learningcited by 49
- 2021Powerpropagation: A sparsity inducing weight reparameterisationcited by 49
- 2022Packed-Ensembles for Efficient Uncertainty Estimationcited by 49
- 2021The Low-Resource Double Bind: An Empirical Study of Pruning for Low-Resource Machine Translationcited by 46
- 2021Effective Sparsification of Neural Networks with Global Sparsity Constraintcited by 45
- 2021Efficient Lottery Ticket Finding: Less Data is Morecited by 44
- 2021Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsitycited by 44
- 2023The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Mattercited by 42
- 2023Maintaining Plasticity in Deep Continual Learningcited by 42
- 2021Recent Advances on Neural Network Pruning at Initializationcited by 41
- 2023No Train No Gain: Revisiting Efficient Training Algorithms For Transformer-based Language Modelscited by 41
- 2023Scaling Laws for Sparsely-Connected Foundation Modelscited by 41
- 2025Weight-sparse transformers have interpretable circuitscited by 40
- 2022Machine Learning in Aerodynamic Shape Optimizationcited by 39
- 2021Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AIcited by 38
- 2022NISPA: Neuro-Inspired Stability-Plasticity Adaptation for Continual Learning in Sparse Networkscited by 38
- 2022Compute-Efficient Deep Learning: Algorithmic Trends and Opportunitiescited by 38
- 2024In value-based deep reinforcement learning, a pruned network is a good networkcited by 38
- 2023Scaling MLPs: A Tale of Inductive Biascited by 37
- 2023Dynamic Sparse Training with Structured Sparsitycited by 36
- 2024AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Modelscited by 35
- 2021Efficient Neural Network Training via Forward and Backward Propagation Sparsificationcited by 30
- 2022Achieving Personalized Federated Learning with Sparse Local Modelscited by 30
- 2022RLx2: Training a Sparse Deep Reinforcement Learning Model from Scratchcited by 30
- 2023NTK-SAP: Improving neural network pruning by aligning training dynamicscited by 30
- 2022Fine-tuning Language Models over Slow Networks using Activation Compression with Guaranteescited by 29
50 most cited of 325 All 325 (JSON)
- 2026Across the Loss Landscape with Progressive Growth25 Aug 2026
- 2026Breaking the Compression Barrier: Cross-Architecture Compression Boundary Learning via Reverse Regrowth17 Aug 2026
- 2026Sparse Gaussian-Mixture-Model Q-Functions via Hadamard Overparametrization for Online Reinforcement Learning26 Jul 2026
- 2026Double-Scoring: Reliable Extraction of Strong Lottery Tickets15 Jul 2026
- 2026Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning10 Jun 2026
- 2026HASTE: Hardware-Aware Dynamic Sparse Training for Large Output Spaces31 May 2026
- 2026Memory-Efficient LLM Training with Dynamic Sparsity: From Stability to Practical Scaling30 May 2026
- 2026SparseOpt: Addressing Normalization-induced Gradient Skew in Sparse Training26 May 2026
- 2026On the Stability of Growth in Structural Plasticity: Forward-Active yet Backward-Starved14 May 2026
- 2026Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers8 May 2026
- 2026Learning Inference Concurrency in DynamicGate MLP Structural and Mathematical Justification15 Apr 2026
- 2026Heterogeneous Connectivity in Sparse Networks: Fan-in Profiles, Gradient Hierarchy, and Topological Equilibria12 Apr 2026
38 more
- 2026Topological Sensitivity in Connectome-Constrained Neural Networks5 Apr 2026
- 2026Growing Networks with Autonomous Pruning20 Mar 2026
- 2026DynamicGate MLP Conditional Computation via Learned Structural Dropout and Input Dependent Gating for Functional Plasticity17 Mar 2026
- 2026ZO-SAM: Zero-Order Sharpness-Aware Minimization for Efficient Sparse Training13 Mar 2026
- 2026Robustness in sparse artificial neural networks trained with adaptive topology25 Feb 2026
- 2026Excitation: Momentum For Experts25 Feb 2026
- 2026A Replicate-and-Quantize Strategy for Plug-and-Play Load Balancing of Sparse Mixture-of-Experts LLMs23 Feb 2026
- 2026Hebbian-Oscillatory Co-Learning21 Feb 2026
- 2026RNM-TD3: N:M Semi-structured Sparse Reinforcement Learning From Scratch16 Feb 2026
- 2026Exploring the impact of adaptive rewiring in Graph Neural Networks11 Feb 2026
- 2026Neural Networks With Dense Weights Are Not Universal Approximators7 Feb 2026
- 2026Topology-Aware Revival for Efficient Sparse Training4 Feb 2026
- 2026Sparse Training of Neural Networks based on Multilevel Mirror Descent3 Feb 2026
- 2026AIRE-Prune: Asymptotic Impulse-Response Energy for State Pruning in State Space Models31 Jan 2026
- 2026Multi-Scale Temporal Homeostasis Enables Efficient and Robust Neural Networks30 Jan 2026
- 2026Routing the Lottery: Adaptive Subnetworks for Heterogeneous Data29 Jan 2026
- 2026SAL: Selective Adaptive Learning for Backpropagation-Free Training with Sparsification29 Jan 2026
- 2025Pruning as a Game: Equilibrium-Driven Sparsification of Neural Networks26 Dec 2025
- 2025Weight-sparse transformers have interpretable circuits17 Nov 2025
- 2025MI-to-Mid Distilled Compression (M2M-DC): An Hybrid-Information-Guided-Block Pruning with Progressive Inner Slicing Approach to Model Compression10 Nov 2025
- 2025EcoSpa: Efficient Transformer Training with Coupled Sparsity9 Nov 2025
- 2025Self-Evidencing Through Hierarchical Gradient Decomposition: A Dissipative System That Maintains Non-Equilibrium Steady-State by Minimizing Variational Free Energy20 Oct 2025
- 2025The Graphon Limit Hypothesis: Understanding Neural Network Pruning via Infinite Width Analysis20 Oct 2025
- 2025SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks16 Oct 2025
- 2025A Free Lunch in LLM Compression: Revisiting Retraining after Pruning16 Oct 2025
- 2025Convergence, design and training of continuous-time dropout as a random batch method15 Oct 2025
- 2025Pruning Cannot Hurt Robustness: Certified Trade-offs in Reinforcement Learning14 Oct 2025
- 2025Rethinking the Role of Dynamic Sparse Training for Scalable Deep Reinforcement Learning14 Oct 2025
- 2025Gradual Capacity Growth for Sparse Network Discovery30 Sep 2025
- 2025Online reinforcement learning via sparse Gaussian mixture model Q-functions18 Sep 2025
- 2025The Lifecycle Principle: Stabilizing Dynamic Neural Networks with State Memory24 Aug 2025
- 2025Neuro-inspired Ensemble-to-Ensemble Communication Primitives for Sparse and Efficient ANNs19 Aug 2025
- 2025ONG: One-Shot NMF-based Gradient Masking for Efficient Model Sparsification18 Aug 2025
- 2025EGGS-PTP: An Expander-Graph Guided Structured Post-training Pruning Method for Large Language Models13 Aug 2025
- 2025Sparsity-Driven Plasticity in Multi-Task Reinforcement Learning9 Aug 2025
- 2025Task complexity shapes internal representations and robustness in neural networks7 Aug 2025
- 2025Reinitializing weights vs units for maintaining plasticity in neural networks31 Jul 2025
- 2025Sparse Self-Federated Learning for Energy Efficient Cooperative Intelligence in Society 5.010 Jul 2025
50 newest of 325 All 325 (JSON)
- 2026DynamicGate MLP Conditional Computation via Learned Structural Dropout and Input Dependent Gating for Functional Plasticity17 Mar 2026
- 2026Excitation: Momentum For Experts25 Feb 2026
- 2026A Replicate-and-Quantize Strategy for Plug-and-Play Load Balancing of Sparse Mixture-of-Experts LLMs23 Feb 2026
- 2023LEMON: Lossless model expansioncited by 23
- 2023PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMscited by 14
- 2023PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs23 Dec 2023
- 2023LEMON: Lossless model expansion12 Oct 2023
- 2024A Survey on Efficient Inference for Large Language Modelscited by 197
- 2024A Survey on Efficient Inference for Large Language Models22 Apr 2024
- 2021Single-Shot Pruning for Offline Reinforcement Learningcited by 21
- 2021Single-Shot Pruning for Offline Reinforcement Learning31 Dec 2021
- 2021ResMLP: Feedforward networks for image classification with data-efficient trainingcited by 338
- 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 227
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2022More ConvNets in the 2020s: Scaling up Kernels Beyond 51x51 using Sparsitycited by 142
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 107
- 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
- 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 83
- 2022SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapterscited by 83
12 most cited of 315 All 315 (JSON)
- 2026Across the Loss Landscape with Progressive Growth25 Aug 2026
- 2026Breaking the Compression Barrier: Cross-Architecture Compression Boundary Learning via Reverse Regrowth17 Aug 2026
- 2026Sparse Gaussian-Mixture-Model Q-Functions via Hadamard Overparametrization for Online Reinforcement Learning26 Jul 2026
- 2026Double-Scoring: Reliable Extraction of Strong Lottery Tickets15 Jul 2026
- 2026Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning10 Jun 2026
- 2026HASTE: Hardware-Aware Dynamic Sparse Training for Large Output Spaces31 May 2026
- 2026Memory-Efficient LLM Training with Dynamic Sparsity: From Stability to Practical Scaling30 May 2026
- 2026SparseOpt: Addressing Normalization-induced Gradient Skew in Sparse Training26 May 2026
- 2026On the Stability of Growth in Structural Plasticity: Forward-Active yet Backward-Starved14 May 2026
- 2026Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers8 May 2026
- 2026Learning Inference Concurrency in DynamicGate MLP Structural and Mathematical Justification15 Apr 2026
- 2026Heterogeneous Connectivity in Sparse Networks: Fan-in Profiles, Gradient Hierarchy, and Topological Equilibria12 Apr 2026
12 newest of 315 All 315 (JSON)