AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent

Nikola Surjanovic, Alexandre Bouchard-Côté, Trevor Campbell
5/27/2025
cs.LGmath.OCstat.CO

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

The learning rate is an important tuning parameter for stochastic gradient descent (SGD) and can greatly influence its performance. However, appropriate selection of a learning rate schedule across all iterations typically requires a non-trivial amount of user tuning effort. To address this, we introduce AutoSGD: an SGD method that automatically determines whether to increase or decrease the learning rate at a given iteration and then takes appropriate action. We introduce theory supporting the convergence of AutoSGD, along with its deterministic counterpart for standard gradient descent. Empirical results suggest strong performance of the method on a variety of traditional optimization problems and machine learning tasks.

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. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

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

Cite this paper

@article{surjanovic2025autosgd,
  title  = {AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent},
  author = {Nikola Surjanovic and Alexandre Bouchard-Côté and Trevor Campbell},
  year   = {2025},
  eprint = {2505.21651},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.21651v1}
}

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

Discussion