mlsanityData to 7 Oct 2026

Sparser, Better, Deeper, Stronger: Improving Sparse Training with Exact Orthogonal Initialization

arXiv 2406.01755 ↗First posted 3 Jun 2024cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Static sparse training aims to train sparse models from scratch, achieving remarkable results in recent years. A key design choice is given by the sparse initialization, which determines the trainable sub-network through a binary mask. Existing methods mainly select such mask based on a predefined dense initialization. Such an approach may not efficiently leverage the mask's potential impact on the optimization. An alternative direction, inspired by research into dynamical isometry, is to introduce orthogonality in the sparse subnetwork, which helps in stabilizing the gradient signal. In this work, we propose Exact Orthogonal Initialization (EOI), a novel sparse orthogonal initialization scheme based on composing random Givens rotations. Contrary to other existing approaches, our method provides exact (not approximated) orthogonality and enables the creation of layers with arbitrary densities. We demonstrate the superior effectiveness and efficiency of EOI through experiments, consistently outperforming common sparse initialization techniques. Our method enables training highly sparse 1000-layer MLP and CNN networks without residual connections or normalization techniques, emphasizing the crucial role of weight initialization in static sparse training alongside sparse mask selection. The code is available at https://github.com/woocash2/sparser-better-deeper-stronger

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 44 of its 66 references that are in the map. First posted on arXiv 3 Jun 2024.

Builds on

44 of 66 references.

References · 44

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  5. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  6. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  7. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
  8. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  9. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  10. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  11. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  12. 2022DeiT III: Revenge of the ViTcited by 417
32 more
  1. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  2. 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
  3. 2016FractalNet: Ultra-Deep Neural Networks without Residualscited by 216
  4. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
  5. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
  6. 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
  7. 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
  8. 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
  9. 2018Dynamical Isometry and a Mean Field Theory of CNNs: How to Train 10,000-Layer Vanilla Convolutional Neural Networkscited by 176
  10. 2016Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivitycited by 138
  11. 2017Resurrecting the sigmoid in deep learning through dynamical isometry: theory and practicecited by 132
  12. 2019Orthogonal Convolutional Neural Networkscited by 122
  13. 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 117
  14. 2021Orthogonalizing Convolutional Layers with the Cayley Transformcited by 105
  15. 2019A Signal Propagation Perspective for Pruning Neural Networks at Initializationcited by 96
  16. 2019Preventing Gradient Attenuation in Lipschitz Constrained Convolutional Networkscited by 86
  17. 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
  18. 2020Optimal Lottery Tickets via SubsetSum: Logarithmic Over-Parameterization is Sufficientcited by 81
  19. 2020Gradient Flow in Sparse Neural Networks and How Lottery Tickets Wincited by 77
  20. 2020Provable Benefit of Orthogonal Initialization in Optimizing Deep Linear Networkscited by 73
  21. 2021Skew Orthogonal Convolutionscited by 67
  22. 2020Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpotcited by 66
  23. 2017All You Need is Beyond a Good Init: Exploring Better Solution for Training Extremely Deep Convolutional Neural Networks with Orthonormality and Modulationcited by 58
  24. 2018Mad Max: Affine Spline Insights into Deep Learningcited by 54
  25. 2018Dynamical Isometry and a Mean Field Theory of RNNs: Gating Enables Signal Propagation in Recurrent Neural Networkscited by 44
  26. 2021Recent Advances on Neural Network Pruning at Initializationcited by 41
  27. 2023Ten Lessons We Have Learned in the New "Sparseland": A Short Handbook for Sparse Neural Network Researcherscited by 25
  28. 2018Dynamical Isometry is Achieved in Residual Networks in a Universal Way for any Activation Functioncited by 22
  29. 2019Approximating Orthogonal Matrices with Effective Givens Factorizationcited by 7
  30. 2023Towards a Better Theoretical Understanding of Independent Subnetwork Trainingcited by 6
  31. 2023Linear Mode Connectivity in Sparse Neural Networkscited by 2
  32. 2022Givens Rotations for QR Decomposition, SVD and PCA over Database Joinscited by 1

Built on by

Cited by year (2026 to 7 Oct)

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

3 papers.