English

The $\phi$-PCA Framework: A Unified and Efficiency-Preserving Approach with Robust Variants

Methodology 2025-10-16 v1 Statistics Theory Machine Learning Statistics Theory

Abstract

Principal component analysis (PCA) is a fundamental tool in multivariate statistics, yet its sensitivity to outliers and limitations in distributed environments restrict its effectiveness in modern large-scale applications. To address these challenges, we introduce the ϕ\phi-PCA framework which provides a unified formulation of robust and distributed PCA. The class of ϕ\phi-PCA methods retains the asymptotic efficiency of standard PCA, while aggregating multiple local estimates using a proper ϕ\phi function enhances ordering-robustness, leading to more accurate eigensubspace estimation under contamination. Notably, the harmonic mean PCA (HM-PCA), corresponding to the choice ϕ(u)=u1\phi(u)=u^{-1}, achieves optimal ordering-robustness and is recommended for practical use. Theoretical results further show that robustness increases with the number of partitions, a phenomenon seldom explored in the literature on robust or distributed PCA. Altogether, the partition-aggregation principle underlying ϕ\phi-PCA offers a general strategy for developing robust and efficiency-preserving methodologies applicable to both robust and distributed data analysis.

Keywords

Cite

@article{arxiv.2510.13159,
  title  = {The $\phi$-PCA Framework: A Unified and Efficiency-Preserving Approach with Robust Variants},
  author = {Hung Hung and Zhi-Yu Jou and Su-Yun Huang and Shinto Eguchi},
  journal= {arXiv preprint arXiv:2510.13159},
  year   = {2025}
}

Comments

27 pages, 4 figures

R2 v1 2026-07-01T06:38:09.014Z