Large Learning Rates Improve Generalization: But How Large Are We Talking About?

Ekaterina Lobacheva, Eduard Pockonechnyy, Maxim Kodryan, Dmitry Vetrov
11/19/2023
cs.LGstat.ML

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

Inspired by recent research that recommends starting neural networks training with large learning rates (LRs) to achieve the best generalization, we explore this hypothesis in detail. Our study clarifies the initial LR ranges that provide optimal results for subsequent training with a small LR or weight averaging. We find that these ranges are in fact significantly narrower than generally assumed. We conduct our main experiments in a simplified setup that allows precise control of the learning rate hyperparameter and validate our key findings in a more practical setting.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lobacheva2023large,
  title  = {Large Learning Rates Improve Generalization: But How Large Are We Talking About?},
  author = {Ekaterina Lobacheva and Eduard Pockonechnyy and Maxim Kodryan and Dmitry Vetrov},
  year   = {2023},
  eprint = {2311.11303},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.11303v1}
}

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/2311.11303.svg)](https://codeofpaper.com/paper/2311.11303)

Discussion