mlsanityData to 7 Oct 2026

Robust CUR Decomposition: Theory and Imaging Applications

arXiv 2101.05231 ↗First posted 5 Jan 2021cs.CV cs.LG eess.IVcited by 20

Not on the map. Why?

Abstract (arXiv)

This paper considers the use of Robust PCA in a CUR decomposition framework and applications thereof. Our main algorithms produce a robust version of column-row factorizations of matrices D=L+S where L is low-rank and S contains sparse outliers. These methods yield interpretable factorizations at low computational cost, and provide new CUR decompositions that are robust to sparse outliers, in contrast to previous methods. We consider two key imaging applications of Robust PCA: video foreground-background separation and face modeling. This paper examines the qualitative behavior of our Robust CUR decompositions on the benchmark videos and face datasets, and find that our method works as well as standard Robust PCA while being significantly faster. Additionally, we consider hybrid randomized and deterministic sampling methods which produce a compact CUR decomposition of a given matrix, and apply this to video sequences to produce canonical frames thereof.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). Builds on 11 of its 53 references that are in the map. First posted on arXiv 5 Jan 2021.

Builds on

11 of 53 references.

References · 11

  1. 2014Non-convex Robust PCAcited by 41
  2. 2016Fast Algorithms for Robust PCA via Gradient Descentcited by 39
  3. 2014Optimal CUR Matrix Decompositionscited by 29
  4. 2017Accelerated Alternating Projections for Robust Principal Component Analysiscited by 25
  5. 2013Improving CUR Matrix Decomposition and the Nystr"om Approximation via Adaptive Samplingcited by 21
  6. 2020A Critique of Self-Expressive Deep Subspace Clusteringcited by 18
  7. 2020Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimationcited by 16
  8. 2016Greedy Column Subset Selection: New Bounds and Distributed Algorithmscited by 13
  9. 2017Column subset selection is NP-completecited by 9
  10. 2018Reverse iterative volume sampling for linear regressioncited by 9
  11. 2017CUR Decompositions, Similarity Matrices, and Subspace Clusteringcited by 4

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 3; 2023: 4; 2024: 7; 2025: 2.

20 papers.

Sort:

  1. 2021Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detectioncited by 34
  2. 2021Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositionscited by 13
  3. 2022Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Samplingcited by 12
  4. 2023Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruptioncited by 11
  5. 2023Latent Graph Inference with Limited Supervisioncited by 9
  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. 2024CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decompositioncited by 3
  10. 2024Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descentcited by 3
  11. 2024S3Attention: Improving Long Sequence Attention with Smoothed Skeleton Sketchingcited by 2
  12. 2024Structured Sampling for Robust Euclidean Distance Geometrycited by 2
8 more
  1. 2021Co-Separable Nonnegative Matrix Factorizationcited by 1
  2. 2022Error Analysis of Tensor-Train Cross Approximationcited by 1
  3. 2025A Dual Basis Approach for Structured Robust Euclidean Distance Geometrycited by 1
  4. 2023Boosting Nystr"om Methodcited by 0
  5. 2023Orthogonally weighted ℓ2,1 regularization for rank-aware joint sparse recovery: algorithm and analysiscited by 0
  6. 2024Randomized Approach to Matrix Completion: Applications in Recommendation Systems and Image Inpaintingcited by 0
  7. 2024Approximation of the Proximal Operator of the ℓ_∞ Norm Using a Neural Networkcited by 0
  8. 2025Property Inheritance for Subtensors in Tensor Train Decompositionscited by 0