0.25
0.5
0.75
1.25
1.5
1.75
2
Fast Exact Matrix Completion with Finite Samples
Published on Aug 20, 20151733 Views
Matrix completion is the problem of recovering a low rank matrix by observing a small fraction of its entries. A series of recent works \citep{Keshavan2012,JainNS2013,Hardt2013} have proposed fast non
Related categories
Chapter list
Fast Exact Matrix Completion with Finite Samples00:00
Problem: Low-rank Matrix Completion00:12
Result: Fast and Exact Recovery Algorithm00:35
Algorithm: Projected Gradient Descent02:05
Techniques03:05