Matrix completion with column manipulation: Near-optimal sample-robustness-rank tradeoffs

Yudong Chen, Huan Xu, Constantine Caramanis +1

This paper considers the problem of matrix completion when some number of the columns are completely and arbitrarily corrupted, potentially by a malicious adversary. It is well-kno…