Matrix Completion has No Spurious Local MinimumResearch Paper
Matrix completion — recovering a low-rank matrix from a small random subset of its entries — powers recommender systems and collaborative filtering. In practice it is solved by running (stochastic) gradient descent on the non-convex objective