Related papers: Universality for the conjugate gradient and MINRES…

Several problems in machine learning, statistics, and other fields rely on computing eigenvectors. For large scale problems, the computation of these eigenvectors is typically performed via iterative schemes such as subspace iteration or…

This paper is concerned with the limiting spectral behaviors of large dimensional Kendall's rank correlation matrices generated by samples with independent and continuous components. We do not require the components to be identically…

We prove central limit theorem for linear eigenvalue statistics of orthogonally invariant ensembles of random matrices with one interval limiting spectrum. We consider ensembles with real analytic potentials and test functions with two…

We prove quenched versions of (i) a large deviations principle (LDP), (ii) a central limit theorem (CLT), and (iii) a local central limit theorem (LCLT) for non-autonomous dynamical systems. A key advance is the extension of the spectral…

We present an alternative procedure to eliminate irregular contributions in the perturbation expansion of c=0-matrix models representing the sum over triangulations of random surfaces, thereby reproducing the results of Tutte [1] and Brezin…

This article deals with the conjugate gradient method on a Riemannian manifold with interest in global convergence analysis. The existing conjugate gradient algorithms on a manifold endowed with a vector transport need the assumption that…

This paper develops a quantitative version of de Jong's central limit theorem for homogeneous sums in a high-dimensional setting. More precisely, under appropriate moment assumptions, we establish an upper bound for the Kolmogorov distance…

We present a simple extension of Lindeberg's argument for the Central Limit Theorem to get a general invariance result. We apply the technique to prove results from random matrix theory, spin glasses, and maxima of random fields.

We prove a local central limit theorem (LCLT) for the number of points $N(J)$ in a region $J$ in $\mathbb R^d$ specified by a determinantal point process with an Hermitian kernel. The only assumption is that the variance of $N(J)$ tends to…

We take a unified approach to central limit theorems for a class of irreducible urn models with constant replacement matrix. Depending on the eigenvalue, we consider appropriate linear combinations of the number of balls of different…

We study the singular values (and Lyapunov exponents) for products of $N$ independent $n\times n$ random matrices with i.i.d. entries. Such matrix products have been extensively analyzed using free probability, which applies when $n\to…

Properties of universality have essential relevance for the theory of random matrices usually called the Wigner ensemble. The issue was analysed up to recent years with detailed and relevant results. We present a slightly different view and…

We derive the universality principle for empirical spectral distributions of sample covariance matrices and their Stieltjes transforms. This principle states the following. Suppose quadratic forms of random vectors $y_p$ in $R^p$ satisfy a…

When the CG method for solving linear algebraic systems was formulated about 70 years ago by Lanczos, Hestenes, and Stiefel, it was considered an iterative process possessing a mathematical finite termination property. CG was placed into a…

A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…

We study the adjacency matrix of the Linial-Meshulam complex model, which is a higher-dimensional generalization of the Erd\H{o}s-R\'enyi graph model. Recently, Knowles and Rosenthal proved that the empirical spectral distribution of the…

We study the quantitative simplicity of the Lyapunov spectrum of $d$-dimensional bounded matrix cocycles subjected to additive random perturbations. In dimensions 2 and 3, we establish explicit lower bounds on the gaps between consecutive…

Conjugated gradients on the normal equation (CGNE) is a popular method to regularise linear inverse problems. The idea of the method can be summarised as minimising the residuum over a suitable Krylov subspace. It is shown that using the…

We prove a central limit theorem applicable to one dimensional stochastic approximation algorithms that converge to a point where the error terms of the algorithm do not vanish. We show how this applies to a certain class of these…

We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Least Squares stands out of well-known classical approaches as…