Sparse PCA: Phase Transitions in the Critical Regime
Michael J. Feldman, Theodor Misiakiewicz, Elad Romanov

TL;DR
This paper analyzes phase transitions in sparse PCA within high-dimensional settings, revealing thresholds for signal detectability and support recovery using kernel PCA, and identifying optimal kernel functions for these tasks.
Contribution
It introduces a detailed phase transition analysis for sparse PCA in the critical regime, extending kernel PCA methods and identifying optimal kernels for detection and support recovery.
Findings
Detectability phase transition analogous to BBP transition
Support recovery is possible above the detection threshold
Soft thresholding kernel is nearly optimal for detection
Abstract
This work studies estimation of sparse principal components in high dimensions. Specifically, we consider a class of estimators based on kernel PCA, generalizing the covariance thresholding algorithm proposed by Krauthgamer et al. (2015). Focusing on Johnstone's spiked covariance model, we investigate the "critical" sparsity regime, where the sparsity level , sample size , and dimension each diverge and , . Within this framework, we develop a fine-grained understanding of signal detection and recovery. Our results establish a detectability phase transition, analogous to the Baik--Ben Arous--P\'ech\'e (BBP) transition: above a certain threshold -- depending on the kernel function, , and -- kernel PCA is informative. Conversely, below the threshold, kernel principal components are asymptotically orthogonal…
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
TopicsTheoretical and Computational Physics
