mlsanityData to 14 Oct 2026

Sparse Training from Random Initialization: Aligning Lottery Ticket Masks using Weight Symmetry

arXiv 2505.05143 ↗First posted 8 May 2025cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

The Lottery Ticket Hypothesis (LTH) suggests there exists a sparse LTH mask and weights that achieve the same generalization performance as the dense model while using significantly fewer parameters. However, finding a LTH solution is computationally expensive, and a LTH sparsity mask does not generalize to other random weight initializations. Recent work has suggested that neural networks trained from random initialization find solutions within the same basin modulo permutation, and proposes a method to align trained models within the same loss basin. We hypothesize that misalignment of basins is the reason why LTH masks do not generalize to new random initializations and propose permuting the LTH mask to align with the new optimization basin when performing sparse training from a different random init. We empirically show a significant increase in generalization when sparse training from random initialization with the permuted mask as compared to using the non-permuted LTH mask, on multiple datasets (CIFAR-10, CIFAR-100 and ImageNet) and models (VGG11, ResNet20 and ResNet50).

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 25 of its 34 references that are in the map. First posted on arXiv 8 May 2025.

Builds on

25 of 34 references.

References · 25

  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. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
  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. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
  9. 2019The State of Sparsity in Deep Neural Networkscited by 476
  10. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
  11. 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
  12. 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 291
13 more
  1. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
  2. 2019Uniform convergence may be unable to explain generalization in deep learningcited by 224
  3. 2015Convergent Learning: Do different neural networks learn the same representations?cited by 220
  4. 2019Model Fusion via Optimal Transportcited by 219
  5. 2020Characterising Bias in Compressed Modelscited by 167
  6. 2021Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariancescited by 127
  7. 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 120
  8. 2020Optimizing Mode Connectivity via Neuron Alignmentcited by 86
  9. 2020Gradient Flow in Sparse Neural Networks and How Lottery Tickets Wincited by 77
  10. 2022Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?cited by 38
  11. 2024Simultaneous linear connectivity of neural networks modulo permutationcited by 10
  12. 2024Analysis of Linear Mode Connectivity via Permutation-Based Weight Matching: With Insights into Other Permutation Search Methodscited by 9
  13. 2020Streamlining Tensor and Network Pruning in PyTorchcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.