Robust PCA for High Dimensional Data based on Characteristic Transformation
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a novel robust Principal Component Analysis (PCA) for high-dimensional data in the presence of various heterogeneities, especially the heavy-tailedness and outliers. A transformation motivated by the characteristic function is constructed to improve the robustness of the classical PCA. Besides the typical outliers, the proposed method has the unique advantage of dealing with heavy-tail-distributed data, whose covariances could be nonexistent (positively infinite, for instance). The proposed approach is also a case of kernel principal component analysis (KPCA) method and adopts the robust and non-linear properties via a bounded and non-linear kernel function. The merits of the new method are illustrated by some statistical properties including the upper bound of the excess error and the behaviors of the large eigenvalues under a spiked covariance model. In addition, we show the advantages of our method over the classical PCA by a variety of simulations. At last, we apply the new robust PCA to classify mice with different genotypes in a biological study based on their protein expression data and find that our method is more accurately on identifying abnormal mice comparing to the classical PCA.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Apr 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.
- 2025Sparse corruption in low-rank matrix inference: the PCA benchmarkcited by 2
- 2026Heavy-Tailed Principal Component Analysiscited by 0
- 2026Heavy-Tailed Principal Component Analysis11 Mar 2026
- 2025Sparse corruption in low-rank matrix inference: the PCA benchmark14 Nov 2025