Understanding the implicit bias of training algorithms is of crucial importance in order to explain the success of overparametrised neural networks. In this paper, we study the role of the label noise in the training dynamics of a quadratically parametrised model through its continuous time version. We explicitly characterise the solution chosen by the stochastic flow and prove that it implicitly solves a Lasso program. To fully complete our analysis, we provide nonasymptotic convergence guarantees for the dynamics as well as conditions for support recovery. We also give experimental results which support our theoretical claims. Our findings highlight the fact that structured noise can induce better generalisation and help explain the greater performances of stochastic dynamics as observed in practice.
@article{arxiv.2206.09841,
title = {Label noise (stochastic) gradient descent implicitly solves the Lasso for quadratic parametrisation},
author = {Loucas Pillaud-Vivien and Julien Reygner and Nicolas Flammarion},
journal= {arXiv preprint arXiv:2206.09841},
year = {2022}
}