English

Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror Descent

Machine Learning 2022-07-11 v1 Optimization and Control

Abstract

As part of the effort to understand implicit bias of gradient descent in overparametrized models, several results have shown how the training trajectory on the overparametrized model can be understood as mirror descent on a different objective. The main result here is a characterization of this phenomenon under a notion termed commuting parametrization, which encompasses all the previous results in this setting. It is shown that gradient flow with any commuting parametrization is equivalent to continuous mirror descent with a related Legendre function. Conversely, continuous mirror descent with any Legendre function can be viewed as gradient flow with a related commuting parametrization. The latter result relies upon Nash's embedding theorem.

Keywords

Cite

@article{arxiv.2207.04036,
  title  = {Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror Descent},
  author = {Zhiyuan Li and Tianhao Wang and JasonD. Lee and Sanjeev Arora},
  journal= {arXiv preprint arXiv:2207.04036},
  year   = {2022}
}

Comments

37 pages