Related papers: Topics in Random Matrices and Statistical Machine …
Wishart matrices are one of the fundamental matrix models in multivariate statistics. We consider the classical $(m,n,\beta)$-Laguerre ensemble and give a necessary and sufficient condition for finite moments for the inverse of…
These lecture notes provide a comprehensive, self-contained introduction to the analysis of Wishart matrix moments. This study may act as an introduction to some particular aspects of random matrix theory, or as a self-contained exposition…
The four moment theorem asserts, roughly speaking, that the joint distribution of a small number of eigenvalues of a Wigner random matrix (when measured at the scale of the mean eigenvalue spacing) depends only on the first four moments of…
Given an $n$-sample of random vectors $(X_i,Y_i)_{1 \leq i \leq n}$ whose joint law is unknown, the long-standing problem of supervised classification aims to \textit{optimally} predict the label $Y$ of a given a new observation $X$. In…
Recently we considered a class of random matrices obtained by choosing distinct codewords at random from linear codes over finite fields and proved that under some natural algebraic conditions their empirical spectral distribution converges…
We discuss an application of the random matrix theory in the context of estimating the bipartite entanglement of a quantum system. We discuss how the Wishart ensemble (the earliest studied random matrix ensemble) appears in this quantum…
Consider the eigenvalues $\lambda_i(M_n)$ (in increasing order) of a random Hermitian matrix $M_n$ whose upper-triangular entries are independent with mean zero and variance one, and are exponentially decaying. By Wigner's semicircular law,…
We consider random matrices that have invariance properties under the action of unitary groups (either a left-right invariance, or a conjugacy invariance), and we give formulas for moments in terms of functions of eigenvalues. Our main tool…
For a random matrix following a Wishart distribution, we derive formulas for the expectation and the covariance matrix of compound matrices. The compound matrix of order $m$ is populated by all $m\times m$-minors of the Wishart matrix. Our…
We prove that the number of iterations required to solve a random positive definite linear system with the conjugate gradient algorithm is almost deterministic for large matrices. We treat the case of Wishart matrices $W = XX^*$ where $X$…
Let $W$ be a random positive definite symmetric matrix distributed according to a real Wishart distribution and let $W^{-1}=(W^{ij})_{i,j}$ be its inverse matrix. We compute general moments $\mathbb{E} [W^{k_1 k_2} W^{k_3 k_4} ...…
We analytically compute the large-deviation probability of a diagonal matrix element of two cases of random matrices, namely $\beta=[\vec H^\dagger\vec H]^{-1}_{11}$ and $\gamma=[\vec I_N+\rho\vec H^\dagger\vec H]^{-1}_{11}$, where $\vec H$…
We summarize significant classical results on (in)determinacy of measures in terms of their finite positive integer order moments. Well-known is the role of the smallest eigenvalues of Hankel matrices, starting from Hamburger's results a…
We provide an overview of recent progress in statistical inverse problems with random experimental design, covering both linear and nonlinear inverse problems. Different regularization schemes have been studied to produce robust and stable…
Consider a real matrix $\Theta$ consisting of rows $(\theta_{i,1},\ldots,\theta_{i,n})$, for $1\leq i\leq m$. The problem of making the system linear forms $x_{1}\theta_{i,1}+\cdots+x_{n}\theta_{i,n}-y_{i}$ for integers $x_{j},y_{i}$ small…
We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…
The purpose of this paper is to give a selective survey on recent progress in random metric theory and its applications to conditional risk measures. This paper includes eight sections. Section 1 is a longer introduction, which gives a…
The speed with which a learning algorithm converges as it is presented with more data is a central problem in machine learning --- a fast rate of convergence means less data is needed for the same level of performance. The pursuit of fast…
Given a matrix $A$, a linear feasibility problem (of which linear classification is a special case) aims to find a solution to a primal problem $w: A^Tw > \textbf{0}$ or a certificate for the dual problem which is a probability distribution…
We study the problem of finding the global Riemannian center of mass of a set of data points on a Riemannian manifold. Specifically, we investigate the convergence of constant step-size gradient descent algorithms for solving this problem.…