Implicit Regularization Makes Overparameterized Asymmetric Matrix Sensing Robust to Perturbations
Johan S. Wind

TL;DR
This paper demonstrates that implicit regularization in overparameterized models, specifically in matrix sensing, makes solutions robust to perturbations and noise, improving understanding of generalization and efficiency of gradient-based methods.
Contribution
It introduces a perturbed gradient flow framework that captures noise effects, providing sharper complexity bounds and robustness analysis for matrix sensing with small initializations.
Findings
Perturbed gradient flow simplifies analysis and improves sample complexity.
Factorized gradient descent is robust to measurement noise and perturbations.
Mini-batch stochastic gradient descent further reduces sample complexity.
Abstract
Several key questions remain unanswered regarding overparameterized learning models. It is unclear how (stochastic) gradient descent finds solutions that generalize well, and in particular the role of small random initializations. Matrix sensing, which is the problem of reconstructing a low-rank matrix from a few linear measurements, has become a standard prototypical setting to study these phenomena. Previous works have shown that matrix sensing can be solved by factorized gradient descent, provided the random initialization is extremely small. In this paper, we find that factorized gradient descent is highly robust to certain perturbations. This lets us use a perturbation term to capture both the effects of imperfect measurements, discretization by gradient descent, and other noise, resulting in a general formulation which we call \textit{perturbed gradient flow}. We find that not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Stochastic Gradient Optimization Techniques · Numerical methods in inverse problems
