LGNAMLFeb 20, 2020

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

arXiv:2002.09304v110 citations
AI Analysis

This work addresses optimization challenges in deep learning by providing a novel adaptive method, though it appears incremental as it builds on existing gradient flow and SGD frameworks.

The paper tackled the problem of loss function minimization in deep neural networks by introducing a second-order stochastic Runge-Kutta method and an adaptive SGD variant called SGD-G2, which automatically adjusts learning rates without Hessian information, and it was successfully tested on standard datasets.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes