mlsanityData to 7 Oct 2026

Balance is Essence: Accelerating Sparse Training via Adaptive Gradient Correction

arXiv 2301.03573 ↗First posted 9 Jan 2023cs.LG cs.AI cs.CVcited by 5

Not on the map. Why?

Abstract (arXiv)

Despite impressive performance, deep neural networks require significant memory and computation costs, prohibiting their application in resource-constrained scenarios. Sparse training is one of the most common techniques to reduce these costs, however, the sparsity constraints add difficulty to the optimization, resulting in an increase in training time and instability. In this work, we aim to overcome this problem and achieve space-time co-efficiency. To accelerate and stabilize the convergence of sparse training, we analyze the gradient changes and develop an adaptive gradient correction method. Specifically, we approximate the correlation between the current and previous gradients, which is used to balance the two gradients to obtain a corrected gradient. Our method can be used with the most popular sparse training pipelines under both standard and adversarial setups. Theoretically, we prove that our method can accelerate the convergence rate of sparse training. Extensive experiments on multiple datasets, model architectures, and sparsities demonstrate that our method outperforms leading sparse training methods by up to 5.0% in accuracy given the same number of training epochs, and reduces the number of training epochs by up to 52.1% to achieve the same accuracy. Our code is available on: urlhttps://github.com/StevenBoys/AGENT.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 56 of its 84 references that are in the map. First posted on arXiv 9 Jan 2023.

Builds on

56 of 84 references.

References · 56

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  4. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  5. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  6. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  7. 2016Wide Residual Networkscited by 3,057
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  9. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
  10. 2016An overview of gradient descent optimization algorithmscited by 1,021
  11. 2021Carbon Emissions and Large Neural Network Trainingcited by 561
  12. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
38 more
  1. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  2. 2018Threat of Adversarial Attacks on Deep Learning in Computer Vision: A Surveycited by 459
  3. 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 401
  4. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  5. 2019Momentum-Based Variance Reduction in Non-Convex SGDcited by 302
  6. 2018SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimatorcited by 283
  7. 2017SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradientcited by 218
  8. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
  9. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
  10. 2016Stochastic Variance Reduction for Nonconvex Optimizationcited by 143
  11. 2017Deep Rewiring: Training very sparse deep networkscited by 136
  12. 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 107
  13. 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
  14. 2019Adversarial Robustness vs Model Compression, or Both?cited by 98
  15. 2019A Unified Theory of SGD: Variance Reduction, Sampling, Quantization and Coordinate Descentcited by 84
  16. 2020Variance-Reduced Methods for Machine Learningcited by 79
  17. 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
  18. 2014A Proximal Stochastic Gradient Method with Progressive Variance Reductioncited by 78
  19. 2020Gradient Flow in Sparse Neural Networks and How Lottery Tickets Wincited by 77
  20. 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 75
  21. 2016Variance Reduction for Faster Non-Convex Optimizationcited by 72
  22. 2022Accelerating Dataset Distillation via Model Augmentationcited by 62
  23. 2022The State of Sparse Training in Deep Reinforcement Learningcited by 60
  24. 2019The Generalization-Stability Tradeoff In Neural Network Pruningcited by 54
  25. 2021Powerpropagation: A sparsity inducing weight reparameterisationcited by 49
  26. 2021Effective Sparsification of Neural Networks with Global Sparsity Constraintcited by 45
  27. 2019Accurate, reliable and fast robustness evaluationcited by 43
  28. 2020A Tunable Robust Pruning Framework Through Dynamic Network Rewiring of DNNscited by 37
  29. 2021Implicit Sparse Regularization: The Impact of Depth and Early Stoppingcited by 30
  30. 2021Efficient Neural Network Training via Forward and Backward Propagation Sparsificationcited by 30
  31. 2021Accelerating Framework of Transformer by Hardware Design and Model Compression Co-Optimizationcited by 27
  32. 2017Control Variates for Stochastic Gradient MCMCcited by 25
  33. 2021More is Less: Inducing Sparsity via Overparameterizationcited by 22
  34. 2018On the Theory of Variance Reduction for Stochastic Gradient Monte Carlocited by 19
  35. 2022Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networkscited by 18
  36. 2022Dynamic Sparse Training via Balancing the Exploration-Exploitation Trade-offcited by 15
  37. 2022Optimization with Access to Auxiliary Informationcited by 12
  38. 2020Accelerating Convergence of Replica Exchange Stochastic Gradient MCMC via Variance Reductioncited by 10

50 most cited of 56 All 56 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 2; 2025: 0; 2026: 1.

5 papers.