mlsanityData to 7 Oct 2026

Winning the Lottery Ahead of Time: Efficient Early Network Pruning

arXiv 2206.10451 ↗First posted 21 Jun 2022cs.LGcited by 21

Not on the map. Why?

Abstract (arXiv)

Pruning, the task of sparsifying deep neural networks, received increasing attention recently. Although state-of-the-art pruning methods extract highly sparse models, they neglect two main challenges: (1) the process of finding these sparse models is often very expensive; (2) unstructured pruning does not provide benefits in terms of GPU memory, training time, or carbon emissions. We propose Early Compression via Gradient Flow Preservation (EarlyCroP), which efficiently extracts state-of-the-art sparse models before or early in training addressing challenge (1), and can be applied in a structured manner addressing challenge (2). This enables us to train sparse networks on commodity GPUs whose dense versions would be too large, thereby saving costs and reducing hardware requirements. We empirically show that EarlyCroP outperforms a rich set of baselines for many tasks (incl. classification, regression) and domains (incl. computer vision, natural language processing, and reinforcment learning). EarlyCroP leads to accuracy comparable to dense training while outperforming pruning baselines.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). Builds on 42 of its 53 references that are in the map. First posted on arXiv 21 Jun 2022.

Builds on

42 of 53 references.

References · 42

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2016Pointer Sentinel Mixture Modelscited by 2,992
  4. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  5. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  6. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  7. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  8. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  9. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  10. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  11. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
  12. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
30 more
  1. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  2. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  3. 2016Deeper Depth Prediction with Fully Convolutional Residual Networkscited by 402
  4. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
  5. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  6. 2020Kernel and Rich Regimes in Overparametrized Modelscited by 302
  7. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  8. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
  9. 2018Gradient Descent Happens in a Tiny Subspacecited by 208
  10. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
  11. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
  12. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
  13. 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
  14. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  15. 2019Linearized two-layers neural networks in high dimensioncited by 155
  16. 2017Deep Rewiring: Training very sparse deep networkscited by 136
  17. 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
  18. 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
  19. 2017Critical Learning Periods in Deep Neural Networkscited by 78
  20. 2019Centripetal SGD for Pruning Very Deep Convolutional Networks with Complicated Structurecited by 76
  21. 2019Optimization for deep learning: theory and algorithmscited by 70
  22. 2020Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpotcited by 66
  23. 2020Progressive Skeletonization: Trimming more fat from a network at initializationcited by 64
  24. 2019PruneTrain: Fast Neural Network Training by Dynamic Sparse Model Reconfigurationcited by 41
  25. 2020A Gradient Flow Framework For Analyzing Network Pruningcited by 35
  26. 2018Asymptotic Soft Filter Pruning for Deep Convolutional Neural Networkscited by 27
  27. 2020Pruning via Iterative Ranking of Sensitivity Statisticscited by 25
  28. 2019Truth or Backpropaganda? An Empirical Investigation of Deep Learning Theorycited by 21
  29. 2016Generalized Dropoutcited by 13
  30. 2020Any Target Function Exists in a Neighborhood of Any Sufficiently Wide Random Network: A Geometrical Perspectivecited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 8; 2024: 10; 2025: 1; 2026: 1.

21 papers.

Sort:

By area:

  1. 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
  2. 2024A Survey of Lottery Ticket Hypothesiscited by 23
  3. 2023A Unified Framework for Soft Threshold Pruningcited by 12
  4. 2024Structurally Prune Anything: Any Architecture, Any Framework, Any Timecited by 8
  5. 2024Shaving Weights with Occam's Razor: Bayesian Sparsification for Neural Networks Using the Marginal Likelihoodcited by 7
  6. 2023Towards a Smaller Student: Capacity Dynamic Distillation for Efficient Image Retrievalcited by 6
  7. 2024Maxwell's Demon at Work: Efficient Pruning by Leveraging Saturation of Neuronscited by 5
  8. 2024Poor Man's Training on MCUs: A Memory-Efficient Quantized Back-Propagation-Free Approachcited by 5
  9. 2024F3OCUS -- Federated Finetuning of Vision-Language Foundation Models with Optimal Client Layer Updating Strategy via Multi-objective Meta-Heuristicscited by 4
  10. 2024Decentralized Personalized Federated Learning based on a Conditional Sparse-to-Sparser Schemecited by 3
  11. 2024Train Faster, Perform Better: Modular Adaptive Training in Over-Parameterized Modelscited by 3
  12. 2023Towards Compute-Optimal Transfer Learningcited by 2
9 more
  1. 2023Pruning at Initialization -- A Sketching Perspectivecited by 2
  2. 2022On the Robustness and Anomaly Detection of Sparse Neural Networkscited by 1
  3. 2023Quantized Distillation: Optimizing Driver Activity Recognition Models for Resource-Constrained Environmentscited by 1
  4. 2023Surrogate Lagrangian Relaxation: A Path To Retrain-free Deep Neural Network Pruningcited by 0
  5. 2023A Generalization of Continuous Relaxation in Structured Pruningcited by 0
  6. 2024A Comprehensive Study of Structural Pruning for Vision Modelscited by 0
  7. 2024A Greedy Hierarchical Approach to Whole-Network Filter-Pruning in CNNscited by 0
  8. 2025Compact Vision Transformer by Reduction of Kernel Complexitycited by 0
  9. 2026Neural Feature Governance: Extending Atom Prevalencecited by 0