mlsanityData to 7 Oct 2026

AdaL: Adaptive Gradient Transformation Contributes to Convergences and Generalizations

arXiv 2107.01525 ↗First posted 4 Jul 2021cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Adaptive optimization methods have been widely used in deep learning. They scale the learning rates adaptively according to the past gradient, which has been shown to be effective to accelerate the convergence. However, they suffer from poor generalization performance compared with SGD. Recent studies point that smoothing exponential gradient noise leads to generalization degeneration phenomenon. Inspired by this, we propose AdaL, with a transformation on the original gradient. AdaL accelerates the convergence by amplifying the gradient in the early stage, as well as dampens the oscillation and stabilizes the optimization by shrinking the gradient later. Such modification alleviates the smoothness of gradient noise, which produces better generalization performance. We have theoretically proved the convergence of AdaL and demonstrated its effectiveness on several benchmarks.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 30 references that are in the map. First posted on arXiv 4 Jul 2021.

Builds on

19 of 30 references.

References · 19

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2016Densely Connected Convolutional Networkscited by 6,691
  5. 2019On the Convergence of Adam and Beyondcited by 834
  6. 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 763
  7. 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
  8. 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 282
  9. 2014The Loss Surfaces of Multilayer Networkscited by 278
  10. 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 213
  11. 2020Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learningcited by 125
  12. 2018An Alternative View: When Does SGD Escape Local Minima?cited by 115
7 more
  1. 2019Asymmetric Valleys: Beyond Sharp and Flat Local Minimacited by 90
  2. 2017Towards Understanding Generalization of Deep Learning: Perspective of Loss Landscapescited by 84
  3. 2017Artificial Intelligence and Statisticscited by 43
  4. 2020A new regret analysis for Adam-type algorithmscited by 35
  5. 2018Nostalgic Adam: Weighting more of the past gradients when designing the adaptive learning ratecited by 16
  6. 2020A Diffusion Theory For Deep Learning Dynamics: Stochastic Gradient Descent Exponentially Favors Flat Minimacited by 11
  7. 2020AdaX: Adaptive Gradient Descent with Exponential Long Term Memorycited by 10

Built on by

Not cited yet.