We study implicit regularization when optimizing an underdetermined quadratic objective over a matrix $X$ with gradient descent on a factorization of X. We conjecture and provide empirical and theoretical evidence that with small enough step sizes and initialization close enough to the origin, gradient descent on a full dimensional factorization converges to the minimum nuclear norm solution.
Implicit Regularization in Matrix Factorization
Suriya Gunasekar,Blake E. Woodworth,Srinadh Bhojanapalli,Behnam Neyshabur,N. Srebro
Published 2017 in Information Theory and Applications Workshop
ABSTRACT
PUBLICATION RECORD
- Publication year
2017
- Venue
Information Theory and Applications Workshop
- Publication date
2017-05-25
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-18 of 18 references · Page 1 of 1