en
0.25
0.5
0.75
1.25
1.5
1.75
2
Provable Matrix Completion using Alternating Minimization
Published on Jan 16, 20134211 Views
Alternating minimization has emerged as a popular heuristic for large-scale machine learning problems involving low-rank matrices. However, there have been few (if any) theoretical guarantees on its p
Related categories
Chapter list
Provable Matrix Completion using Alternating Minimization00:00
Alternating Minimization (AltMin)00:08
Matrix Completion01:21
A Comparision02:05
Matrix Sensing02:27
Existing Results04:07
Our Results (1)05:03
Matrix Completion06:24
Our Algorithm07:43
Existing Results08:35
Our Results (2)09:55
Main Idea of the Proof11:41
Summary12:18
Future Work12:54
References13:18