Mean-Shift PCA by Knockoff Mean
Not on the map. Why?
Abstract (arXiv)
Removing noise is difficult, but adding noise is easy. In this work, we show how to eliminate mean-shift noisy components from PCA by deliberately introducing knockoff mean-shift perturbation. Standard PCA is highly sensitive to shifts in the sample mean: a small fraction of samples from a shifted distribution can cause large deviations in the leading principal components. In high-dimensional regimes, existing Robust PCA approaches cannot handle the mean-shift contamination structure inherent in the mixture model. Using tools from Random Matrix Theory, we prove that the mean-shift spikes are spectrally separable from the stable eigenvalues of the original covariance. Furthermore, the original eigenspace remains asymptotically invariant to the contamination, independent of the mixture weight. Exploiting this spectral stability, we propose a simple, two-stage PCA algorithm by adding knockoff mean that identifies and removes the mean-shift component using only standard PCA operations.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 27 references that are in the map. First posted on arXiv 25 May 2026.
Builds on
8 of 27 references.
References · 8
- 2023Ambient Diffusion: Learning Clean Distributions from Corrupted Datacited by 111
- 2014Non-convex Robust PCAcited by 41
- 2020Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packingcited by 35
- 2021Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detectioncited by 34
- 2017Accelerated Alternating Projections for Robust Principal Component Analysiscited by 25
- 2014Optimal Algorithms for L1-subspace Signal Processingcited by 14
- 2016Efficient L1-Norm Principal-Component Analysis via Bit Flippingcited by 9
- 2021Robust Principal Component Analysis: A Median of Means Approachcited by 4
Built on by
Not cited yet.