Key points are not available for this paper at this time.
Robust principal component analysis (RPCA) is a widely used tool for dimension reduction. In this work, we propose a novel non-convex algorithm, coined Iterated Robust CUR (IRCUR), for solving RPCA problems, which dramatically improves the computational efficiency in comparison with the existing algorithms. IRCUR achieves this acceleration by employing CUR decomposition when updating the low rank component, which allows us to obtain an accurate low rank approximation via only three small submatrices. Consequently, IRCUR is able to process only the small submatrices and avoid the expensive computing on full matrix through the entire algorithm. Numerical experiments establish the computational advantage of IRCUR over the state-of-art algorithms on both synthetic and real-world datasets.
Building similarity graph...
Analyzing shared references across papers
Loading...
HanQin Cai
Keaton Hamm
Longxiu Huang
IEEE Signal Processing Letters
University of California, Los Angeles
Sun Yat-sen University
The University of Texas at Arlington
Building similarity graph...
Analyzing shared references across papers
Loading...
Cai et al. (Fri,) studied this question.
www.synapsesocial.com/papers/69dabcc9a6045d71bfa3e009 — DOI: https://doi.org/10.1109/lsp.2020.3044130