arXiv cs.LG
· Papers
Understanding Alternating Minimization for Matrix Completion
arXiv:1312.0925v4 Announce Type: replace Abstract: Alternating Minimization is a widely used and empirically successful heuristic for matrix completion and related low-rank optimization problems. Theoretical guarantees for Alternating Minimization have been hard to come by and are still poorly understood. This is in pa