SOTAVerified

Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networks

2019-04-30NeurIPS 2019Code Available0· sign in to hype

Gauthier Gidel, Francis Bach, Simon Lacoste-Julien

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

When optimizing over-parameterized models, such as deep neural networks, a large set of parameters can achieve zero training error. In such cases, the choice of the optimization algorithm and its respective hyper-parameters introduces biases that will lead to convergence to specific minimizers of the objective. Consequently, this choice can be considered as an implicit regularization for the training of over-parametrized models. In this work, we push this idea further by studying the discrete gradient dynamics of the training of a two-layer linear network with the least-squares loss. Using a time rescaling, we show that, with a vanishing initialization and a small enough step size, this dynamics sequentially learns the solutions of a reduced-rank regression with a gradually increasing rank.

Reproductions