Robust PCA as Bilinear Decomposition with Outlier-Sparsity Regularization
Gonzalo Mateos, Georgios B. Giannakis

TL;DR
This paper introduces a robust PCA framework using bilinear decomposition and outlier-sparsity regularization, enhancing outlier detection and subspace tracking in high-dimensional data, with applications in surveys, social networks, and surveillance.
Contribution
It develops a novel outlier-aware PCA method based on convex relaxation and regularization, enabling scalable, real-time, and kernelized robust subspace estimation.
Findings
Effective outlier detection in synthetic and real data
Robust community detection in social networks
Intruder identification in surveillance videos
Abstract
Principal component analysis (PCA) is widely used for dimensionality reduction, with well-documented merits in various applications involving high-dimensional data, including computer vision, preference measurement, and bioinformatics. In this context, the fresh look advocated here permeates benefits from variable selection and compressive sampling, to robustify PCA against outliers. A least-trimmed squares estimator of a low-rank bilinear factor analysis model is shown closely related to that obtained from an -(pseudo)norm-regularized criterion encouraging sparsity in a matrix explicitly modeling the outliers. This connection suggests robust PCA schemes based on convex relaxation, which lead naturally to a family of robust estimators encompassing Huber's optimal M-class as a special case. Outliers are identified by tuning a regularization parameter, which amounts to controlling…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
