102 citations · 108 across the 2 of their papers we have counts for
2 papers
cs.LG2009★ 102 cited
Matrix Completion from a Few Entries
Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh
Let M be a random (alpha n) x n matrix of rank r<<n, and assume that a uniformly random subset E of its entries is observed. We describe an efficient algorithm that reconstructs M…
cs.DS2008★ 6 cited
Learning Low Rank Matrices from O(n) Entries
Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh
How many random entries of an n by m, rank r matrix are necessary to reconstruct the matrix within an accuracy d? We address this question in the case of a random matrix with bound…