mlsanityData to 7 Oct 2026

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

arXiv 2010.07422 ↗First posted 14 Oct 2020stat.ML cs.AI cs.ITcited by 16

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Oct 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 2; 2023: 3; 2024: 6.

16 papers.

Sort:

  1. 2021Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detectioncited by 34
  2. 2021Robust CUR Decomposition: Theory and Imaging Applicationscited by 20
  3. 2021Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositionscited by 13
  4. 2022Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Samplingcited by 12
  5. 2023Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruptioncited by 11
  6. 2021Fast Robust Tensor Principal Component Analysis via Fiber CUR Decompositioncited by 8
  7. 2022Riemannian CUR Decompositions for Robust Principal Component Analysiscited by 7
  8. 2024On the Robustness of Cross-Concentrated Sampling for Matrix Completioncited by 5
  9. 2024Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recoverycited by 4
  10. 2024Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descentcited by 3
  11. 2023Deep Unrolling for Nonconvex Robust Principal Component Analysiscited by 2
  12. 2024S3Attention: Improving Long Sequence Attention with Smoothed Skeleton Sketchingcited by 2
4 more
  1. 2024Structured Sampling for Robust Euclidean Distance Geometrycited by 2
  2. 2021LSDAT: Low-Rank and Sparse Decomposition for Decision-based Adversarial Attackcited by 1
  3. 2024Coseparable Nonnegative Tensor Factorization With T-CUR Decompositioncited by 1
  4. 2023Maximal Volume Matrix Cross Approximation for Image Compression and Least Squares Solutioncited by 0