Related papers: Large Representation Recurrences in Large N Random…
We study the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of $n$ random points in a compact set $\Omega_n$ of $\R^d$. Under various assumptions we establish the…
Recent work on mutation-selection models has revealed that, under specific assumptions on the fitness function and the mutation rates, asymptotic estimates for the leading eigenvalue of the mutation-reproduction matrix may be obtained…
Number theorists have studied extensively the connections between the distribution of zeros of the Riemann $\zeta$-function, and of some generalizations, with the statistics of the eigenvalues of large random matrices. It is interesting to…
In this article, we study high-dimensional behavior of empirical spectral distributions $\{L_N(t), t\in[0,T]\}$ for a class of $N\times N$ symmetric/Hermitian random matrices, whose entries are generated from the solution of stochastic…
In reinforcement learning, state representations are used to tractably deal with large problem spaces. State representations serve both to approximate the value function with few parameters, but also to generalize to newly encountered…
In this paper, we use a new approach to prove that the largest eigenvalue of the sample covariance matrix of a normally distributed vector is bigger than the true largest eigenvalue with probability 1 when the dimension is infinite. We…
We reformulate the zero-dimensional hermitean one-matrix model as a (nonlocal) collective field theory, for finite~$N$. The Jacobian arising by changing variables from matrix eigenvalues to their density distribution is treated {\it…
We consider the problem of low-rank rectangular matrix completion in the regime where the matrix $M$ of size $n\times m$ is ``long", i.e., the aspect ratio $m/n$ diverges to infinity. Such matrices are of particular interest in the study of…
Random features models play a distinguished role in the theory of deep learning, describing the behavior of neural networks close to their infinite-width limit. In this work, we present a thorough analysis of the generalization performance…
We use the well-known isomorphism between operator algebras and function spaces equipped with a star product to study the asymptotic properties of certain matrix sequences in which the matrix dimension $D$ tends to infinity. Our approach is…
We present a large deviation property for the pattern statistics representing the number of occurrences of a symbol in words of given length generated at random according to a rational stochastic model. The result is obtained assuming that…
This work considers a computationally and statistically efficient parameter estimation method for a wide class of latent variable models---including Gaussian mixture models, hidden Markov models, and latent Dirichlet allocation---which…
Symmetric tridiagonal matrices appear ubiquitously in mathematical physics, serving as the matrix representation of discrete random Schr\"odinger operators. In this work we investigate the top eigenvalue of these matrices in the large…
The maximum (or minimum) generalized eigenvalue of symmetric positive semidefinite matrices that depend on optimization variables often appears as objective or constraint functions in structural topology optimization when we consider…
For products $P_N$ of $N$ random matrices of size $d \times d$, there is a natural notion of finite $N$ Lyapunov exponents $\{\mu_i\}_{i=1}^d$. In the case of standard Gaussian random matrices with real, complex or real quaternion elements,…
We propose a new (theoretical) computational model for the study of massive data processing with limited computational resources. Our model measures the complexity of reading the very large data sets in terms of the data size N and analyzes…
Consider a $n\times n$ sparse non-Hermitian random matrix $X_n$ defined as the Hadamard product between a random matrix with centered independent and identically distributed entries and a sparse Bernoulli matrix with success probability…
Random matrix theory has played an important role in various areas of pure mathematics, mathematical physics, and machine learning. From a practical perspective of data science, input data are usually normalized prior to processing. Thus,…
The family of rank estimators, including Han's maximum rank correlation (Han, 1987) as a notable example, has been widely exploited in studying regression problems. For these estimators, although the linear index is introduced for…
The probability that there are $k$ real eigenvalues for an $n$ dimensional real random matrix is known. Here we study this for the case of products of independent random matrices. Relating the problem of the probability that the product of…