Nonconvex Rectangular Matrix Completion via Gradient Descent without ℓ_2,∞ Regularization
share
The analysis of nonconvex matrix completion has recently attracted much attention in the community of machine learning thanks to its computational convenience. Existing analysis on this problem, however, usually relies on ℓ_2,∞ projection or regularization that involves unknown model parameters, although they are observed to be unnecessary in numerical simulations, see, e.g. Zheng and Lafferty [2016]. In this paper, we extend the analysis of the vanilla gradient descent for positive semidefinite matrix completion proposed in Ma et al. [2017] to the rectangular case, and more significantly, improve the required sampling complexity from O(r^3) to O(r^2). Our technical ideas and contributions are potentially useful in improving the leave-one-out analysis in other related problems.
READ FULL TEXT
