An ℓp theory of PCA and spectral clustering

Abstract

Principal Component Analysis (PCA) is a powerful tool in statistics and machine learning. While existing study of PCA focuses on the recovery of principal components and their associated eigenvalues, there are few precise characterizations of individual principal component scores that yield low-dimensional embedding of samples. That hinders the analysis of various spectral methods. In this paper, we first develop an ${\ell }_{\mathit{p}}$ perturbation theory for a hollowed version of PCA in Hilbert spaces which provably improves upon the vanilla PCA in the presence of heteroscedastic noises. Through a novel ${\ell }_{\mathit{p}}$ analysis of eigenvectors, we investigate entrywise behaviors of principal component score vectors and show that they can be approximated by linear functionals of the Gram matrix in ${\ell }_{\mathit{p}}$ norm, which includes ${\ell }_2$ and ${\ell }_{\infty }$ as special cases. For sub-Gaussian mixture models, the choice of p giving optimal bounds depends on the signal-to-noise ratio, which further yields optimality guarantees for spectral clustering. For contextual community detection, the ${\ell }_{\mathit{p}}$ theory leads to simple spectral algorithms that achieve the information threshold for exact recovery and the optimal misclassification rate.