mlsanityData to 7 Oct 2026

Why is the State of Neural Network Pruning so Confusing? On the Fairness, Comparison Setup, and Trainability in Network Pruning

arXiv 2301.05219 ↗First posted 12 Jan 2023cs.CV cs.AI cs.LGcited by 16

Not on the map. Why?

Abstract (arXiv)

The state of neural network pruning has been noticed to be unclear and even confusing for a while, largely due to "a lack of standardized benchmarks and metrics" [3]. To standardize benchmarks, first, we need to answer: what kind of comparison setup is considered fair? This basic yet crucial question has barely been clarified in the community, unfortunately. Meanwhile, we observe several papers have used (severely) sub-optimal hyper-parameters in pruning experiments, while the reason behind them is also elusive. These sub-optimal hyper-parameters further exacerbate the distorted benchmarks, rendering the state of neural network pruning even more obscure. Two mysteries in pruning represent such a confusing status: the performance-boosting effect of a larger finetuning learning rate, and the no-value argument of inheriting pretrained weights in filter pruning. In this work, we attempt to explain the confusing state of network pruning by demystifying the two mysteries. Specifically, (1) we first clarify the fairness principle in pruning experiments and summarize the widely-used comparison setups; (2) then we unveil the two pruning mysteries and point out the central role of network trainability, which has not been well recognized so far; (3) finally, we conclude the paper and give some concrete suggestions regarding how to calibrate the pruning benchmarks in the future. Code: https://github.com/mingsun-tse/why-the-state-of-pruning-so-confusing.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 59 of its 90 references that are in the map. First posted on arXiv 12 Jan 2023.

Builds on

59 of 90 references.

References · 59

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  4. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  5. 2020Language Models are Few-Shot Learnerscited by 32,199
  6. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  7. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
  8. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  9. 2016Densely Connected Convolutional Networkscited by 6,691
  10. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  11. 2017Squeeze-and-Excitation Networkscited by 4,763
  12. 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
38 more
  1. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  2. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  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. 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
  6. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  7. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  8. 2014Deep Learning in Neural Networks: An Overviewcited by 765
  9. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
  10. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  11. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  12. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  13. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  14. 2018Rethinking the Value of Network Pruningcited by 595
  15. 2020What is the State of Neural Network Pruning?cited by 578
  16. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  17. 2019Importance Estimation for Neural Network Pruningcited by 531
  18. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
  19. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  20. 2019The State of Sparsity in Deep Neural Networkscited by 471
  21. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  22. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
  23. 2017Efficient Processing of Deep Neural Networks: A Tutorial and Surveycited by 427
  24. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
  25. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
  26. 2014Caffe: Convolutional Architecture for Fast Feature Embeddingcited by 287
  27. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
  28. 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
  29. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
  30. 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
  31. 2018Dynamical Isometry and a Mean Field Theory of CNNs: How to Train 10,000-Layer Vanilla Convolutional Neural Networkscited by 176
  32. 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
  33. 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
  34. 2015All you need is a good initcited by 124
  35. 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
  36. 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
  37. 2020Neural Pruning via Growing Regularizationcited by 97
  38. 2019A Signal Propagation Perspective for Pruning Neural Networks at Initializationcited by 96

50 most cited of 59 All 59 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 5; 2024: 7; 2025: 3; 2026: 1.

16 papers.

Sort: