Normal Approximation and Confidence Region of Singular Subspaces
Dong Xia

TL;DR
This paper develops a non-asymptotic normal approximation framework for singular subspaces under i.i.d. noise, providing explicit formulas, bias corrections, and simulation validation, applicable to high-dimensional matrices without eigen-gap conditions.
Contribution
It introduces a novel explicit spectral projector formula, analyzes the expected projection distance with higher-order approximations, and establishes non-asymptotic normality under minimal conditions.
Findings
Explicit spectral projector formula valid for deterministic perturbations
Normal approximation of projection distance with bias corrections
Applicable to diverging rank and no eigen-gap requirement
Abstract
This paper is on the normal approximation of singular subspaces when the noise matrix has i.i.d. entries. Our contributions are three-fold. First, we derive an explicit representation formula of the empirical spectral projectors. The formula is neat and holds for deterministic matrix perturbations. Second, we calculate the expected projection distance between the empirical singular subspaces and true singular subspaces. Our method allows obtaining arbitrary -th order approximation of the expected projection distance. Third, we prove the non-asymptotical normal approximation of the projection distance with different levels of bias corrections. By the -th order bias corrections, the asymptotical normality holds under optimal signal-to-noise ration (SNR) condition where and denote the matrix sizes. In addition, it shows that higher order…
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 · Matrix Theory and Algorithms · Random Matrices and Applications
