The Power of Convex Relaxation: Near-Optimal Matrix Completion
The Power of Convex Relaxation: Near-Optimal Matrix Completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">matrix completion</i> problem, and comes up in a great number of applications, including the famous <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Netflix Prize</i> and other similar questions in …