Robust Matrix Completion

Completing Low-Rank Matrices with Corrupted Samples from Few Coefficients in General Basis

In this paper, we prove that the range space of an m × n matrix with rank r can be exactly recovered from a few coefficients with respect to general basis, though r and the number of corrupted samples are both as high as O(min{m, n}/ log3(m + n)).