Robust PCA via Outlier Pursuit

DOI10.1109/TIT.2011.2173156zbMath1365.62228arXiv1010.4237MaRDI QIDQ5271969

Sujay Sanghavi, Huan Xu, Constantine Caramanis

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.4237

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Applications of mathematical programming (90C90)

Related Items

A novel robust principal component analysis method for image and video processing. ⋮ A survey of nonlinear robust optimization ⋮ Robust low-rank data matrix approximations ⋮ Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems ⋮ Convergence analysis of the augmented Lagrange multiplier algorithm for a class of matrix compressive recovery ⋮ Robust \(\ell_1\) approaches to computing the geometric median and principal and independent components ⋮ Low-Rank and Sparse Multi-task Learning ⋮ Regularized high dimension low tubal-rank tensor regression ⋮ Dimensionality Reduction, Regularization, and Generalization in Overparameterized Regressions ⋮ Stable Camera Motion Estimation Using Convex Programming ⋮ Asymptotic performance of PCA for high-dimensional heteroscedastic data ⋮ Two modified augmented Lagrange multiplier algorithms for Toeplitz matrix compressive recovery ⋮ On the rotational invariant \(L_1\)-norm PCA ⋮ Robust alternating low-rank representation by joint \(L_p\)- and \(L_{2,p}\)-norm minimization ⋮ Sharp recovery bounds for convex demixing, with applications ⋮ Unnamed Item ⋮ Compressed sensing and matrix completion with constant proportion of corruptions ⋮ Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem ⋮ Adaptive and robust multi-task learning ⋮ Unnamed Item ⋮ Two proposals for robust PCA using semidefinite programming ⋮ Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions ⋮ Robust Subspace Discovery via Relaxed Rank Minimization ⋮ Relations Among Some Low-Rank Subspace Recovery Models ⋮ Health policyholder clustering using medical consumption. A useful tool for targeting prevention plans ⋮ Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems ⋮ Multi-stage convex relaxation method for low-rank and sparse matrix separation problem ⋮ \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers ⋮ Alternating direction method of multipliers for generalized low-rank tensor recovery ⋮ Outlier detection in networks with missing links ⋮ Robust bilinear factorization with missing and grossly corrupted observations ⋮ Robust matrix completion ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ Recent advances in robust optimization: an overview ⋮ Online optimization for max-norm regularization ⋮ Traditional and recent approaches in background modeling for foreground detection: an overview ⋮ On the robust PCA and Weiszfeld's algorithm ⋮ Unnamed Item ⋮ Blind Source Separation with Outliers in Transformed Domains ⋮ Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm ⋮ A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers ⋮ High-dimensional index volatility models via Stein's identity ⋮ Fast global convergence of gradient methods for high-dimensional statistical recovery ⋮ ORCA: outlier detection and robust clustering for attributed graphs ⋮ On the Complexity of Robust PCA and ℓ₁-Norm Low-Rank Matrix Approximation ⋮ Modal Principal Component Analysis ⋮ Accelerated Alternating Projections for Robust Principal Component Analysis ⋮ Exact Camera Location Recovery by Least Unsquared Deviations ⋮ Unnamed Item ⋮ Robust CUR Decomposition: Theory and Imaging Applications ⋮ Set membership identification of switched linear systems with known number of subsystems ⋮ Discussion of: ``The power of monitoring: how to make the most of a contaminated multivariate sample ⋮ Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction ⋮ Robust computation of linear models by convex relaxation ⋮ A smoothing proximal gradient algorithm for matrix rank minimization problem