Related papers: Relative concentration bounds for the spectrum of …
We study the spectral aspects of the graph limit theory. We give a description of graphon convergence in terms of converegnce of eigenvalues and eigenspaces. Along these lines we prove a spectral version of the strong regularity lemma.…
We study the spectral properties of infinitely smooth multivariate kernel matrices when the nodes form a single cluster. We show that the geometry of the nodes plays an important role in the scaling of the eigenvalues of these kernel…
We show that, under mild assumptions, the spectrum of a sum of independent random matrices is close to that of the Gaussian random matrix whose entries have the same mean and covariance. This nonasymptotic universality principle yields…
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…
Non-Hermitian random matrices with statistical spectral characteristics beyond the standard Ginibre ensembles have recently emerged in the description of dissipative quantum many-body systems as well as in non-ergodic wave transport in…
Kernel matrices, as well as weighted graphs represented by them, are ubiquitous objects in machine learning, statistics and other related fields. The main drawback of using kernel methods (learning and inference using kernel matrices) is…
This paper develops nonasymptotic growth and concentration bounds for a product of independent random matrices. These results sharpen and generalize recent work of Henriksen-Ward, and they are similar in spirit to the results of…
A kernel method is proposed to estimate the condensed density of the generalized eigenvalues of pencils of Hankel matrices whose elements have a joint noncentral Gaussian distribution with nonidentical covariance. These pencils arise when…
We investigate concentration properties of functions of random vectors with values in the discrete cube, satisfying the stochastic covering property (SCP) or the strong Rayleigh property (SRP). Our result for SCP measures include…
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and other kernel based learning algorithms. We extend this line…
We study the spectral convergence of compact, self-adjoint operators on a separable Hilbert space under operator norm perturbations, and derive asymptotic expansions for their eigenvalues and eigenprojections. Our analysis focuses on…
For the past 30 years or so, machine learning has stimulated a great deal of research in the study of approximation capabilities (expressive power) of a multitude of processes, such as approximation by shallow or deep neural networks,…
We show that correlation matrices with particular average and variance of the correlation coefficients have a notably restricted spectral structure. Applying geometric methods, we derive lower bounds for the largest eigenvalue and the…
In this paper, we investigate the eigenvalue distribution of a class of kernel random matrices whose $(i,j)$-th entry is $f(X_i,X_j)$ where $f$ is a symmetric function belonging to the Paley-Wiener space $\mathcal{B}_c$ and $(X_i)_{1\leq i…
Node embeddings map graph vertices into low-dimensional Euclidean spaces while preserving structural information. They are central to tasks such as node classification, link prediction, and signal reconstruction. A key goal is to design…
We investigate random matrices whose entries are obtained by applying a nonlinear kernel function to pairwise inner products between $n$ independent data vectors, drawn uniformly from the unit sphere in $\mathbb{R}^d$. This study is…
This paper studies the asymptotic spectral properties of a renormalized sample correlation matrix, including the limiting spectral distribution, the properties of largest eigenvalues, and the central limit theorem for linear spectral…
The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…
This paper derives exponential tail bounds and polynomial moment inequalities for the spectral norm deviation of a random matrix from its mean value. The argument depends on a matrix extension of Stein's method of exchangeable pairs for…
We present a concentration result concerning random weighted projections in high dimensional spaces. As applications, we prove (1) New concentration inequalities for random quadratic forms; (2) The infinity norm of most unit eigenvectors of…