Related papers: On the Convergence of Random Tridiagonal Matrices …
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
Given a large, high-dimensional sample from a spiked population, the top sample covariance eigenvalue is known to exhibit a phase transition. We show that the largest eigenvalues have asymptotic distributions near the phase transition in…
We give a stochastic comparison and ordering of the largest eigenvalues, with parameter $\beta$, for Hermite $\beta$-ensembles and Laguerre $\beta$-ensembles. Although stochastic comparison results are well known in Laguerre ensembles (for…
In this paper, we consider tridiagonal matrices the eigenvalues of which evolve according to $\beta$-Dyson Brownian motion. This is the stochastic gradient flow on $\mathbb{R}^n$ given by, for all $1 \leq i \leq n,$ \[ d\lambda_{i,t} =…
The wonderful formulas by I.Dumitriu and A.Edelman rewrite $\beta$-ensemble, with eigenvalue integrals containing Vandermonde factors in the power $2\beta$, through integrals over tridiagonal matrices, where $\beta$-dependent are the powers…
We introduce two families of random tridiagonal block matrices for which the joint eigenvalue distributions can be computed explicitly. These distributions are novel within random matrix theory, and exhibit interactions among eigenvalue…
We study the semigroups of random Schr\"odinger operators of the form $\widehat{H}f=-\frac12f''+(V+\xi)f$, where $f:I\to\mathbb F^r$ ($\mathbb F=\mathbb R,\mathbb C,\mathbb H$) are vector-valued functions on a possibly infinite interval…
We study the singular values of certain triangular random matrices. When their elements are i.i.d. standard complex Gaussian random variables, the squares of the singular values form a biorthogonal ensemble, and with an appropriate change…
We present a five-step method for the calculation of eigenvalue correlation functions for various ensembles of real random matrices, based upon the method of (skew-) orthogonal polynomials. This scheme systematises existing methods and also…
For min-max optimization and variational inequalities problems (VIP) encountered in diverse machine learning tasks, Stochastic Extragradient (SEG) and Stochastic Gradient Descent Ascent (SGDA) have emerged as preeminent algorithms. Constant…
We introduce deterministic perturbation schemes for the recently proposed random directions stochastic approximation (RDSA) [17], and propose new first-order and second-order algorithms. In the latter case, these are the first second-order…
We prove universality at the edge of the spectrum for unitary (beta=2), orthogonal (beta=1) and symplectic (beta=4) ensembles of random matrices in the scaling limit for a class of weights w(x)=exp(-V(x)) where V is a polynomial,…
Dzhaparidze and Spreij [5] showed that the quadratic variation of a semimartingale can be approximated using a randomized periodogram. We show that the same approximation is valid for a special class of continuous stochastic processes. This…
We prove the existence of a 1/N expansion to all orders in beta matrix models with a confining, off-critical potential corresponding to an equilibrium measure with a connected support. Thus, the coefficients of the expansion can be obtained…
Recent developments [Kamenev and Mezard, cond-mat/9901110, cond-mat/9903001; Yurkevich and Lerner, cond-mat/9903025; Zirnbauer, cond-mat/9903338] have revived a discussion about applicability of the replica approach to description of…
We study the convergence of a random iterative sequence of a family of operators on infinite dimensional Hilbert spaces, inspired by the Stochastic Gradient Descent (SGD) algorithm in the case of the noiseless regression, as studied in [1].…
There has been much recent interest, initiated by work of the physicists Hatano and Nelson, in the eigenvalues of certain random non-Hermitian periodic tridiagonal matrices and their bidiagonal limits. These eigenvalues cluster along a…
We investigate the Randomized Stochastic Accelerated Gradient (RSAG) method, utilizing either constant or adaptive step sizes, for stochastic optimization problems with generalized smooth objective functions. Under relaxed affine variance…
The first paper in this series introduced a new approach to strong convergence of random matrices that is based primarily on soft arguments. This method was applied to achieve a refined qualitative and quantitative understanding of strong…
A fundamental question in random matrix theory is to quantify the optimal rate of convergence to universal laws. We take up this problem for the Laguerre $\beta$ ensemble, characterised by the Dyson parameter $\beta$, and the Laguerre…