Pushing the Limits of Sparsity: A Bag of Tricks for Extreme Pruning
Not on the map. Why?
Abstract (arXiv)
Pruning of deep neural networks has been an effective technique for reducing model size while preserving most of the performance of dense networks, crucial for deploying models on memory and power-constrained devices. While recent sparse learning methods have shown promising performance up to moderate sparsity levels such as 95% and 98%, accuracy quickly deteriorates when pushing sparsities to extreme levels due to unique challenges such as fragile gradient flow. In this work, we explore network performance beyond the commonly studied sparsities, and develop techniques that encourage stable training without accuracy collapse even at extreme sparsities, including 99.90%, 99.95% and 99.99% on ResNet architectures. We propose three complementary techniques that enhance sparse training through different mechanisms: 1) Dynamic ReLU phasing, where DyReLU initially allows for richer parameter exploration before being gradually replaced by standard ReLU, 2) weight sharing which reuses parameters within a residual layer while maintaining the same number of learnable parameters, and 3) cyclic sparsity, where both sparsity levels and sparsity patterns evolve dynamically throughout training to better encourage parameter exploration. We evaluate our method, which we term Extreme Adaptive Sparse Training (EAST) at extreme sparsities using ResNet-34 and ResNet-50 on CIFAR-10, CIFAR-100, and ImageNet, achieving competitive or improved performance compared to existing methods, with notable gains at extreme sparsity levels.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 31 of its 38 references that are in the map. First posted on arXiv 20 Nov 2024.
Builds on
31 of 38 references.
References · 31
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 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
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
19 more
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 213
- 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 201
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 189
- 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 182
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 151
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 110
- 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 84
- 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
- 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 79
- 2020Gradient Flow in Sparse Neural Networks and How Lottery Tickets Wincited by 77
- 2020Progressive Skeletonization: Trimming more fat from a network at initializationcited by 64
- 2020Dynamic ReLUcited by 55
- 2023Dynamic Sparse Training with Structured Sparsitycited by 38
- 2020Pruning via Iterative Ranking of Sensitivity Statisticscited by 26
- 2023Dynamic Sparsity Is Channel-Level Sparsity Learnercited by 18
- 2024Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption Robustnesscited by 11
- 2021Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offsetcited by 9
- 2022Superposing Many Tickets into One: A Performance Booster for Sparse Neural Network Trainingcited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.