Robust principal component analysis?

DOI10.1145/1970392.1970395zbMATH Open1327.62369OpenAlexW2145962650WikidataQ55921973 ScholiaQ55921973MaRDI QIDQ3016258FDOQ3016258

Authors:

Publication date: 14 July 2011

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1970392.1970395

Recommendations

• Conditions for robust principal component analysis
• Efficient algorithms for robust and stable principal component pursuit problems
• Random consensus robust PCA
• A novel robust principal component analysis method for image and video processing.
• Two proposals for robust PCA using semidefinite programming

zbMATH Keywords

principal componentssparsitydualityvideo surveillance\(\ell_1\)-norm minimizationnuclear-norm minimizationlow-rank matricesrobustness vis-a-vis outliers

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Numerical mathematical programming methods (65K05) Convex programming (90C25) Machine vision and scene understanding (68T45)

Cited In (only showing first 100 items - show all)

• Robust modifications of U-statistics and applications to covariance estimation problems
• Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
• An alternating direction method with continuation for nonconvex low rank minimization
• Compressive sensing based machine learning strategy for characterizing the flow around a cylinder with limited pressure measurements
• ORCA: outlier detection and robust clustering for attributed graphs
• Split Bregman method for large scale fused Lasso
• A novel robust principal component analysis method for image and video processing.
• Certifiably optimal sparse principal component analysis
• Compressive principal component pursuit
• Joint and individual variation explained (JIVE) for integrated analysis of multiple data types
• Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
• On factor models with random missing: EM estimation, inference, and cross validation
• An alternating direction algorithm for matrix completion with nonnegative factors
• Incremental principal component pursuit for video background modeling
• Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems
• Flexible low-rank statistical modeling with missing data and side information
• Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
• Learning non-parametric basis independent models from point queries via low-rank methods
• Discussion: Latent variable graphical model selection via convex optimization
• Super-resolution of point sources via convex programming
• Sparse plus low rank network identification: a nonparametric approach
• Convergence analysis of the augmented Lagrange multiplier algorithm for a class of matrix compressive recovery
• Theoretical and experimental analyses of tensor-based regression and classification
• Rejoinder: Latent variable graphical model selection via convex optimization
• Regularized high dimension low tubal-rank tensor regression
• Discussion: Latent variable graphical model selection via convex optimization
• Entrywise eigenvector analysis of random matrices with low expected rank
• Adaptive shrinkage of singular values
• Robust \(\ell_1\) approaches to computing the geometric median and principal and independent components
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
• Principal component analysis: a review and recent developments
• Convex optimization for the planted \(k\)-disjoint-clique problem
• Geometric inference for general high-dimensional linear inverse problems
• An algorithm twisted from generalized ADMM for multi-block separable convex minimization models
• Modeling and performance evaluation of stealthy false data injection attacks on smart grid in the presence of corrupted measurements
• On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models
• Max-norm optimization for robust matrix recovery
• Gradient-based Regularization Parameter Selection for Problems With Nonsmooth Penalty Functions
• TILT: transform invariant low-rank textures
• Multiresolution dynamic mode decomposition
• Two proposals for robust PCA using semidefinite programming
• Using shapes correlation for active contour segmentation of uterine fibroid ultrasound images in computer-aided therapy
• Alternating proximal gradient method for convex minimization
• The convex geometry of linear inverse problems
• Sparsity based nonlocal image restoration: an alternating optimization approach
• Compressed sensing and matrix completion with constant proportion of corruptions
• Sharp MSE bounds for proximal denoising
• An improved robust ADMM algorithm for quantum state tomography
• A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
• Efficient algorithms for robust and stable principal component pursuit problems
• Vector diffusion maps and the connection Laplacian
• ROP: matrix recovery via rank-one projections
• Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization
• Robust High-Dimensional Volatility Matrix Estimation for High-Frequency Factor Model
• Cauchy robust principal component analysis with applications to high-deimensional data sets
• Hybrid reconstruction of quantum density matrix: when low-rank meets sparsity
• Learning with tensors: a framework based on convex optimization and spectral regularization
• Matrix recipes for hard thresholding methods
• Fast alternating linearization methods for minimizing the sum of two convex functions
• Large Covariance Estimation by Thresholding Principal Orthogonal Complements
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• Robust computation of linear models by convex relaxation
• Latent variable graphical model selection via convex optimization
• Geometric median and robust estimation in Banach spaces
• Traditional and recent approaches in background modeling for foreground detection: an overview
• Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
• Title not available (Why is that?)
• Fast community detection by SCORE
• Main effects and interactions in mixed and incomplete data frames
• Quasi-likelihood and/or robust estimation in high dimensions
• On the Compressive Spectral Method
• An introduction to a class of matrix cone programming
• Robust matrix completion
• Sparse principal component analysis via variable projection
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Bayesian inference via projections
• Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
• Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time
• Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation
• An efficient algorithm for computing the approximate t-URV and its applications
• An unbiased approach to compressed sensing
• An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems
• Stable recovery of entangled weights: towards robust identification of deep neural networks from minimal samples
• Bias versus non-convexity in compressed sensing
• The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization
• Bayesian sparse covariance decomposition with a graphical structure
• Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
• Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
• Learning latent variable Gaussian graphical model for biomolecular network with low sample complexity
• Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization
• Sharp oracle inequalities for low-complexity priors
• Stochastic model-based minimization of weakly convex functions
• Robust principal component analysis: a factorization-based approach with linear complexity
• A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming
• Estimation of the parameters of a weighted nuclear norm model and its application in image denoising
• Directed principal component analysis
• Complex best \(r\)-term approximations almost always exist in finite dimensions
• A generalized non-convex method for robust tensor completion
• Tensor Robust Principal Component Analysis via Tensor Fibered Rank and \({\boldsymbol{{l_p}}}\) Minimization

This page was built for publication: Robust principal component analysis?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3016258)