mlsanityData to 7 Oct 2026

Towards Stability of Parameter-Free Optimization

arXiv 2405.04376 ↗First posted 7 May 2024cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Hyperparameter tuning, particularly the selection of an appropriate learning rate in adaptive gradient training methods, remains a challenge. To address this challenge, we propose a novel parameter-free optimizer, textscAdamG (Adam with the Golden step size), designed to automatically adapt to diverse optimization problems without task-specific learning-rate tuning. The core technique underlying textscAdamG is our golden step size derived for the AdaGrad-Norm algorithm, which is expected to help AdaGrad-Norm preserve tuning-free convergence and approximate the optimal step size in expectation across diverse optimization scenarios. To better evaluate tuning-free performance, we propose a novel evaluation criterion, textitreliability, to comprehensively assess the efficacy of parameter-free optimizers in addition to classical performance criteria. Empirical results demonstrate that textscAdamG outperforms other parameter-free baselines and consistently performs on par with Adam using a manually tuned learning rate across various optimization tasks.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 31 of its 47 references that are in the map. First posted on arXiv 7 May 2024.

Builds on

31 of 47 references.

References · 31

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  5. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  6. 2016Densely Connected Convolutional Networkscited by 6,691
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  8. 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,829
  9. 2023Symbolic Discovery of Optimization Algorithmscited by 423
  10. 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 282
  11. 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 260
  12. 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 248
19 more
  1. 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
  2. 2018AdaGrad stepsizes: Sharp convergence over nonconvex landscapescited by 182
  3. 2020Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergencecited by 137
  4. 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 136
  5. 2016Coin Betting and Parameter-Free Online Learningcited by 131
  6. 2023Prodigy: An Expeditiously Adaptive Parameter-Free Learnercited by 129
  7. 2023Learning-Rate-Free Learning by D-Adaptationcited by 113
  8. 2023Convergence of Adam Under Relaxed Assumptionscited by 97
  9. 2023DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedulecited by 85
  10. 2019Adaptive Gradient Descent without Descentcited by 79
  11. 2023Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptionscited by 55
  12. 2022Making SGD Parameter-Freecited by 50
  13. 2023Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGDcited by 41
  14. 2017Online to Offline Conversions, Universality and Adaptive Minibatch Sizescited by 39
  15. 2023DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Methodcited by 35
  16. 2023Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methodscited by 23
  17. 2020Better Parameter-free Stochastic Optimization with ODE Updates for Coin-Bettingcited by 19
  18. 2023Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradientcited by 19
  19. 2017Convergence Rates for Deterministic and Stochastic Subgradient Methods Without Lipschitz Continuitycited by 18

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.