mlsanityData to 14 Oct 2026

Pruning's Effect on Generalization Through the Lens of Training and Regularization

arXiv 2210.13738 ↗First posted 25 Oct 2022cs.LG stat.MLcited by 31

Not on the map. Why?

Abstract (arXiv)

Practitioners frequently observe that pruning improves model generalization. A long-standing hypothesis based on bias-variance trade-off attributes this generalization improvement to model size reduction. However, recent studies on over-parameterization characterize a new model size regime, in which larger models achieve better generalization. Pruning models in this over-parameterized regime leads to a contradiction -- while theory predicts that reducing model size harms generalization, pruning to a range of sparsities nonetheless improves it. Motivated by this contradiction, we re-examine pruning's effect on generalization empirically. We show that size reduction cannot fully account for the generalization-improving effect of standard pruning algorithms. Instead, we find that pruning leads to better training at specific sparsities, improving the training loss over the dense model. We find that pruning also leads to additional regularization at other sparsities, reducing the accuracy degradation due to noisy examples over the dense model. Pruning extends model training time and reduces model size. These two factors improve training and add regularization respectively. We empirically demonstrate that both factors are essential to fully explaining pruning's impact on generalization.

Key facts. Cited by 31 papers in the map (data through 14 Oct 2026). Builds on 46 of its 75 references that are in the map. First posted on arXiv 25 Oct 2022.

Builds on

46 of 75 references.

References · 46

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  4. 2014Going Deeper with Convolutionscited by 4,241
  5. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  7. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  8. 2016Equality of Opportunity in Supervised Learningcited by 2,007
  9. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  10. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  11. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  12. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
34 more
  1. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  2. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
  3. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
  4. 2015Cyclical Learning Rates for Training Neural Networkscited by 629
  5. 2018Rethinking the Value of Network Pruningcited by 599
  6. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
  7. 2020What is the State of Neural Network Pruning?cited by 583
  8. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 533
  9. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
  10. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
  11. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  12. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 342
  13. 2015Norm-Based Capacity Control in Neural Networkscited by 299
  14. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
  15. 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
  16. 2019Uniform convergence may be unable to explain generalization in deep learningcited by 224
  17. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 221
  18. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 182
  19. 2019What Do Compressed Deep Neural Networks Forget?cited by 171
  20. 2020Characterising Bias in Compressed Modelscited by 167
  21. 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 126
  22. 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
  23. 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
  24. 2019A Signal Propagation Perspective for Pruning Neural Networks at Initializationcited by 96
  25. 2015Fast ConvNets Using Group-wise Brain Damagecited by 82
  26. 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
  27. 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
  28. 2019The Generalization-Stability Tradeoff In Neural Network Pruningcited by 54
  29. 2018Data-Dependent Coresets for Compressing Neural Networks with Applications to Generalization Boundscited by 43
  30. 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networkscited by 41
  31. 2020Lossless Compression of Deep Neural Networkscited by 34
  32. 2022FairGRAPE: Fairness-aware GRAdient Pruning mEthod for Face Attribute Classificationcited by 30
  33. 2021Scaling Up Exact Neural Network Compression by ReLU Stabilitycited by 19
  34. 2021Simon Says: Evaluating and Mitigating Bias in Pruned Neural Networks with Knowledge Distillationcited by 15

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 11; 2024: 10; 2025: 6; 2026: 4.

31 papers.

Sort:

By area:

  1. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  2. 2023The Truth is in There: Improving Reasoning in Language Models with Layer-Selective Rank Reductioncited by 123
  3. 2024Pruning for Protection: Increasing Jailbreak Resistance in Aligned LLMs Without Fine-Tuningcited by 26
  4. 2024Mixture of Experts in a Mixture of RL settingscited by 21
  5. 2024A Tighter Complexity Analysis of SparseGPTcited by 19
  6. 2024Mask in the Mirror: Implicit Sparsificationcited by 14
  7. 2024Dataset Difficulty and the Role of Inductive Biascited by 12
  8. 2023The Cost of Down-Scaling Language Models: Fact Recall Deteriorates before In-Context Learningcited by 7
  9. 2023Streaming Kernel PCA Algorithm With Small Spacecited by 5
  10. 2025Hierarchical Safety Realignment: Lightweight Restoration of Safety in Pruned Large Vision-Language Modelscited by 4
  11. 2023Benchmarking Adversarial Robustness of Compressed Deep Learning Modelscited by 3
  12. 2023Effective Neural Network L0 Regularization With BinMaskcited by 2
19 more
  1. 2023Quantifying lottery tickets under label noise: accuracy, calibration, and complexitycited by 2
  2. 2023Pruning for Better Domain Generalizabilitycited by 2
  3. 2024Optimal Eye Surgeon: Finding Image Priors through Sparse Generators at Initializationcited by 2
  4. 2025The Journey Matters: Average Parameter Count over Pre-training Unifies Sparse and Dense Scaling Lawscited by 2
  5. 2025Sparsity-Driven Plasticity in Multi-Task Reinforcement Learningcited by 2
  6. 2025Pruning as Regularization: Sensitivity-Aware One-Shot Pruning in ASRcited by 2
  7. 2024Cyclic Sparse Training: Is it Enough?cited by 1
  8. 2024Are Sparse Neural Networks Better Hard Sample Learners?cited by 1
  9. 2024CRoP: Context-wise Robust Static Human-Sensing Personalizationcited by 1
  10. 2026Environment-Aware Adaptive Pruning with Interleaved Inference Orchestration for Vision-Language-Action Modelscited by 1
  11. 2023Neural Sculpting: Uncovering hierarchically modular task structure in neural networks through pruning and network analysiscited by 0
  12. 2023Generalization Bounds for Magnitude-Based Pruning via Sparse Matrix Sketchingcited by 0
  13. 2023MGAS: Multi-Granularity Architecture Search for Trade-Off Between Model Effectiveness and Efficiencycited by 0
  14. 2024Insights into the Lottery Ticket Hypothesis and Iterative Magnitude Pruningcited by 0
  15. 2025SwiftPrune: Hessian-Free Weight Pruning for Large Language Modelscited by 0
  16. 2025As easy as PIE: understanding when pruning causes language models to disagreecited by 0
  17. 2026Regularisation in neural networks: a survey and empirical analysis of approachescited by 0
  18. 2026Neural Networks With Dense Weights Are Not Universal Approximatorscited by 0
  19. 2026Lottery Tickets Are Not Deployment Ticketscited by 0