Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation

October 14, 2020 ยท Declared Dead ยท ๐Ÿ› IEEE Signal Processing Letters

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors HanQin Cai, Keaton Hamm, Longxiu Huang, Jiaqi Li, Tao Wang arXiv ID 2010.07422 Category stat.ML: Machine Learning (Stat) Cross-listed cs.AI, cs.IT, cs.LG, math.NA, math.OC Citations 52 Venue IEEE Signal Processing Letters Last Checked 5 months ago
Abstract
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 expensive computing on the 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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning (Stat)

๐Ÿ”ฎ ๐Ÿ”ฎ The Ethereal

Layer Normalization

Jimmy Lei Ba, Jamie Ryan Kiros, Geoffrey E. Hinton

stat.ML ๐Ÿ› arXiv ๐Ÿ“š 12.0K cites 10 years ago

Died the same way โ€” ๐Ÿ‘ป Ghosted