Related papers: An $\ell_{\infty}$ Eigenvector Perturbation Bound …

We consider the eigenvalues of a fixed, non-normal matrix subject to a small additive perturbation. In particular, we consider the case when the fixed matrix is a banded Toeplitz matrix, where the bandwidth is allowed to grow slowly with…

This paper develops a unified analytical framework for determinant identities under finite-rank perturbations of square matrices that remains valid without invertibility assumptions. In contrast to classical inverse-based formulations, the…

The vulnerability of machine learning models to adversarial perturbations has motivated a significant amount of research under the broad umbrella of adversarial machine learning. Sophisticated attacks may cause learning algorithms to learn…

Let $\Lambda$ be the limiting smallest eigenvalue in the general (\beta, a)-Laguerre ensemble of random matrix theory. Here \beta>0, a >-1; for \beta=1,2,4 and integer a, this object governs the singular values of certain rank n Gaussian…

One-rank perturbations of Wigner matrices have been closely studied: let $P=\frac{1}{\sqrt{n}}A+\theta vv^T$ with $A=(a_{ij})_{1 \leq i,j \leq n} \in \mathbb{R}^{n \times n}$ symmetric, $(a_{ij})_{1 \leq i \leq j \leq n}$ i.i.d. with…

This paper studies new tests for the number of latent factors in a large cross-sectional factor model with small time dimension. These tests are based on the eigenvalues of variance-covariance matrices of (possibly weighted) asset returns,…

We study improved approximations to the distribution of the largest eigenvalue $\hat{\ell}$ of the sample covariance matrix of $n$ zero-mean Gaussian observations in dimension $p+1$. We assume that one population principal component has…

This work is concerned with finite range bounds on the variance of individual eigenvalues of random covariance matrices, both in the bulk and at the edge of the spectrum. In a preceding paper, the author established analogous results for…

Simultaneous measurements of position and momentum are considered in $n$ dimensions. We find, that for a particle whose position is strictly localized in a compact domain $D\subset \mathbb{R}^n$ (spatial uncertainty) with non-empty…

Reliable and efficient computation of the pseudospectral abscissa in the large-scale setting is still not settled. Unlike the small-scale setting where there are globally convergent criss-cross algorithms, all algorithms in the large-scale…

This paper aims to address two fundamental challenges arising in eigenvector estimation and inference for a low-rank matrix from noisy observations: (1) how to estimate an unknown eigenvector when the eigen-gap (i.e. the spacing between the…

This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…

Although near-term quantum devices have no comprehensive solution for correcting errors, numerous techniques have been proposed for achieving practical value. Two works have recently introduced the very promising Error Suppression by…

A class of robust estimators of scatter applied to information-plus-impulsive noise samples is studied, where the sample information matrix is assumed of low rank; this generalizes the study of (Couillet et al., 2013b) to spiked random…

The concept of self-testing (or rigidity) refers to the fact that for certain Bell inequalities the maximal violation can be achieved in an essentially unique manner. In this work we present a family of Bell inequalities which are maximally…

Unlike the Standard Model (SM), supersymmetric models stabilize the electroweak (EW) scale $v$ at the quantum level and {\it predict} that $v$ is a function of the TeV-valued SUSY parameters ($\gamma_\alpha$) of the UV Lagrangian. We show…

Computing the eigenvectors and eigenvalues of a perturbed matrix can be remarkably difficult when the unperturbed matrix has repeated eigenvalues. In this work we show how the limiting eigenvectors and eigenvalues of a symmetric matrix…

We consider quite general $h$-pseudodifferential operators on $R^n$ with small random perturbations and show that in the limit of small $h$ the eigenvalues are distributed according to a Weyl law with a probabality that tends to 1. The…

We consider the forward problem of uncertainty quantification for the generalised Dirichlet eigenvalue problem for a coercive second order partial differential operator with random coefficients, motivated by problems in structural…

We prove a \emph{query complexity} lower bound on rank-one principal component analysis (PCA). We consider an oracle model where, given a symmetric matrix $M \in \mathbb{R}^{d \times d}$, an algorithm is allowed to make $T$ \emph{exact}…