Low-Rank Matrix Recovery From Errors And Erasures
IEEE Transactions on Information Theory(2011)
摘要
This paper considers the recovery of a low-rank matrix from an observed version that simultaneously contains both (a) erasures: most entries are not observed, and (b) errors: values at a constant fraction of (unknown) locations are arbitrarily corrupted. We provide a new unified performance guarantee on when a (natural) recently proposed method, based on convex optimization, succeeds in exact recovery. Our result allows for the simultaneous presence of random and deterministic components in both the error and erasure patterns. On the one hand, corollaries obtained by specializing this one single result in different ways recovers (upto poly-log factors) all the existing works in matrix completion, and sparse and low-rank matrix recovery. On the other hand, our results also provide the first guarantees for (a) deterministic matrix completion, and (b) recovery when we observe a vanishing fraction of entries of a corrupted matrix.
更多查看译文
关键词
robustness,pattern recognition,error patterns,sparse matrix decomposition,erasure patterns,matrix decomposition,low-rank matrix recovery,sparsity,statistical learning,low-rank matrix decomposition,low-rank,convex programming,information theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络