Fast and Provable Tensor Robust Principal Component Analysis via Scaled Gradient Descent
Harry Dong, Tian Tong, Cong Ma, Yuejie Chi

TL;DR
This paper introduces a scalable, provably convergent algorithm for tensor robust PCA that efficiently recovers low-rank tensors from corrupted observations using scaled gradient descent and adaptive thresholding.
Contribution
It proposes a novel tensor RPCA method with theoretical guarantees and practical scalability, improving over existing algorithms in efficiency and robustness.
Findings
Linear convergence rate independent of condition number
Outperforms state-of-the-art tensor RPCA algorithms
Effective on synthetic and real-world data
Abstract
An increasing number of data science and machine learning problems rely on computation with tensors, which better capture the multi-way relationships and interactions of data than matrices. When tapping into this critical advantage, a key challenge is to develop computationally efficient and provably correct algorithms for extracting useful information from tensor data that are simultaneously robust to corruptions and ill-conditioning. This paper tackles tensor robust principal component analysis (RPCA), which aims to recover a low-rank tensor from its observations contaminated by sparse corruptions, under the Tucker decomposition. To minimize the computation and memory footprints, we propose to directly recover the low-dimensional tensor factors -- starting from a tailored spectral initialization -- via scaled gradient descent (ScaledGD), coupled with an iteration-varying thresholding…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Advanced Neuroimaging Techniques and Applications
MethodsTuckER
