Learning to Optimize Quasi-Newton Methods
Not on the map. Why?
Abstract (arXiv)
Fast gradient-based optimization algorithms have become increasingly essential for the computationally efficient training of machine learning models. One technique is to multiply the gradient by a preconditioner matrix to produce a step, but it is unclear what the best preconditioner matrix is. This paper introduces a novel machine learning optimizer called LODO, which tries to online meta-learn the best preconditioner during optimization. Specifically, our optimizer merges Learning to Optimize (L2O) techniques with quasi-Newton methods to learn preconditioners parameterized as neural networks; they are more flexible than preconditioners in other quasi-Newton methods. Unlike other L2O methods, LODO does not require any meta-training on a training task distribution, and instead learns to optimize on the fly while optimizing on the test task, adapting to the local characteristics of the loss landscape while traversing it. Theoretically, we show that our optimizer approximates the inverse Hessian in noisy loss landscapes and is capable of representing a wide range of inverse Hessians. We experimentally verify that our algorithm can optimize in noisy settings, and show that simpler alternatives for representing the inverse Hessians worsen performance. Lastly, we use our optimizer to train a semi-realistic deep neural network with 95k parameters at speeds comparable to those of standard neural network optimizers.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 28 of its 43 references that are in the map. First posted on arXiv 11 Oct 2022.
Builds on
28 of 43 references.
References · 28
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Conditional Image Generation with PixelCNN Decoderscited by 859
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
- 2016Learning to learn by gradient descent by gradient descentcited by 616
- 2017Self-Normalizing Neural Networkscited by 591
- 2017Large Batch Training of Convolutional Networkscited by 529
- 2018An Intriguing Failing of Convolutional Neural Networks and the CoordConv Solutioncited by 302
- 2021Learning to Optimize: A Primer and A Benchmarkcited by 206
- 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 201
- 2016Learning to Optimizecited by 195
- 2018Fast Approximate Natural Gradient Descent in a Kronecker-factored Eigenbasiscited by 143
16 more
- 2017Non-convex Optimization for Machine Learningcited by 132
- 2017Online Learning Rate Adaptation with Hypergradient Descentcited by 117
- 2018Understanding and correcting pathologies in the training of learned optimizerscited by 97
- 2019A Survey of Optimization Methods from a Machine Learning Perspectivecited by 90
- 2019Meta-Curvaturecited by 70
- 2020Practical Quasi-Newton Methods for Training Deep Neural Networkscited by 67
- 2017Deep linear neural networks with arbitrary loss: All local minima are globalcited by 64
- 2016Tunable Efficient Unitary Neural Networks (EUNN) and their application to RNNscited by 62
- 2020Tasks, stability, architecture, and compute: Training more effective learned optimizers, and using them to train themselvescited by 57
- 2017Learning Gradient Descent: Better Generalization and Longer Horizonscited by 50
- 2020On the distance between two neural networks and the stability of learningcited by 46
- 2017Learning to Optimize Neural Netscited by 41
- 2020Ridge Rider: Finding Diverse Solutions by Following Eigenvectors of the Hessiancited by 20
- 2022Amortized Proximal Optimizationcited by 9
- 2019First-Order Preconditioning via Hypergradient Descentcited by 8
- 2022Step-size Adaptation Using Exponentiated Gradient Updatescited by 7
Built on by
Citing papers per year: 2024: 2; 2025: 1.
3 papers.