Sparse Pseudospectral Shattering
Rikhav Shah, Nikhil Srivastava, Edward Zeng

TL;DR
This paper demonstrates that sparse random perturbations can regularize the eigenvalues and eigenvectors of nonnormal matrices, similar to dense perturbations, with implications for numerical stability in eigenvalue problems.
Contribution
It shows that adding sparse Gaussian noise to matrices achieves eigenvalue and eigenvector regularization comparable to dense noise, improving stability analysis techniques.
Findings
Sparse perturbations of size O(n log^2 n) regularize eigenvalues and eigenvectors.
Sparse perturbations of size O(n^{1+α}) achieve logarithmic condition numbers.
Reduction of the problem to least singular value estimates of shifted matrices.
Abstract
The eigenvalues and eigenvectors of nonnormal matrices can be unstable under perturbations of their entries. This renders an obstacle to the analysis of numerical algorithms for non-Hermitian eigenvalue problems. A recent technique to handle this issue is pseudospectral shattering [BGVKS23], showing that adding a random perturbation to any matrix has a regularizing effect on the stability of the eigenvalues and eigenvectors. Prior work has analyzed the regularizing effect of dense Gaussian perturbations, where independent noise is added to every entry of a given matrix [BVKS20, BGVKS23, BKMS21, JSS21]. We show that the same effect can be achieved by adding a sparse random perturbation. In particular, we show that given any matrix of polynomially bounded norm: (a) perturbing random entries of by adding i.i.d. complex Gaussians yields…
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.
