Learning-Rate-Free Learning by D-Adaptation

Aaron Defazio, Konstantin Mishchenko
2/12/2026

No official code found. Best implementation: facebookresearch/dadaptation (529 stars, MIT, last commit 2025-01-22).

Abstract

D-Adaptation is an approach to automatically setting the learning rate which asymptotically achieves the optimal rate of convergence for minimizing convex Lipschitz functions, with no back-tracking or line searches, and no additional function value or gradient evaluations per step. Our approach is the first hyper-parameter free method for this class without additional multiplicative log factors in the convergence rate. We present extensive experiments for SGD and Adam variants of our method, where the method automatically matches hand-tuned learning rates across more than a dozen diverse machine learning problems, including large-scale vision and language problems. An open-source implementation is available.

View on arXivView PDF

Code Implementations(1)

MIT

D-Adaptation for SGD, Adam and AdaGrad

52924PythonNov 9, 20221 years agoMIT

Similar Papers

Cite this paper

@article{defazio2026learningratefree,
  title  = {Learning-Rate-Free Learning by D-Adaptation},
  author = {Aaron Defazio and Konstantin Mishchenko},
  year   = {2026},
  eprint = {2301.07733},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2301.07733},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.07733.svg)](https://codeofpaper.com/paper/2301.07733)

Discussion