The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing

02/02/2023
by   Xingyu Xu, et al.
0

We propose , a preconditioned gradient descent method to tackle the low-rank matrix sensing problem when the true rank is unknown, and when the matrix is possibly ill-conditioned. Using overparametrized factor representations, starts from a small random initialization, and proceeds by gradient descent with a specific form of damped preconditioning to combat bad curvatures induced by overparameterization and ill-conditioning. At the expense of light computational overhead incurred by preconditioners, is remarkably robust to ill-conditioning compared to vanilla gradient descent () even with overprameterization. Specifically, we show that, under the Gaussian design, converges to the true low-rank matrix at a constant linear rate after a small number of iterations that scales only logarithmically with respect to the condition number and the problem dimension. This significantly improves over the convergence rate of vanilla which suffers from a polynomial dependency on the condition number. Our work provides evidence on the power of preconditioning in accelerating the convergence without hurting generalization in overparameterized learning.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset