mlsanityData to 7 Oct 2026

One-Cycle Pruning: Pruning ConvNets Under a Tight Training Budget

arXiv 2107.02086 ↗First posted 5 Jul 2021cs.CV cs.AIcited by 6

Not on the map. Why?

Abstract (arXiv)

Introducing sparsity in a neural network has been an efficient way to reduce its complexity while keeping its performance almost intact. Most of the time, sparsity is introduced using a three-stage pipeline: 1) train the model to convergence, 2) prune the model according to some criterion, 3) fine-tune the pruned model to recover performance. The last two steps are often performed iteratively, leading to reasonable results but also to a time-consuming and complex process. In our work, we propose to get rid of the first step of the pipeline and to combine the two other steps in a single pruning-training cycle, allowing the model to jointly learn for the optimal weights while being pruned. We do this by introducing a novel pruning schedule, named One-Cycle Pruning, which starts pruning from the beginning of the training, and until its very end. Adopting such a schedule not only leads to better performing pruned models but also drastically reduces the training budget required to prune a model. Experiments are conducted on a variety of architectures (VGG-16 and ResNet-18) and datasets (CIFAR-10, CIFAR-100 and Caltech-101), and for relatively high sparsity values (80%, 90%, 95% of weights removed). Our results show that One-Cycle Pruning consistently outperforms commonly used pruning schedules such as One-Shot Pruning, Iterative Pruning and Automated Gradual Pruning, on a fixed training budget.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 18 of its 26 references that are in the map. First posted on arXiv 5 Jul 2021.

Builds on

18 of 26 references.

References · 18

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  5. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  6. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  7. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  8. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  9. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  10. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  11. 2020What is the State of Neural Network Pruning?cited by 578
  12. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
6 more
  1. 2019The State of Sparsity in Deep Neural Networkscited by 471
  2. 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
  3. 2020fastai: A Layered API for Deep Learningcited by 183
  4. 2020The Early Phase of Neural Network Trainingcited by 114
  5. 2019Time Matters in Regularizing Deep Networks: Weight Decay and Data Augmentation Affect Early Learning Dynamics, Matter Little Near Convergencecited by 54
  6. 2019Stabilizing the Lottery Ticket Hypothesiscited by 36

Built on by

Cited by year

Citing papers per year: 2022: 4; 2023: 2.

6 papers.