mlsanityData to 7 Oct 2026

Gradient-based Weight Density Balancing for Robust Dynamic Sparse Training

arXiv 2210.14012 ↗First posted 25 Oct 2022cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Training a sparse neural network from scratch requires optimizing connections at the same time as the weights themselves. Typically, the weights are redistributed after a predefined number of weight updates, removing a fraction of the parameters of each layer and inserting them at different locations in the same layers. The density of each layer is determined using heuristics, often purely based on the size of the parameter tensor. While the connections per layer are optimized multiple times during training, the density of each layer remains constant. This leaves great unrealized potential, especially in scenarios with a high sparsity of 90% and more. We propose Global Gradient-based Redistribution, a technique which distributes weights across all layers - adding more weights to the layers that need them most. Our evaluation shows that our approach is less prone to unbalanced weight distribution at initialization than previous work and that it is able to find better performing sparse subnetworks at very high sparsity levels.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 29 references that are in the map. First posted on arXiv 25 Oct 2022.

Builds on

22 of 29 references.

References · 22

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  4. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  5. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
  6. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  7. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  9. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  10. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  11. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  12. 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 291
10 more
  1. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
  2. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
  3. 2017Deep Rewiring: Training very sparse deep networkscited by 136
  4. 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 83
  5. 2020EarlyBERT: Efficient BERT Training via Early-bird Lottery Ticketscited by 79
  6. 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 75
  7. 2019Sparse evolutionary Deep Learning with over one million artificial neurons on commodity hardwarecited by 48
  8. 2021Efficient Lottery Ticket Finding: Less Data is Morecited by 44
  9. 2020SparseRT: Accelerating Unstructured Sparsity on GPUs for Deep Learning Inferencecited by 30
  10. 2021Efficient Neural Network Training via Forward and Backward Propagation Sparsificationcited by 30

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.