Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection
arXiv:2110.05649
Abstract
Robust principal component analysis (RPCA) is a critical tool in modern machine learning, which detects outliers in the task of low-rank matrix reconstruction. In this paper, we propose a scalable and learnable non-convex approach for high-dimensional RPCA problems, which we call Learned Robust PCA (LRPCA). LRPCA is highly efficient, and its free parameters can be effectively learned to optimize via deep unfolding. Moreover, we extend deep unfolding from finite iterations to infinite iterations via a novel feedforward-recurrent-mixed neural network model. We establish the recovery guarantee of LRPCA under mild assumptions for RPCA. Numerical experiments show that LRPCA outperforms the state-of-the-art RPCA algorithms, such as ScaledGD and AltProj, on both synthetic datasets and real-world applications.
arXiv commentNeurIPS 2021
References in corpus (12)
- The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices
- Euclidean Distance Matrices: Essential Theory, Algorithms and Applications
- Learned D-AMP: Principled Neural Network based Compressive Image Recovery
- Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholds
- Maximal Sparsity with Deep Networks?
- Learned Optimizers that Scale and Generalize
- Non-convex Robust PCA
- Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation
- Understanding and correcting pathologies in the training of learned optimizers
- Accelerated Structured Alternating Projections for Robust Spectrally Sparse Signal Recovery
- Accelerated Alternating Projections for Robust Principal Component Analysis
- Training Stronger Baselines for Learning to Optimize