相关论文: Fluctuation of the Largest Eigenvalue of a Kernel …

We perform a study on kernel regression for large-dimensional data (where the sample size $n$ is polynomially depending on the dimension $d$ of the samples, i.e., $n\asymp d^{\gamma}$ for some $\gamma >0$ ). We first build a general tool to…

We study the eigenvalue behaviour of large complex correlated Wishart matrices near an interior point of the limiting spectrum where the density vanishes (cusp point), and refine the existing results at the hard edge as well. More…

Random K-out graphs are garnering interest in designing distributed systems including secure sensor networks, anonymous crypto-currency networks, and differentially-private decentralized learning. In these security-critical applications, it…

We study unitary random matrix ensembles in the critical regime where a new cut arises away from the original spectrum. We perform a double scaling limit where the size of the matrices tends to infinity, but in such a way that only a…

Graph neural networks (GNNs) have demonstrated great success in representation learning for graph-structured data. The layer-wise graph convolution in GNNs is shown to be powerful at capturing graph topology. During this process, GNNs are…

In this work, we study a class of random matrices which interpolate between the Wigner matrix model and various types of patterned random matrices such as random Toeplitz, Hankel, and circulant matrices. The interpolation mechanism is…

We compute the limiting eigenvalue statistics at the edge of the spectrum of large Hermitian random matrices perturbed by the addition of small rank deterministic matrices. To be more precise, we consider random Hermitian matrices with…

We study the eigenvector mass distribution for generalized Wigner matrices on a set of coordinates $I$, where $N^\varepsilon \le | I | \le N^{1- \varepsilon}$, and prove it converges to a Gaussian at every energy level, including the edge,…

We study the eigenvalue distributions of the Conjugate Kernel and Neural Tangent Kernel associated to multi-layer feedforward neural networks. In an asymptotic regime where network width is increasing linearly in sample size, under random…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

Expressiveness and generalization of deep models was recently addressed via the connection between neural networks (NNs) and kernel learning, where first-order dynamics of NN during a gradient-descent (GD) optimization were related to…

For each $N\geq 1$, let $G_N$ be a simple random graph on the set of vertices $[N]=\{1,2, ..., N\}$, which is invariant by relabeling of the vertices. The asymptotic behavior as $N$ goes to infinity of correlation functions: $$ \mathfrak…

In this paper we study the diameter of Inhomogeneous random graphs $G(n,\kappa,p)$ that are induced by irreducible kernels $\kappa$. The kernels we consider act on separable metric spaces and are almost everywhere continuous. We generalize…

We study the risk of minimum-norm interpolants of data in Reproducing Kernel Hilbert Spaces. Our upper bounds on the risk are of a multiple-descent shape for the various scalings of $d = n^{\alpha}$, $\alpha\in(0,1)$, for the input…

For a graph $G$, the spectral radius $\lambda_{1}(G)$ of $G$ is the largest eigenvalue of its adjacency matrix. An odd wheel $W_{2k+1}$ with $k\geq2$ is a graph obtained from a cycle of order $2k$ by adding a new vertex connecting to all…

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…

We present a unified framework to study graph kernels, special cases of which include the random walk graph kernel \citep{GaeFlaWro03,BorOngSchVisetal05}, marginalized graph kernel \citep{KasTsuIno03,KasTsuIno04,MahUedAkuPeretal04}, and…

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…

Let $G$ be a graph with adjacency matrix $A(G)$ and degree diagonal matrix $D (G)$. In 2017, Nikiforov defined the matrix $A_\alpha(G) = \alpha D(G) + (1-\alpha)A(G)$ for any real $\alpha\in[0,1]$. The largest eigenvalue of $A_\alpha(G)$ is…

This article characterizes the exact asymptotics of random Fourier feature (RFF) regression, in the realistic setting where the number of data samples $n$, their dimension $p$, and the dimension of feature space $N$ are all large and…