English
Related papers

Related papers: Matrix Deviation Inequality for $\ell_{p}$-Norm

200 papers

We establish large deviations estimates for the largest eigenvalue of Wigner matrices with sub-Gaussian entries. Under technical assumptions, we show that the large deviation behavior of the largest eigenvalue is universal for small…

Probability · Mathematics 2023-03-01 Fanny Augeri , Alice Guionnet , Jonathan Husson

Products of $M$ i.i.d. random matrices of size $N \times N$ are related to classical limit theorems in probability theory ($N=1$ and large $M$), to Lyapunov exponents in dynamical systems (finite $N$ and large $M$), and to universality in…

Probability · Mathematics 2022-12-19 Dang-Zheng Liu , Dong Wang , Yanhui Wang

In a noiseless linear estimation problem, one aims to reconstruct a vector x* from the knowledge of its linear projections y=Phi x*. There have been many theoretical works concentrating on the case where the matrix Phi is a random i.i.d.…

Machine Learning · Statistics 2020-01-22 Alia Abbara , Antoine Baker , Florent Krzakala , Lenka Zdeborová

We consider complex sample covariance matrices $M_N=\frac{1}{N}YY^*$ where $Y$ is a $N \times p$ random matrix with i.i.d. entries $Y_{ij}, 1\leq i\leq N, 1\leq j \leq p$ with distribution $F$. Under some regularity and decay assumption on…

Probability · Mathematics 2011-01-05 S. Péché

A remarkable property of Hermitian ensembles is their universal behavior, that is, once properly rescaled the eigenvalue statistics does not depend on particularities of the ensemble. Recently, normal matrix ensembles have attracted…

Mathematical Physics · Physics 2009-09-21 Alexei M. Veneziani , Tiago Pereira , Domingos H. U. Marchetti

In high-dimensional statistical inference, sparsity regularizations have shown advantages in consistency and convergence rates for coefficient estimation. We consider a generalized version of Sparse-Group Lasso which captures both…

Machine Learning · Statistics 2020-08-12 Xinyu Zhang

We prove two universality results for random tensors of arbitrary rank D. We first prove that a random tensor whose entries are N^D independent, identically distributed, complex random variables converges in distribution in the large N…

Probability · Mathematics 2013-05-07 Razvan Gurau

We consider the spectrum of additive, polynomially vanishing random perturbations of deterministic matrices, as follows. Let $M_N$ be a deterministic $N\times N$ matrix, and let $G_N$ be a complex Ginibre matrix. We consider the matrix…

Probability · Mathematics 2018-12-17 Anirban Basak , Elliot Paquette , Ofer Zeitouni

Gaussian universality results assert that the properties of many estimators remain unchanged when the input data are replaced by Gaussians. Such results have gained popularity in high-dimensional statistics and machine learning, as…

Probability · Mathematics 2025-12-03 Kevin Han Huang , Morgane Austern , Peter Orbanz

We present a simple solution to a question posed by Candes, Romberg and Tao on the uniform uncertainty principle for Bernoulli random matrices. More precisely, we show that a rectangular k*n random subgaussian matrix (with k < n) has the…

Statistics Theory · Mathematics 2007-06-13 Shahar Mendelson , Alain Pajor , Nicole Tomczak-Jaegermann

We present a large deviation principle at speed N for the largest eigenvalue of some additively deformed Wigner matrices. In particular this includes Gaussian ensembles with full-rank general deformation. For the non-Gaussian ensembles, the…

Probability · Mathematics 2023-03-22 Benjamin McKenna

We prove a universality theorem for learning with random features. Our result shows that, in terms of training and generalization errors, a random feature model with a nonlinear activation function is asymptotically equivalent to a…

Information Theory · Computer Science 2022-11-01 Hong Hu , Yue M. Lu

We study the universality of the local eigenvalue statistics of Gaussian divisible Hermitian Wigner matrices. These random matrices are obtained by adding an independent GUE matrix to an Hermitian random matrix with independent elements, a…

Probability · Mathematics 2011-04-08 Kurt Johansson

While classical in many theoretical settings - and in particular in statistical physics-inspired works - the assumption of Gaussian i.i.d. input data is often perceived as a strong limitation in the context of statistics and machine…

Machine Learning · Statistics 2024-07-22 Federica Gerace , Florent Krzakala , Bruno Loureiro , Ludovic Stephan , Lenka Zdeborová

We study the distribution of the {\it matrix product} $G_1 G_2 \cdots G_r$ of $r$ independent Gaussian matrices of various sizes, where $G_i$ is $d_{i-1} \times d_i$, and we denote $p = d_0$, $q = d_r$, and require $d_1 = d_{r-1}$. Here the…

Probability · Mathematics 2021-08-24 Yi Li , David P. Woodruff

We study the universality of the eigenvalue statistics of the covariance matrices $\frac{1}{n}M^* M$ where $M$ is a large $p\times n$ matrix obeying condition $\bf{C1}$. In particular, as an application, we prove a variant of universality…

Probability · Mathematics 2012-05-27 Ke Wang

We consider symmetric and Hermitian random matrices whose entries are independent and symmetric random variables with an arbitrary variance pattern. Under a novel Short-to-Long Mixing condition, which is sharp in the sense that it precludes…

Probability · Mathematics 2025-11-12 Dang-Zheng Liu , Guangyi Zou

This note demonstrates that it is possible to bound the expectation of an arbitrary norm of a random matrix drawn from the Stiefel manifold in terms of the expected norm of a standard Gaussian matrix with the same dimensions. A related…

Probability · Mathematics 2014-04-29 Joel A. Tropp

We establish, under a moment matching hypothesis, the local universality of the correlation functions associated with products of $M$ independent iid random matrices, as $M$ is fixed, and the sizes of the matrices tend to infinity. This…

Probability · Mathematics 2019-04-25 Phil Kopel , Sean O'Rourke , Van Vu

It has been observed that the performances of many high-dimensional estimation problems are universal with respect to underlying sensing (or design) matrices. Specifically, matrices with markedly different constructions seem to achieve…

Information Theory · Computer Science 2023-07-24 Rishabh Dudeja , Subhabrata Sen , Yue M. Lu