English

The Implicit Regularization of Stochastic Gradient Flow for Least Squares

Machine Learning 2020-06-23 v2 Machine Learning Optimization and Control

Abstract

We study the implicit regularization of mini-batch stochastic gradient descent, when applied to the fundamental problem of least squares regression. We leverage a continuous-time stochastic differential equation having the same moments as stochastic gradient descent, which we call stochastic gradient flow. We give a bound on the excess risk of stochastic gradient flow at time tt, over ridge regression with tuning parameter λ=1/t\lambda = 1/t. The bound may be computed from explicit constants (e.g., the mini-batch size, step size, number of iterations), revealing precisely how these quantities drive the excess risk. Numerical examples show the bound can be small, indicating a tight relationship between the two estimators. We give a similar result relating the coefficients of stochastic gradient flow and ridge. These results hold under no conditions on the data matrix XX, and across the entire optimization path (not just at convergence).

Keywords

Cite

@article{arxiv.2003.07802,
  title  = {The Implicit Regularization of Stochastic Gradient Flow for Least Squares},
  author = {Alnur Ali and Edgar Dobriban and Ryan J. Tibshirani},
  journal= {arXiv preprint arXiv:2003.07802},
  year   = {2020}
}

Comments

ICML 2020

R2 v1 2026-06-23T14:17:38.091Z