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