mlsanityData to 7 Oct 2026

Stochastic Runge-Kutta methods and adaptive SGD-G2 stochastic gradient descent

arXiv 2002.09304 ↗First posted 20 Feb 2020cs.LG cs.NA math.NAcited by 4

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

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 0; 2025: 2.

4 papers.