On the Robustness of Cross-Concentrated Sampling for Matrix Completion
arXiv:2401.15566 · doi:10.1109/CISS59072.2024.10480165
Abstract
Matrix completion is one of the crucial tools in modern data science research. Recently, a novel sampling model for matrix completion coined cross-concentrated sampling (CCS) has caught much attention. However, the robustness of the CCS model against sparse outliers remains unclear in the existing studies. In this paper, we aim to answer this question by exploring a novel Robust CCS Completion problem. A highly efficient non-convex iterative algorithm, dubbed Robust CUR Completion (RCURC), is proposed. The empirical performance of the proposed algorithm, in terms of both efficiency and robustness, is verified in synthetic and real datasets.
58th Annual Conference of Information Sciences and Systems
References in corpus (10)
- Robust Spectral Compressed Sensing via Structured Matrix Completion
- Fast Algorithms for Robust PCA via Gradient Descent
- Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation
- Robust CUR Decomposition: Theory and Imaging Applications
- Accelerated Structured Alternating Projections for Robust Spectrally Sparse Signal Recovery
- Robust PCA by Manifold Optimization
- Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
- Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection
- Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling
- Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption