Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption

Abstract

We study the tensor robust principal component analysis (TRPCA) problem, a tensorial extension of matrix robust principal component analysis (RPCA), that aims to split the given tensor into an underlying low-rank component and a sparse outlier component. This work proposes a fast algorithm, called Robust Tensor CUR Decompositions (RTCUR), for large-scale non-convex TRPCA problems under the Tucker rank setting. RTCUR is developed within a framework of alternating projections that projects between the set of low-rank tensors and the set of sparse tensors. We utilize the recently developed tensor CUR decomposition to substantially reduce the computational complexity in each projection. In addition, we develop four variants of RTCUR for different application settings. We demonstrate the effectiveness and computational advantages of RTCUR against state-of-the-art methods on both synthetic and real-world datasets.

References in corpus (7)

• Sparsity and Incoherence in Compressive Sampling
• Rank-Sparsity Incoherence for Matrix Decomposition
• Tensor Regression with Applications in Neuroimaging Data Analysis
• 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
• Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion

Cited by in corpus (3)

• On the Robustness of Cross-Concentrated Sampling for Matrix Completion
• S${}^3$Attention: Improving Long Sequence Attention with Smoothed Skeleton Sketching
• Property Inheritance for Subtensors in Tensor Train Decompositions