mlsanityData to 7 Oct 2026

Lottery Ticket Preserves Weight Correlation: Is It Desirable or Not?

arXiv 2102.11068 ↗First posted 19 Feb 2021cs.LG cs.AI cs.CVcited by 22

Not on the map. Why?

Abstract (arXiv)

In deep model compression, the recent finding "Lottery Ticket Hypothesis" (LTH) (Frankle & Carbin, 2018) pointed out that there could exist a winning ticket (i.e., a properly pruned sub-network together with original weight initialization) that can achieve competitive performance than the original dense network. However, it is not easy to observe such winning property in many scenarios, where for example, a relatively large learning rate is used even if it benefits training the original dense model. In this work, we investigate the underlying condition and rationale behind the winning property, and find that the underlying reason is largely attributed to the correlation between initialized weights and final-trained weights when the learning rate is not sufficiently large. Thus, the existence of winning property is correlated with an insufficient DNN pretraining, and is unlikely to occur for a well-trained DNN. To overcome this limitation, we propose the "pruning & fine-tuning" method that consistently outperforms lottery ticket sparse training under the same pruning algorithm and the same total training epochs. Extensive experiments over multiple deep models (VGG, ResNet, MobileNet-v2) on different datasets have been conducted to justify our proposals.

Key facts. Cited by 22 papers in the map (data through 7 Oct 2026). Builds on 24 of its 33 references that are in the map. First posted on arXiv 19 Feb 2021.

Builds on

24 of 33 references.

References · 24

  1. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  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. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  6. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  7. 2018Rethinking the Value of Network Pruningcited by 595
  8. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  9. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  10. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
  11. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
  12. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
12 more
  1. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
  2. 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
  3. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
  4. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  5. 2020The Early Phase of Neural Network Trainingcited by 114
  6. 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
  7. 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70
  8. 2017NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigmcited by 60
  9. 2019AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Ratescited by 49
  10. 2018ADMM-NN: An Algorithm-Hardware Co-Design Framework of DNNs Using Alternating Direction Method of Multiplierscited by 42
  11. 20182PFPCE: Two-Phase Filter Pruning Based on Conditional Entropycited by 14
  12. 2018Systematic Weight Pruning of DNNs using Alternating Direction Method of Multiplierscited by 4

Built on by

Cited by year

Citing papers per year: 2021: 6; 2022: 7; 2023: 4; 2024: 5.

22 papers.

Sort:

By area:

  1. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
  2. 2021SPViT: Enabling Faster Vision Transformers via Soft Token Pruningcited by 165
  3. 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 77
  4. 2022F8Net: Fixed-Point 8-bit Only Multiplication for Network Quantizationcited by 26
  5. 2021Effective Model Sparsification by Scheduled Grow-and-Prune Methodscited by 25
  6. 2021On the Effect of Pruning on Adversarial Robustnesscited by 23
  7. 2023Rethinking Graph Lottery Tickets: Graph Sparsity Matterscited by 23
  8. 2024A Survey of Lottery Ticket Hypothesiscited by 23
  9. 2022Most Activation Functions Can Win the Lottery Without Excessive Depthcited by 21
  10. 2022Convolutional and Residual Networks Provably Contain Lottery Ticketscited by 16
  11. 2024Masks, Signs, And Learning Rate Rewindingcited by 15
  12. 2021Plant 'n' Seek: Can You Find the Winning Ticket?cited by 13
10 more
  1. 2022Layer Freezing & Data Sieving: Missing Pieces of a Generic Framework for Sparse Trainingcited by 11
  2. 2022Analyzing Lottery Ticket Hypothesis from PAC-Bayesian Theory Perspectivecited by 9
  3. 2024Accelerating ViT Inference on FPGA through Static and Dynamic Pruningcited by 5
  4. 2021Lottery Tickets with Nonzero Biasescited by 4
  5. 2022COLT: Cyclic Overlapping Lottery Tickets for Faster Pruning of Convolutional Neural Networkscited by 3
  6. 2023When Layers Play the Lottery, all Tickets Win at Initializationcited by 3
  7. 2024Fast and Controllable Post-training Sparsity: Learning Optimal Sparsity Allocation with Global Constraint in Minutescited by 3
  8. 2022PrUE: Distilling Knowledge from Sparse Teacher Networkscited by 1
  9. 2023Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functionscited by 1
  10. 2024AlterMOMA: Fusion Redundancy Pruning for Camera-LiDAR Fusion Models with Alternative Modality Maskingcited by 0