Using Statistics to Automate Stochastic Optimization
Not on the map. Why?
Abstract (arXiv)
Despite the development of numerous adaptive optimizers, tuning the learning rate of stochastic gradient methods remains a major roadblock to obtaining good practical performance in machine learning. Rather than changing the learning rate at each iteration, we propose an approach that automates the most common hand-tuning heuristic: use a constant learning rate until "progress stops," then drop. We design an explicit statistical test that determines when the dynamics of stochastic gradient descent reach a stationary distribution. This test can be performed easily during training, and when it fires, we decrease the learning rate by a constant multiplicative factor. Our experiments on several deep learning tasks demonstrate that this statistical adaptive stochastic approximation (SASA) method can automatically find good learning rate schedules and match the performance of hand-tuned methods using default settings of its parameters. The statistical testing helps to control the variance of this procedure and improves its robustness.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 2; 2023: 3; 2024: 1; 2025: 2.
12 papers.
- 2023Optimal Linear Decay Learning Rate Schedules and Further Refinementscited by 41
- 2021On the Convergence of Step Decay Step-Size for Stochastic Optimizationcited by 21
- 2021SVRG Meets AdaGrad: Painless Variance Reductioncited by 13
- 2021Stochastic Optimization under Distributional Driftcited by 13
- 2022Optimization Planning for 3D ConvNetscited by 5
- 2022Network Gradient Descent Algorithm for Decentralized Federated Learningcited by 5
- 2023High Probability Guarantees for Random Reshufflingcited by 5
- 2021Bandwidth-based Step-Sizes for Non-Convex Stochastic Optimizationcited by 2
- 2025AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descentcited by 1
- 2023Multi-task neural networks by learned contextual inputscited by 0
- 2024Coupling-based Convergence Diagnostic and Stepsize Scheme for Stochastic Gradient Descentcited by 0
- 2025Adaptive Decentralized Federated Learning for Robust Optimizationcited by 0
- 2025Adaptive Decentralized Federated Learning for Robust Optimization2 Dec 2025
- 2025AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent27 May 2025
- 2024Coupling-based Convergence Diagnostic and Stepsize Scheme for Stochastic Gradient Descent15 Dec 2024
- 2023High Probability Guarantees for Random Reshuffling20 Nov 2023
- 2023Optimal Linear Decay Learning Rate Schedules and Further Refinements11 Oct 2023
- 2023Multi-task neural networks by learned contextual inputs1 Mar 2023
- 2022Network Gradient Descent Algorithm for Decentralized Federated Learning6 May 2022
- 2022Optimization Planning for 3D ConvNets11 Jan 2022
- 2021Stochastic Optimization under Distributional Drift16 Aug 2021
- 2021Bandwidth-based Step-Sizes for Non-Convex Stochastic Optimization5 Jun 2021
- 2021SVRG Meets AdaGrad: Painless Variance Reduction18 Feb 2021
- 2021On the Convergence of Step Decay Step-Size for Stochastic Optimization18 Feb 2021