mlsanityData to 14 Oct 2026

Lottery Pools: Winning More by Interpolating Tickets without Increasing Training or Inference Cost

arXiv 2208.10842 ↗First posted 23 Aug 2022cs.LG cs.AIcited by 11

Not on the map. Why?

Abstract (arXiv)

Lottery tickets (LTs) is able to discover accurate and sparse subnetworks that could be trained in isolation to match the performance of dense networks. Ensemble, in parallel, is one of the oldest time-proven tricks in machine learning to improve performance by combining the output of multiple independent models. However, the benefits of ensemble in the context of LTs will be diluted since ensemble does not directly lead to stronger sparse subnetworks, but leverages their predictions for a better decision. In this work, we first observe that directly averaging the weights of the adjacent learned subnetworks significantly boosts the performance of LTs. Encouraged by this observation, we further propose an alternative way to perform an 'ensemble' over the subnetworks identified by iterative magnitude pruning via a simple interpolating strategy. We call our method Lottery Pools. In contrast to the naive ensemble which brings no performance gains to each single subnetwork, Lottery Pools yields much stronger sparse subnetworks than the original LTs without requiring any extra training or inference cost. Across various modern architectures on CIFAR-10/100 and ImageNet, we show that our method achieves significant performance gains in both, in-distribution and out-of-distribution scenarios. Impressively, evaluated with VGG-16 and ResNet-18, the produced sparse subnetworks outperform the original LTs by up to 1.88% on CIFAR-100 and 2.36% on CIFAR-100-C; the resulting dense network surpasses the pre-trained dense-model up to 2.22% on CIFAR-100 and 2.38% on CIFAR-100-C.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 42 of its 61 references that are in the map. First posted on arXiv 23 Aug 2022.

Builds on

42 of 61 references.

References · 42

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  4. 2020Language Models are Few-Shot Learnerscited by 32,419
  5. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  6. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  7. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  8. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
  9. 2017Progressive Growing of GANs for Improved Quality, Stability, and Variationcited by 2,988
  10. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  11. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  12. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
30 more
  1. 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,287
  2. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  3. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
  4. 2019Green AIcited by 627
  5. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
  6. 2021Carbon Emissions and Large Neural Network Trainingcited by 567
  7. 2019The State of Sparsity in Deep Neural Networkscited by 476
  8. 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
  9. 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 371
  10. 2020What is being transferred in transfer learning?cited by 368
  11. 2017Snapshot Ensembles: Train 1, get M for freecited by 350
  12. 2019Lookahead Optimizer: k steps forward, 1 step backcited by 336
  13. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  14. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
  15. 2019What's Hidden in a Randomly Weighted Neural Network?cited by 237
  16. 2019Uniform convergence may be unable to explain generalization in deep learningcited by 224
  17. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 207
  18. 2022Patching open-vocabulary models by interpolating weightscited by 190
  19. 2019Evaluating Scalable Bayesian Deep Learning Methods for Robust Computer Visioncited by 182
  20. 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
  21. 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
  22. 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
  23. 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 79
  24. 2020Gradient Flow in Sparse Neural Networks and How Lottery Tickets Wincited by 77
  25. 2019Playing the lottery with rewards and multiple languages: lottery tickets in RL and NLPcited by 73
  26. 2021Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsitycited by 44
  27. 2021GANs Can Play Lottery Tickets Toocited by 32
  28. 2022Coarsening the Granularity: Towards Structurally Sparse Lottery Ticketscited by 27
  29. 2022Superposing Many Tickets into One: A Performance Booster for Sparse Neural Network Trainingcited by 6
  30. 2021Load-balanced Gather-scatter Patterns for Sparse Deep Neural Networkscited by 1

Built on by

Cited by year

Citing papers per year: 2023: 8; 2024: 3.

11 papers.