Implicit regularization and solution uniqueness in over-parameterized matrix sensing
arXiv:1806.02046
Abstract
We consider whether algorithmic choices in over-parameterized linear matrix factorization introduce implicit regularization. We focus on noiseless matrix sensing over rank- positive semi-definite (PSD) matrices in , with a sensing mechanism that satisfies restricted isometry properties (RIP). The algorithm we study is \emph{factored gradient descent}, where we model the low-rankness and PSD constraints with the factorization , for . Surprisingly, recent work argues that the choice of is not pivotal: even setting is sufficient for factored gradient descent to find the rank- solution, which suggests that operating over the factors leads to an implicit regularization. In this contribution, we provide a different perspective to the problem of implicit regularization. We show that under certain conditions, the PSD constraint by itself is sufficient to lead to a unique rank- matrix recovery, without implicit or explicit low-rank regularization. \emph{I.e.}, under assumptions, the set of PSD matrices, that are consistent with the observed data, is a singleton, regardless of the algorithm used.
12 pages
References in corpus (9)
- Characterizing Implicit Bias in Terms of Optimization Geometry
- On the Power of Over-parametrization in Neural Networks with Quadratic Activation
- Spurious Local Minima are Common in Two-Layer ReLU Neural Networks
- When is a Convolutional Filter Easy To Learn?
- Theory of Deep Learning III: explaining the non-overfitting puzzle
- The loss landscape of overparameterized neural networks
- Theoretical properties of the global optimizer of two layer neural network
- IHT dies hard: Provable accelerated Iterative Hard Thresholding
- Provable quantum state tomography via non-convex methods