Stable Anderson Acceleration for Deep Learning
Not on the map. Why?
Abstract (arXiv)
Anderson acceleration (AA) is an extrapolation technique designed to speed-up fixed-point iterations like those arising from the iterative training of DL models. Training DL models requires large datasets processed in randomly sampled batches that tend to introduce in the fixed-point iteration stochastic oscillations of amplitude roughly inversely proportional to the size of the batch. These oscillations reduce and occasionally eliminate the positive effect of AA. To restore AA's advantage, we combine it with an adaptive moving average procedure that smoothes the oscillations and results in a more regular sequence of gradient descent updates. By monitoring the relative standard deviation between consecutive iterations, we also introduce a criterion to automatically assess whether the moving average is needed. We applied the method to the following DL instantiations: (i) multi-layer perceptrons (MLPs) trained on the open-source graduate admissions dataset for regression, (ii) physics informed neural networks (PINNs) trained on source data to solve 2d and 100d Burgers' partial differential equations (PDEs), and (iii) ResNet50 trained on the open-source ImageNet1k dataset for image classification. Numerical results obtained using up to 1,536 NVIDIA V100 GPUs on the OLCF supercomputer Summit showed the stabilizing effect of the moving average on AA for all the problems above.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 13 of its 39 references that are in the map. First posted on arXiv 26 Oct 2021.
Builds on
13 of 39 references.
References · 13
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 213
- 2019On Empirical Comparisons of Optimizers for Deep Learningcited by 99
- 2013Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regressioncited by 32
- 2015From Averaging to Acceleration, There is Only a Step-sizecited by 24
- 2016Regularized Nonlinear Accelerationcited by 18
- 2020Stochastic optimization with momentum: convergence, fluctuations, and traps avoidancecited by 10
- 2018Never look back - A modified EnKF method and its application to the training of neural networks without back propagationcited by 8
- 2019Regularized Anderson Acceleration for Off-Policy Deep Reinforcement Learningcited by 8
- 2019Anderson Acceleration of Proximal Gradient Methodscited by 8
1 more
- 2020Asynchronous Parallel Stochastic Quasi-Newton Methodscited by 2
Built on by
Citing papers per year: 2023: 2.
2 papers.