Deflated HeteroPCA: Overcoming the curse of ill-conditioning in heteroskedastic PCA
Yuchen Zhou, Yuxin Chen

TL;DR
This paper introduces Deflated-HeteroPCA, an algorithm that overcomes ill-conditioning issues in heteroskedastic PCA, providing near-optimal statistical guarantees for low-rank matrix estimation under challenging noise conditions.
Contribution
The paper proposes Deflated-HeteroPCA, a novel spectral algorithm that divides the spectrum into well-conditioned blocks, overcoming the curse of ill-conditioning in heteroskedastic PCA.
Findings
Achieves near-optimal statistical accuracy without condition number dependence.
Effectively handles heteroskedastic noise and unbalanced dimensions.
Improves performance in factor model and tensor PCA applications.
Abstract
This paper is concerned with estimating the column subspace of a low-rank matrix from contaminated data. How to obtain optimal statistical accuracy while accommodating the widest range of signal-to-noise ratios (SNRs) becomes particularly challenging in the presence of heteroskedastic noise and unbalanced dimensionality (i.e., ). While the state-of-the-art algorithm emerges as a powerful solution for solving this problem, it suffers from "the curse of ill-conditioning," namely, its performance degrades as the condition number of grows. In order to overcome this critical issue without compromising the range of allowable SNRs, we propose a novel algorithm, called , that achieves near-optimal and condition-number-free theoretical guarantees in terms of…
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
TopicsSparse and Compressive Sensing Techniques · Blind Source Separation Techniques · Tensor decomposition and applications
MethodsPrincipal Components Analysis
