Stochastic Runge-Kutta methods and adaptive SGD-G2 stochastic gradient descent
Not on the map. Why?
Abstract (arXiv)
The minimization of the loss function is of paramount importance in deep neural networks. On the other hand, many popular optimization algorithms have been shown to correspond to some evolution equation of gradient flow type. Inspired by the numerical schemes used for general evolution equations we introduce a second order stochastic Runge Kutta method and show that it yields a consistent procedure for the minimization of the loss function. In addition it can be coupled, in an adaptive framework, with a Stochastic Gradient Descent (SGD) to adjust automatically the learning rate of the SGD, without the need of any additional information on the Hessian of the loss functional. The adaptive SGD, called SGD-G2, is successfully tested on standard datasets.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 0; 2025: 2.
4 papers.
- 2021The convergence of the Stochastic Gradient Descent (SGD) : a self-contained proofcited by 9
- 2025Unbiased and Sign Compression in Distributed Learning: Comparing Noise Resilience via SDEscited by 4
- 2023Towards Hyperparameter-Agnostic DNN Training via Dynamical System Insightscited by 1
- 2025Learning by solving differential equationscited by 1
- 2025Learning by solving differential equations19 May 2025
- 2025Unbiased and Sign Compression in Distributed Learning: Comparing Noise Resilience via SDEs24 Feb 2025
- 2023Towards Hyperparameter-Agnostic DNN Training via Dynamical System Insights21 Oct 2023
- 2021The convergence of the Stochastic Gradient Descent (SGD) : a self-contained proof26 Mar 2021