mlsanityData to 7 Oct 2026

Cyclical Pruning for Sparse Neural Networks

arXiv 2202.01290 ↗First posted 2 Feb 2022cs.LG cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

Current methods for pruning neural network weights iteratively apply magnitude-based pruning on the model weights and re-train the resulting model to recover lost accuracy. In this work, we show that such strategies do not allow for the recovery of erroneously pruned weights. To enable weight recovery, we propose a simple strategy called textitcyclical pruning which requires the pruning schedule to be periodic and allows for weights pruned erroneously in one cycle to recover in subsequent ones. Experimental results on both linear models and large-scale deep neural networks show that cyclical pruning outperforms existing pruning algorithms, especially at high sparsity ratios. Our approach is easy to tune and can be readily incorporated into existing pruning pipelines to boost performance.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 28 of its 37 references that are in the map. First posted on arXiv 2 Feb 2022.

Builds on

28 of 37 references.

References · 28

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  4. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  5. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  6. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  7. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  8. 2020What is the State of Neural Network Pruning?cited by 578
  9. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
  10. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  11. 2019The State of Sparsity in Deep Neural Networkscited by 471
  12. 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 283
16 more
  1. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  2. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
  3. 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
  4. 2017Non-convex Optimization for Machine Learningcited by 132
  5. 2020Dynamic Model Pruning with Feedbackcited by 125
  6. 2017Bayesian Compression for Deep Learningcited by 116
  7. 2018Faster gaze prediction with dense networks and Fisher pruningcited by 92
  8. 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
  9. 2018AI Benchmark: Running Deep Neural Networks on Android Smartphonescited by 75
  10. 2018Compressing Neural Networks using the Variational Information Bottleneckcited by 59
  11. 2019Discovering Neural Wiringscited by 56
  12. 2017Structured Bayesian Pruning via Log-Normal Multiplicative Noisecited by 39
  13. 2019Stabilizing the Lottery Ticket Hypothesiscited by 36
  14. 2020WoodFisher: Efficient Second-Order Approximation for Neural Network Compressioncited by 21
  15. 2020Learned Threshold Pruningcited by 16
  16. 2020Revisiting Loss Modelling for Unstructured Pruningcited by 6

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 3; 2024: 1; 2025: 1.

6 papers.