229 citations · 1.5k across the 69 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.NA2014★ 10 cited
Fast Exact Matrix Completion with Finite Samples
Prateek Jain, Praneeth Netrapalli
Matrix completion is the problem of recovering a low rank matrix by observing a small fraction of its entries. A series of recent works [KOM12,JNS13,HW14] have proposed fast non-co…
cs.IT2014★ 107 cited
Non-convex Robust PCA
Praneeth Netrapalli, U N Niranjan, Sujay Sanghavi +2
We propose a new method for robust PCA -- the task of recovering a low-rank matrix from sparse corruptions that are of unknown value and support. Our method involves alternating be…
math.PR2014★ 22 cited
Non-Reconstructability in the Stochastic Block Model
Joe Neeman, Praneeth Netrapalli
We consider the problem of clustering (or reconstruction) in the stochastic block model, in the regime where the average degree is constant. For the case of two clusters with equal…