The Power of Convex Relaxation: Near-Optimal Matrix Completion

Details The Power of Convex Relaxation: Near-Optimal Matrix Completion The Power of Convex Relaxation: Near-Optimal Matrix Completion

2009-03-09

arxiv.org/abs/0903.1476v1

Computer Science

Information Theory

51 pages, 12 figures

Scientific paper

This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a great number of applications, including the famous Netflix Prize and other similar questions in collaborative filtering. In general, accurate recovery of a matrix from a small number of entries is impossible; but the knowledge that the unknown matrix has low rank radically changes this premise, making the search for solutions meaningful. This paper presents optimality results quantifying the minimum number of entries needed to recover a matrix of rank r exactly by any method whatsoever (the information theoretic limit). More importantly, the paper shows that, under certain incoherence assumptions on the singular vectors of the matrix, recovery is possible by solving a convenient convex program as soon as the number of entries is on the order of the information theoretic limit (up to logarithmic factors). This convex program simply finds, among all matrices consistent with the observed entries, that with minimum nuclear norm. As an example, we show that on the order of nr log(n) samples are needed to recover a random n x n matrix of rank r by any method, and to be sure, nuclear norm minimization succeeds as soon as the number of entries is of the form nr polylog(n).

Affiliated with

Also associated with

No associations

Rating

The Power of Convex Relaxation: Near-Optimal Matrix Completion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Power of Convex Relaxation: Near-Optimal Matrix Completion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Power of Convex Relaxation: Near-Optimal Matrix Completion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-95345