Robust CUR Decomposition: Theory and Imaging Applications
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
- 2014Non-convex Robust PCAcited by 41
- 2016Fast Algorithms for Robust PCA via Gradient Descentcited by 39
- 2014Optimal CUR Matrix Decompositionscited by 29
- 2017Accelerated Alternating Projections for Robust Principal Component Analysiscited by 25
- 2013Improving CUR Matrix Decomposition and the Nystr"om Approximation via Adaptive Samplingcited by 21
- 2020A Critique of Self-Expressive Deep Subspace Clusteringcited by 18
- 2020Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimationcited by 16
- 2016Greedy Column Subset Selection: New Bounds and Distributed Algorithmscited by 13
- 2017Column subset selection is NP-completecited by 9
- 2018Reverse iterative volume sampling for linear regressioncited by 9
- 2017CUR Decompositions, Similarity Matrices, and Subspace Clusteringcited by 4
Built on by
Citing papers per year: 2021: 4; 2022: 3; 2023: 4; 2024: 7; 2025: 2.
20 papers.
Sort:
- 2021Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detectioncited by 34
- 2021Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositionscited by 13
- 2022Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Samplingcited by 12
- 2023Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruptioncited by 11
- 2023Latent Graph Inference with Limited Supervisioncited by 9
- 2021Fast Robust Tensor Principal Component Analysis via Fiber CUR Decompositioncited by 8
- 2022Riemannian CUR Decompositions for Robust Principal Component Analysiscited by 7
- 2024On the Robustness of Cross-Concentrated Sampling for Matrix Completioncited by 5
- 2024CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decompositioncited by 3
- 2024Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descentcited by 3
- 2024S3Attention: Improving Long Sequence Attention with Smoothed Skeleton Sketchingcited by 2
- 2024Structured Sampling for Robust Euclidean Distance Geometrycited by 2
8 more
- 2021Co-Separable Nonnegative Matrix Factorizationcited by 1
- 2022Error Analysis of Tensor-Train Cross Approximationcited by 1
- 2025A Dual Basis Approach for Structured Robust Euclidean Distance Geometrycited by 1
- 2023Boosting Nystr"om Methodcited by 0
- 2023Orthogonally weighted ℓ2,1 regularization for rank-aware joint sparse recovery: algorithm and analysiscited by 0
- 2024Randomized Approach to Matrix Completion: Applications in Recommendation Systems and Image Inpaintingcited by 0
- 2024Approximation of the Proximal Operator of the ℓ_∞ Norm Using a Neural Networkcited by 0
- 2025Property Inheritance for Subtensors in Tensor Train Decompositionscited by 0
- 2025A Dual Basis Approach for Structured Robust Euclidean Distance Geometry23 May 2025
- 2025Property Inheritance for Subtensors in Tensor Train Decompositions15 Apr 2025
- 2024Structured Sampling for Robust Euclidean Distance Geometry14 Dec 2024
- 2024Approximation of the Proximal Operator of the ℓ_∞ Norm Using a Neural Network20 Aug 2024
- 2024S3Attention: Improving Long Sequence Attention with Smoothed Skeleton Sketching16 Aug 2024
- 2024Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent11 Jun 2024
- 2024Randomized Approach to Matrix Completion: Applications in Recommendation Systems and Image Inpainting4 Mar 2024
- 2024CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decomposition26 Feb 2024
- 2024On the Robustness of Cross-Concentrated Sampling for Matrix Completion28 Jan 2024
- 2023Orthogonally weighted ℓ2,1 regularization for rank-aware joint sparse recovery: algorithm and analysis21 Nov 2023
- 2023Latent Graph Inference with Limited Supervision6 Oct 2023
- 2023Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption6 May 2023
8 more
- 2023Boosting Nystr"om Method21 Feb 2023
- 2022Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling20 Aug 2022
- 2022Error Analysis of Tensor-Train Cross Approximation9 Jul 2022
- 2022Riemannian CUR Decompositions for Robust Principal Component Analysis17 Jun 2022
- 2021Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection11 Oct 2021
- 2021Co-Separable Nonnegative Matrix Factorization2 Sep 2021
- 2021Fast Robust Tensor Principal Component Analysis via Fiber CUR Decomposition23 Aug 2021
- 2021Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions19 Mar 2021
- 2021Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detectioncited by 34
- 2021Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositionscited by 13
- 2022Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Samplingcited by 12
- 2023Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruptioncited by 11
- 2023Latent Graph Inference with Limited Supervisioncited by 9
- 2021Fast Robust Tensor Principal Component Analysis via Fiber CUR Decompositioncited by 8
- 2022Riemannian CUR Decompositions for Robust Principal Component Analysiscited by 7
- 2024On the Robustness of Cross-Concentrated Sampling for Matrix Completioncited by 5
- 2024CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decompositioncited by 3
- 2024Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descentcited by 3
- 2024S3Attention: Improving Long Sequence Attention with Smoothed Skeleton Sketchingcited by 2
- 2024Structured Sampling for Robust Euclidean Distance Geometrycited by 2
12 most cited of 20 All 20 (JSON)
- 2025A Dual Basis Approach for Structured Robust Euclidean Distance Geometry23 May 2025
- 2025Property Inheritance for Subtensors in Tensor Train Decompositions15 Apr 2025
- 2024Structured Sampling for Robust Euclidean Distance Geometry14 Dec 2024
- 2024Approximation of the Proximal Operator of the ℓ_∞ Norm Using a Neural Network20 Aug 2024
- 2024S3Attention: Improving Long Sequence Attention with Smoothed Skeleton Sketching16 Aug 2024
- 2024Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent11 Jun 2024
- 2024Randomized Approach to Matrix Completion: Applications in Recommendation Systems and Image Inpainting4 Mar 2024
- 2024CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decomposition26 Feb 2024
- 2024On the Robustness of Cross-Concentrated Sampling for Matrix Completion28 Jan 2024
- 2023Orthogonally weighted ℓ2,1 regularization for rank-aware joint sparse recovery: algorithm and analysis21 Nov 2023
- 2023Latent Graph Inference with Limited Supervision6 Oct 2023
- 2023Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption6 May 2023
12 newest of 20 All 20 (JSON)