mlsanityData to 13 Oct 2026

Towards Understanding Iterative Magnitude Pruning: Why Lottery Tickets Win

arXiv 2106.06955 ↗First posted 13 Jun 2021cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

The lottery ticket hypothesis states that sparse subnetworks exist in randomly initialized dense networks that can be trained to the same accuracy as the dense network they reside in. However, the subsequent work has failed to replicate this on large-scale models and required rewinding to an early stable state instead of initialization. We show that by using a training method that is stable with respect to linear mode connectivity, large networks can also be entirely rewound to initialization. Our subsequent experiments on common vision tasks give strong credence to the hypothesis in Evci et al. (2020b) that lottery tickets simply retrain to the same regions (although not necessarily to the same basin). These results imply that existing lottery tickets could not have been found without the preceding dense training by iterative magnitude pruning, raising doubts about the use of the lottery ticket hypothesis.

Key facts. Cited by 11 papers in the map (data through 13 Oct 2026). Builds on 25 of its 29 references that are in the map. First posted on arXiv 13 Jun 2021.

Builds on

25 of 29 references.

References · 25

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,950
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,257
  3. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,488
  4. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 809
  5. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 631
  6. 2018Rethinking the Value of Network Pruningcited by 597
  7. 2020What is the State of Neural Network Pruning?cited by 582
  8. 2019Rigging the Lottery: Making All Tickets Winnerscited by 493
  9. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 476
  10. 2019The State of Sparsity in Deep Neural Networkscited by 474
  11. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  12. 2018An Empirical Model of Large-Batch Trainingcited by 274
13 more
  1. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
  2. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 212
  3. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 207
  4. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
  5. 2019What Do Compressed Deep Neural Networks Forget?cited by 169
  6. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  7. 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
  8. 2020The Early Phase of Neural Network Trainingcited by 114
  9. 2020Training BatchNorm and Only BatchNorm: On the Expressive Power of Random Features in CNNscited by 104
  10. 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
  11. 2019Winning the Lottery with Continuous Sparsificationcited by 99
  12. 2020Gradient Flow in Sparse Neural Networks and How Lottery Tickets Wincited by 77
  13. 2019Sparse Transfer Learning via Winning Lottery Ticketscited by 27

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 6; 2024: 3; 2025: 0; 2026: 1.

11 papers.