2019
Provable Memory-efficient Online Robust Matrix Completion
ICASSP 2019accepted
Robust Matrix Completion (RMC) is the problem of estimating a low-rank matrix in the presence of missing entries and element-wise (sparse) outliers. In this work, we study the RMC problem with the extra assumption that the clean data is generated from either a fixed or a slowly-changing low-dimensio…