Daesung Kim

Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization

The nonconvex formulation of the matrix completion problem has received significant attention in recent years due to its affordable complexity compared to the convex formulation. Gradient Descent (GD) is a simple yet efficient baseline algorithm for solving nonconvex optimization problems. The succe…