Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence

Diyuan Wu, Vyacheslav Kungurtsev, Marco Mondelli

Keywords: neural networks, stochastic heavy ball method, mean-field, global convergence, connectivity, dropout-stability

TL;DR: We consider training two-layer and three-layer neural networks with the stochastic heavy ball method and, by taking a mean-field view, we show global convergence, as well as the dropout-stability and connectivity of the solutions.

Abstract:

The stochastic heavy ball method (SHB), also known as stochastic gradient descent (SGD) with Polyak's momentum, is widely used in training neural networks. However, despite the remarkable success of such algorithm in practice, its theoretical characterization remains limited. In this paper, we focus on neural networks with two and three layers and provide a rigorous understanding of the properties of the solutions found by SHB: \emph{(i)} stability after dropping out part of the neurons, \emph{(ii)} connectivity along a low-loss path, and \emph{(iii)} convergence to the global optimum.
To achieve this goal, we take a mean-field view and relate the SHB dynamics to a certain partial differential equation in the limit of large network widths. This mean-field perspective has inspired a recent line of work focusing on SGD while, in contrast, our paper considers an algorithm with momentum. More specifically, after proving existence and uniqueness of the limit differential equations, we show convergence to the global optimum and give a quantitative bound between the mean-field limit and the SHB dynamics of a finite-width network. Armed with this last bound, we are able to establish the dropout-stability and connectivity of SHB solutions.