English

Matrices with Gaussian noise: optimal estimates for singular subspace perturbation

Machine Learning 2024-01-01 v3 Information Theory Machine Learning math.IT Probability

Abstract

The Davis-Kahan-Wedin sinΘ\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Θ\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Θ\sin \Theta theorem. One of our key tools is a new perturbation bound for the singular values, which may be of independent interest.

Cite

@article{arxiv.1803.00679,
  title  = {Matrices with Gaussian noise: optimal estimates for singular subspace perturbation},
  author = {Sean O'Rourke and Van Vu and Ke Wang},
  journal= {arXiv preprint arXiv:1803.00679},
  year   = {2024}
}

Comments

Final version. Accepted by IEEE Transactions on Information Theory

R2 v1 2026-06-23T00:38:56.242Z