AutoGD: Automatic Learning Rate Selection for Gradient Descent
Not on the map. Why?
Abstract (arXiv)
The performance of gradient-based optimization methods, such as standard gradient descent (GD), greatly depends on the choice of learning rate. However, it can require a non-trivial amount of user tuning effort to select an appropriate learning rate schedule. When such methods appear as inner loops of other algorithms, expecting the user to tune the learning rates may be impractical. To address this, we introduce AutoGD: a gradient descent method that automatically determines whether to increase or decrease the learning rate at a given iteration. We establish the convergence of AutoGD, and show that we can recover the optimal rate of GD (up to a constant) for a broad class of functions without knowledge of smoothness constants. Experiments on a variety of traditional problems and variational inference optimization tasks demonstrate strong performance of the method, along with its extensions to AutoBFGS and AutoLBFGS.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 37 references that are in the map. First posted on arXiv 10 Oct 2025.
Builds on
17 of 37 references.
References · 17
- 2020Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergencecited by 137
- 2023Prodigy: An Expeditiously Adaptive Parameter-Free Learnercited by 133
- 2023Learning-Rate-Free Learning by D-Adaptationcited by 113
- 2019Adaptive Gradient Descent without Descentcited by 79
- 2022Dynamics of SGD with Stochastic Polyak Stepsizes: Truly Adaptive Variants and Convergence to Exact Solutioncited by 40
- 2023DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Methodcited by 35
- 2016Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regionscited by 34
- 2023Adaptive Proximal Gradient Method for Convex Optimizationcited by 21
- 2023Black Box Variational Inference with a Deterministic Objective: Faster, More Accurate, and Even More Black Boxcited by 17
- 2024Accelerated Parameter-Free Stochastic Optimizationcited by 15
- 2024How Free is Parameter-Free Stochastic Optimization?cited by 12
- 2016On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functionscited by 9
5 more
- 2024AdaBB: Adaptive Barzilai-Borwein Method for Convex Optimizationcited by 8
- 2020Complexity Guarantees for Polyak Steps with Momentumcited by 7
- 2023Sample Average Approximation for Black-Box VIcited by 6
- 2024A review of Monte Carlo-based versions of the EM algorithmcited by 4
- 2025AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descentcited by 2
Built on by
Not cited yet.