mlsanityData to 7 Oct 2026

Deep Unfolded Tensor Robust PCA with Self-supervised Learning

arXiv 2212.11346 ↗First posted 21 Dec 2022stat.ML cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Tensor robust principal component analysis (RPCA), which seeks to separate a low-rank tensor from its sparse corruptions, has been crucial in data science and machine learning where tensor structures are becoming more prevalent. While powerful, existing tensor RPCA algorithms can be difficult to use in practice, as their performance can be sensitive to the choice of additional hyperparameters, which are not straightforward to tune. In this paper, we describe a fast and simple self-supervised model for tensor RPCA using deep unfolding by only learning four hyperparameters. Despite its simplicity, our model expunges the need for ground truth labels while maintaining competitive or even greater performance compared to supervised deep unfolding. Furthermore, our model is capable of operating in extreme data-starved scenarios. We demonstrate these claims on a mix of synthetic data and real-world tasks, comparing performance against previously studied supervised deep unfolding methods and Bayesian optimization baselines.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 14 of its 24 references that are in the map. First posted on arXiv 21 Dec 2022.

Builds on

14 of 24 references.

References · 14

  1. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
  2. 2018Tensor Robust Principal Component Analysis with A New Tensor Nuclear Normcited by 110
  3. 2020Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descentcited by 70
  4. 2018Deep Unfolded Robust PCA with Application to Clutter Suppression in Ultrasoundcited by 43
  5. 2017Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimizationcited by 35
  6. 2021Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detectioncited by 34
  7. 2014On Tensor Completion via Nuclear Norm Minimizationcited by 32
  8. 2019Low-rank matrix recovery with composite optimization: good conditioning and rapid convergencecited by 31
  9. 2021Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurementscited by 28
  10. 2020Low-Rank Matrix Recovery with Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Numbercited by 27
  11. 2022Fast and Provable Tensor Robust Principal Component Analysis via Scaled Gradient Descentcited by 11
  12. 2020A Deep-Unfolded Reference-Based RPCA Network For Video Foreground-Background Separationcited by 6
2 more
  1. 2015Tensor vs Matrix Methods: Robust Tensor Decomposition under Block Sparse Perturbationscited by 5
  2. 2019Tensor Robust Principal Component Analysis: Better recovery with atomic norm regularizationcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 2; 2025: 2; 2026: 2.

7 papers.