Performance Guarantees for ReProCS -- Correlated Low-Rank Matrix Entries Case

Jinchun Zhan, Namrata Vaswani, Chenlu Qiu

Online or recursive robust PCA can be posed as a problem of recovering a sparse vector, $S_t$, and a dense vector, $L_t$, which lies in a slowly changing low-dimensional subspace,…