Understanding Short-Range Memory Effects in Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
Stochastic gradient descent (SGD) is of fundamental importance in deep learning. Despite its simplicity, elucidating its efficacy remains challenging. Conventionally, the success of SGD is ascribed to the stochastic gradient noise (SGN) incurred in the training process. Based on this consensus, SGD is frequently treated and analyzed as the Euler-Maruyama discretization of stochastic differential equations (SDEs) driven by either Brownian or Levy stable motion. In this study, we argue that SGN is neither Gaussian nor Levy stable. Instead, inspired by the short-range correlation emerging in the SGN series, we propose that SGD can be viewed as a discretization of an SDE driven by fractional Brownian motion (FBM). Accordingly, the different convergence behavior of SGD dynamics is well-grounded. Moreover, the first passage time of an SDE driven by FBM is approximately derived. The result suggests a lower escaping rate for a larger Hurst parameter, and thus SGD stays longer in flat minima. This happens to coincide with the well-known phenomenon that SGD favors flat minima that generalize well. Extensive experiments are conducted to validate our conjecture, and it is demonstrated that short-range memory effects persist across various model architectures, datasets, and training strategies. Our study opens up a new perspective and may contribute to a better understanding of SGD.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 73 references that are in the map. First posted on arXiv 5 May 2021.
Builds on
27 of 73 references.
References · 27
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2019Fantastic Generalization Measures and Where to Find Themcited by 507
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 494
- 2017Sharp Minima Can Generalize For Deep Netscited by 462
15 more
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 313
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
- 2017Train longer, generalize better: closing the generalization gap in large batch training of neural networkscited by 278
- 2017Three Factors Influencing Minima in SGDcited by 270
- 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 213
- 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 141
- 2017Stochastic gradient descent performs variational inference, converges to limit cycles for deep networkscited by 108
- 2018Hessian-based Analysis of Large Batch Training and Robustness to Adversariescited by 87
- 2020In Search of Robust Measures of Generalizationcited by 79
- 2015Preconditioned Stochastic Gradient Descentcited by 48
- 2019First Exit Time Analysis of Stochastic Gradient Descent Under Heavy-Tailed Gradient Noisecited by 43
- 2019diffGrad: An Optimization Method for Convolutional Neural Networkscited by 29
- 2019Non-Gaussianity of Stochastic Gradient Noisecited by 22
- 2019Accelerating Minibatch Stochastic Gradient Descent using Typicality Samplingcited by 11
Built on by
Citing papers per year: 2022: 1.
1 paper.