Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis
Mostafa Rahmani, George Atia

TL;DR
Coherence Pursuit (CoP) is a fast, simple, and robust PCA algorithm that distinguishes inliers from outliers based on mutual coherence, offering strong theoretical guarantees and high efficiency in noisy and outlier-rich environments.
Contribution
Introduces Coherence Pursuit (CoP), a non-iterative robust PCA method with analytical performance guarantees, capable of handling large numbers of outliers efficiently.
Findings
CoP is significantly faster than existing robust PCA algorithms.
CoP provides provable guarantees under various data distribution models.
It effectively separates inliers from outliers in noisy conditions.
Abstract
This paper presents a remarkably simple, yet powerful, algorithm termed Coherence Pursuit (CoP) to robust Principal Component Analysis (PCA). As inliers lie in a low dimensional subspace and are mostly correlated, an inlier is likely to have strong mutual coherence with a large number of data points. By contrast, outliers either do not admit low dimensional structures or form small clusters. In either case, an outlier is unlikely to bear strong resemblance to a large number of data points. Given that, CoP sets an outlier apart from an inlier by comparing their coherence with the rest of the data points. The mutual coherences are computed by forming the Gram matrix of the normalized data points. Subsequently, the sought subspace is recovered from the span of the subset of the data points that exhibit strong coherence with the rest of the data. As CoP only involves one simple matrix…
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.
Taxonomy
MethodsPrincipal Components Analysis
