Studying K-FAC Heuristics by Viewing Adam through a Second-Order Lens
Not on the map. Why?
Abstract (arXiv)
Research into optimisation for deep learning is characterised by a tension between the computational efficiency of first-order, gradient-based methods (such as SGD and Adam) and the theoretical efficiency of second-order, curvature-based methods (such as quasi-Newton methods and K-FAC). Noting that second-order methods often only function effectively with the addition of stabilising heuristics (such as Levenberg-Marquardt damping), we ask how much these (as opposed to the second-order curvature model) contribute to second-order algorithms' performance. We thus study AdamQLR: an optimiser combining damping and learning rate selection techniques from K-FAC (Martens & Grosse, 2015) with the update directions proposed by Adam, inspired by considering Adam through a second-order lens. We evaluate AdamQLR on a range of regression and classification tasks at various scales and hyperparameter tuning methodologies, concluding K-FAC's adaptive heuristics are of variable standalone general effectiveness, and finding an untuned AdamQLR setting can achieve comparable performance vs runtime to tuned benchmarks.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 29 of its 77 references that are in the map. First posted on arXiv 23 Oct 2023.
Builds on
29 of 77 references.
References · 29
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 320
- 2019Optimizing Millions of Hyperparameters by Implicit Differentiationcited by 304
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
- 2017Forward and Reverse Gradient-Based Hyperparameter Optimizationcited by 234
- 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
- 2018A System for Massively Parallel Hyperparameter Tuningcited by 202
- 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 202
17 more
- 2013Revisiting Natural Gradient for Deep Networkscited by 159
- 2018Fast Approximate Natural Gradient Descent in a Kronecker-factored Eigenbasiscited by 146
- 2017Practical Gauss-Newton Optimisation for Deep Learningcited by 142
- 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 139
- 2019An Exponential Learning Rate Schedule for Deep Learningcited by 121
- 2017Online Learning Rate Adaptation with Hypergradient Descentcited by 118
- 2019Which Algorithmic Choices Matter at Which Batch Sizes? Insights From a Noisy Quadratic Modelcited by 117
- 2017Noisy Natural Gradient as Variational Inferencecited by 94
- 2020Practical Quasi-Newton Methods for Training Deep Neural Networkscited by 68
- 2018Large-Scale Distributed Second-Order Optimization Using Kronecker-Factored Approximate Curvature for Deep Convolutional Neural Networkscited by 37
- 2019Learning an Adaptive Learning Rate Schedulecited by 29
- 2021Tensor Normal Training for Deep Learning Modelscited by 24
- 2021AutoLRS: Automatic Learning-Rate Schedule by Bayesian Optimization on the Flycited by 14
- 2023Automatic Gradient Descent: Deep Learning without Hyperparameterscited by 14
- 2022A Mini-Block Fisher Method for Deep Neural Networkscited by 8
- 2021Scalable One-Pass Optimisation of High-Dimensional Weight-Update Hyperparameters by Implicit Differentiationcited by 7
- 2023mL-BFGS: A Momentum-based L-BFGS for Distributed Large-Scale Neural Network Optimizationcited by 4
Built on by
Citing papers per year: 2024: 2.
2 papers.