Training Your Sparse Neural Network Better with Any Mask
Not on the map. Why?
Abstract (arXiv)
Pruning large neural networks to create high-quality, independently trainable sparse masks, which can maintain similar performance to their dense counterparts, is very desirable due to the reduced space and time complexity. As research effort is focused on increasingly sophisticated pruning methods that leads to sparse subnetworks trainable from the scratch, we argue for an orthogonal, under-explored theme: improving training techniques for pruned sub-networks, i.e. sparse training. Apart from the popular belief that only the quality of sparse masks matters for sparse training, in this paper we demonstrate an alternative opportunity: one can carefully customize the sparse training techniques to deviate from the default dense network training protocols, consisting of introducing ``ghost" neurons and skip connections at the early stage of training, and strategically modifying the initialization as well as labels. Our new sparse training recipe is generally applicable to improving training from scratch with various sparse masks. By adopting our newly curated techniques, we demonstrate significant performance gains across various popular datasets (CIFAR-10, CIFAR-100, TinyImageNet), architectures (ResNet-18/32/104, Vgg16, MobileNet), and sparse mask options (lottery ticket, SNIP/GRASP, SynFlow, or even randomly pruning), compared to the default training protocols, especially at high sparsity levels. Code is at https://github.com/VITA-Group/ToST
Key facts. Cited by 26 papers in the map (data through 14 Oct 2026). Builds on 47 of its 56 references that are in the map. First posted on arXiv 26 Jun 2022.
Builds on
47 of 56 references.
References · 47
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,845
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2018On the Spectral Bias of Neural Networkscited by 1,341
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
35 more
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2019When Does Label Smoothing Help?cited by 988
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
- 2018Rethinking the Value of Network Pruningcited by 599
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2021RepVGG: Making VGG-style ConvNets Great Againcited by 522
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
- 2019The State of Sparsity in Deep Neural Networkscited by 476
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
- 2017Sharp Minima Can Generalize For Deep Netscited by 466
- 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 426
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
- 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 292
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
- 2021Training Neural Networks with Fixed Sparse Maskscited by 214
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 183
- 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 182
- 2019Mish: A Self Regularized Non-Monotonic Activation Functioncited by 141
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 110
- 2019Winning the Lottery with Continuous Sparsificationcited by 100
- 2019A Signal Propagation Perspective for Pruning Neural Networks at Initializationcited by 96
- 2020The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Modelscited by 91
- 2020Gradient Flow in Sparse Neural Networks and How Lottery Tickets Wincited by 77
- 2020Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpotcited by 66
- 2019The Difficulty of Training Sparse Neural Networkscited by 62
- 2021GradInit: Learning to Initialize Neural Networks for Stable and Efficient Trainingcited by 44
- 2022Sparsity Winning Twice: Better Robust Generalization from More Efficient Trainingcited by 41
- 2020The Two Regimes of Deep Network Trainingcited by 30
- 2021Keep the Gradients Flowing: Using Gradient Flow to Study Sparse Network Optimizationcited by 22
- 2019A Reparameterization-Invariant Flatness Measure for Deep Neural Networkscited by 7
Built on by
Citing papers per year: 2022: 5; 2023: 12; 2024: 5; 2025: 4.
26 papers.
Sort:
By area:
- 2023Compressing LLMs: The Truth is Rarely Pure and Never Simplecited by 62
- 2024Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compressioncited by 57
- 2023The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Mattercited by 42
- 2024FFN-SkipLLM: A Hidden Gem for Autoregressive Decoding with Adaptive Feed Forward Skippingcited by 23
- 2023Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Modelscited by 20
- 2025Finding Fantastic Experts in MoEs: A Unified Study for Expert Dropping Strategies and Observationscited by 20
- 2022Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networkscited by 18
- 2023Dynamic Sparsity Is Channel-Level Sparsity Learnercited by 18
- 2024Random Masking Finds Winning Tickets for Parameter Efficient Fine-tuningcited by 17
- 2023Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs "Difficult" Downstream Tasks in LLMscited by 13
- 2023Accurate Neural Network Pruning Requires Rethinking Sparse Optimizationcited by 10
- 2023Master-ASR: Achieving Multilingual Scalability and Low-Resource Adaptation in ASR with Modular Learningcited by 9
14 more
- 2023HyperSparse Neural Networks: Shifting Exploration to Exploitation through Adaptive Regularizationcited by 9
- 2025Preserving LLM Capabilities through Calibration Data Curation: From Analysis to Optimizationcited by 9
- 2022Complexity-Driven CNN Compression for Resource-constrained Edge AIcited by 8
- 2024EPSD: Early Pruning with Self-Distillation for Efficient Model Compressioncited by 6
- 2022RoS-KD: A Robust Stochastic Knowledge Distillation Approach for Noisy Medical Imagingcited by 4
- 2022Attend Who is Weak: Pruning-assisted Medical Image Localization under Sophisticated and Implicit Imbalancescited by 4
- 2023Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retrainingcited by 4
- 2025Dynamic Sparse Training of Diagonally Sparse Networkscited by 4
- 2024Beyond 2:4: exploring V:N:M sparsity for efficient transformer inference on GPUscited by 2
- 2023Learning Activation Functions for Sparse Neural Networkscited by 1
- 2022Symbolic Distillation for Learned TCP Congestion Controlcited by 0
- 2023One is More: Diverse Perspectives within a Single Network for Efficient DRLcited by 0
- 2023An End-to-End Network Pruning Pipeline with Sparsity Enforcementcited by 0
- 2025SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networkscited by 0
- 2025SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks16 Oct 2025
- 2025Preserving LLM Capabilities through Calibration Data Curation: From Analysis to Optimization12 Oct 2025
- 2025Dynamic Sparse Training of Diagonally Sparse Networks13 Jun 2025
- 2025Finding Fantastic Experts in MoEs: A Unified Study for Expert Dropping Strategies and Observations8 Apr 2025
- 2024Beyond 2:4: exploring V:N:M sparsity for efficient transformer inference on GPUs21 Oct 2024
- 2024Random Masking Finds Winning Tickets for Parameter Efficient Fine-tuning4 May 2024
- 2024FFN-SkipLLM: A Hidden Gem for Autoregressive Decoding with Adaptive Feed Forward Skipping5 Apr 2024
- 2024Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression18 Mar 2024
- 2024EPSD: Early Pruning with Self-Distillation for Efficient Model Compression31 Jan 2024
- 2023An End-to-End Network Pruning Pipeline with Sparsity Enforcement4 Dec 2023
- 2023One is More: Diverse Perspectives within a Single Network for Efficient DRL21 Oct 2023
- 2023Compressing LLMs: The Truth is Rarely Pure and Never Simple2 Oct 2023
14 more
- 2023Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs "Difficult" Downstream Tasks in LLMs29 Sep 2023
- 2023HyperSparse Neural Networks: Shifting Exploration to Exploitation through Adaptive Regularization14 Aug 2023
- 2023Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retraining13 Aug 2023
- 2023Accurate Neural Network Pruning Requires Rethinking Sparse Optimization3 Aug 2023
- 2023Master-ASR: Achieving Multilingual Scalability and Low-Resource Adaptation in ASR with Modular Learning23 Jun 2023
- 2023Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Models18 Jun 2023
- 2023The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Matter6 Jun 2023
- 2023Dynamic Sparsity Is Channel-Level Sparsity Learner30 May 2023
- 2023Learning Activation Functions for Sparse Neural Networks18 May 2023
- 2022Attend Who is Weak: Pruning-assisted Medical Image Localization under Sophisticated and Implicit Imbalances6 Dec 2022
- 2022Symbolic Distillation for Learned TCP Congestion Control24 Oct 2022
- 2022RoS-KD: A Robust Stochastic Knowledge Distillation Approach for Noisy Medical Imaging15 Oct 2022
- 2022Complexity-Driven CNN Compression for Resource-constrained Edge AI26 Aug 2022
- 2022Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks18 Jul 2022
- 2023Compressing LLMs: The Truth is Rarely Pure and Never Simplecited by 62
- 2024Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compressioncited by 57
- 2023The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Mattercited by 42
- 2023Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Modelscited by 20
- 2022Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networkscited by 18
- 2023Dynamic Sparsity Is Channel-Level Sparsity Learnercited by 18
- 2024Random Masking Finds Winning Tickets for Parameter Efficient Fine-tuningcited by 17
- 2023Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs "Difficult" Downstream Tasks in LLMscited by 13
- 2023Accurate Neural Network Pruning Requires Rethinking Sparse Optimizationcited by 10
- 2023Master-ASR: Achieving Multilingual Scalability and Low-Resource Adaptation in ASR with Modular Learningcited by 9
- 2023HyperSparse Neural Networks: Shifting Exploration to Exploitation through Adaptive Regularizationcited by 9
- 2025Preserving LLM Capabilities through Calibration Data Curation: From Analysis to Optimizationcited by 9
12 most cited of 22 All 22 (JSON)
- 2025SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks16 Oct 2025
- 2025Preserving LLM Capabilities through Calibration Data Curation: From Analysis to Optimization12 Oct 2025
- 2025Dynamic Sparse Training of Diagonally Sparse Networks13 Jun 2025
- 2024Beyond 2:4: exploring V:N:M sparsity for efficient transformer inference on GPUs21 Oct 2024
- 2024Random Masking Finds Winning Tickets for Parameter Efficient Fine-tuning4 May 2024
- 2024Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression18 Mar 2024
- 2023An End-to-End Network Pruning Pipeline with Sparsity Enforcement4 Dec 2023
- 2023One is More: Diverse Perspectives within a Single Network for Efficient DRL21 Oct 2023
- 2023Compressing LLMs: The Truth is Rarely Pure and Never Simple2 Oct 2023
- 2023Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs "Difficult" Downstream Tasks in LLMs29 Sep 2023
- 2023HyperSparse Neural Networks: Shifting Exploration to Exploitation through Adaptive Regularization14 Aug 2023
- 2023Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retraining13 Aug 2023
12 newest of 22 All 22 (JSON)