Entrywise Estimation of Singular Vectors of Low-Rank Matrices with Heteroskedasticity and Dependence
Not on the map. Why?
Abstract (arXiv)
We propose an estimator for the singular vectors of high-dimensional low-rank matrices corrupted by additive subgaussian noise, where the noise matrix is allowed to have dependence within rows and heteroskedasticity between them. We prove finite-sample ℓ2,∞ bounds and a Berry-Esseen theorem for the individual entries of the estimator, and we apply these results to high-dimensional mixture models. Our Berry-Esseen theorem clearly shows the geometric relationship between the signal matrix, the covariance structure of the noise, and the distribution of the errors in the singular vector estimation task. These results are illustrated in numerical simulations. Unlike previous results of this type, which rely on assumptions of gaussianity or independence between the entries of the additive noise, handling the dependence between entries in the proofs of these results requires careful leave-one-out analysis and conditioning arguments. Our results depend only on the signal-to-noise ratio, the sample size, and the spectral properties of the signal matrix.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 May 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 3; 2024: 3; 2025: 0; 2026: 2.
12 papers.
- 2021Inference for Heteroskedastic PCA with Missing Datacited by 21
- 2022Leave-one-out Singular Subspace Perturbation Analysis for Spectral Clusteringcited by 14
- 2023Spectral Entry-wise Matrix Estimation for Low-Rank Reinforcement Learningcited by 9
- 2022Estimating Higher-Order Mixed Memberships via the ℓ2,∞ Tensor Perturbation Boundcited by 8
- 2023Deflated HeteroPCA: Overcoming the curse of ill-conditioning in heteroskedastic PCAcited by 7
- 2023Enhancing Accuracy in Deep Learning Using Random Matrix Theorycited by 5
- 2024Matrix Denoising with Doubly Heteroscedastic Noise: Fundamental Limits and Optimal Spectral Methodscited by 5
- 2022Entrywise Recovery Guarantees for Sparse PCA via Sparsistent Algorithmscited by 0
- 2024On Minimum Trace Factor Analysis -- An Old Song Sung to a New Tunecited by 0
- 2024Generalized Grade-of-Membership Estimation for High-dimensional Locally Dependent Datacited by 0
- 2026Adjacency Spectral Embeddings of Correlation Networkscited by 0
- 2026Heteroskedastic Canonical Polyadic Tensor Decompositioncited by 0
- 2026Heteroskedastic Canonical Polyadic Tensor Decomposition30 Sep 2026
- 2026Adjacency Spectral Embeddings of Correlation Networks24 Feb 2026
- 2024Generalized Grade-of-Membership Estimation for High-dimensional Locally Dependent Data27 Dec 2024
- 2024Matrix Denoising with Doubly Heteroscedastic Noise: Fundamental Limits and Optimal Spectral Methods22 May 2024
- 2024On Minimum Trace Factor Analysis -- An Old Song Sung to a New Tune4 Feb 2024
- 2023Spectral Entry-wise Matrix Estimation for Low-Rank Reinforcement Learning10 Oct 2023
- 2023Enhancing Accuracy in Deep Learning Using Random Matrix Theory4 Oct 2023
- 2023Deflated HeteroPCA: Overcoming the curse of ill-conditioning in heteroskedastic PCA10 Mar 2023
- 2022Estimating Higher-Order Mixed Memberships via the ℓ2,∞ Tensor Perturbation Bound16 Dec 2022
- 2022Leave-one-out Singular Subspace Perturbation Analysis for Spectral Clustering30 May 2022
- 2022Entrywise Recovery Guarantees for Sparse PCA via Sparsistent Algorithms8 Feb 2022
- 2021Inference for Heteroskedastic PCA with Missing Data26 Jul 2021