170 citations · 909 across the 66 of their papers we have counts for
Showing 2013 · stat.MLShow all
2 papers · 2 filters
stat.ML2013★ 4 cited
Recovery guarantees for exemplar-based clustering
Abhinav Nellore, Rachel Ward
For a certain class of distributions, we prove that the linear programming relaxation of -medoids clustering---a variant of -means clustering where means are replaced by exem…
stat.ML2013★ 21 cited
Completing Any Low-rank Matrix, Provably
Yudong Chen, Srinadh Bhojanapalli, Sujay Sanghavi +1
Matrix completion, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a…