SparseOpt: Addressing Normalization-induced Gradient Skew in Sparse Training
Not on the map. Why?
Abstract (arXiv)
Dynamic Sparse Training (DST) methods train neural networks by maintaining sparsity while dynamically adapting the network topology. Despite the promise of reduced computation, DST methods converge significantly slower than dense training, often requiring comparable training time to achieve similar accuracy. We demonstrate both analytically and empirically that Batch Normalization (BN) adversely affects sparse training, and propose SparseOpt, a sparsity-aware optimizer, to address this. Experiments on ResNet models across CIFAR-100 and ImageNet demonstrate consistently faster convergence and improved generalization with our proposed method. Our work highlights the limitations of current normalization layers in sparse training and provides the first systematic study of the interaction between Batch Normalization, sparse layers, and DST, taking a significant step toward making DST practically competitive with dense training.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 29 references that are in the map. First posted on arXiv 26 May 2026.
Builds on
22 of 29 references.
References · 22
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2016Layer Normalizationcited by 5,669
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2018Group Normalizationcited by 1,524
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
- 2015Preconditioned Stochastic Gradient Langevin Dynamics for Deep Neural Networkscited by 121
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 110
10 more
- 2020Gradient Flow in Sparse Neural Networks and How Lottery Tickets Wincited by 77
- 2015Preconditioned Stochastic Gradient Descentcited by 50
- 2023Dynamic Sparse Training with Structured Sparsitycited by 38
- 2024Mask in the Mirror: Implicit Sparsificationcited by 14
- 2025Mirror, Mirror of the Flow: How Does Regularization Shape Implicit Bias?cited by 12
- 2024Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption Robustnesscited by 11
- 2025Sign-In to the Lottery: Reparameterizing Sparse Training From Scratchcited by 6
- 2023Balance is Essence: Accelerating Sparse Training via Adaptive Gradient Correctioncited by 5
- 2025Dynamic Sparse Training of Diagonally Sparse Networkscited by 4
- 2025Hyperbolic Aware Minimization: Implicit Bias for Sparsitycited by 3
Built on by
Not cited yet.