Matrices with Gaussian noise: optimal estimates for singular subspace perturbation
Not on the map. Why?
Abstract (arXiv)
The Davis-Kahan-Wedin sin Theta theorem describes how the singular subspaces of a matrix change when subjected to a small perturbation. This classic result is sharp in the worst case scenario. In this paper, we prove a stochastic version of the Davis-Kahan-Wedin sin Theta theorem when the perturbation is a Gaussian random matrix. Under certain structural assumptions, we obtain an optimal bound that significantly improves upon the classic Davis-Kahan-Wedin sin Theta theorem. One of our key tools is a new perturbation bound for the singular values, which may be of independent interest.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Mar 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 4; 2026: 1.
6 papers.
- 2023Enhancing Accuracy in Deep Learning Using Random Matrix Theorycited by 5
- 2025Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacycited by 3
- 2025S3LoRA: Safe Spectral Sharpness-Guided Pruning in Adaptation of Agent Plannercited by 1
- 2025Perturbation Bounds for Low-Rank Inverse Approximations under Noisecited by 1
- 2025Countering Multi-modal Representation Collapse through Rank-targeted Fusioncited by 1
- 2026Improved Guarantees for Heterogeneous Treatment-Effect Estimation via Matrix Completioncited by 0
- 2026Improved Guarantees for Heterogeneous Treatment-Effect Estimation via Matrix Completion28 May 2026
- 2025Countering Multi-modal Representation Collapse through Rank-targeted Fusion9 Nov 2025
- 2025Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacy29 Oct 2025
- 2025Perturbation Bounds for Low-Rank Inverse Approximations under Noise29 Oct 2025
- 2025S3LoRA: Safe Spectral Sharpness-Guided Pruning in Adaptation of Agent Planner20 Aug 2025
- 2023Enhancing Accuracy in Deep Learning Using Random Matrix Theory4 Oct 2023