English
Related papers

Related papers: The discrepancy in min-max statistics between two …

200 papers

Recent work in machine learning community proposed multiple methods for performing lossy compression (quantization) of large matrices. This quantization is important for accelerating matrix multiplication (main component of large language…

Information Theory · Computer Science 2025-10-16 Or Ordentlich , Yury Polyanskiy

We develop a new technique, based on Stein's method, for comparing two stationary distributions of irreducible Markov Chains whose update rules are `close enough'. We apply this technique to compare Ising models on $d$-regular expander…

Probability · Mathematics 2018-09-18 Guy Bresler , Dheeraj M. Nagaraj

If only limited control over a multiparticle quantum system is available, a viable method to characterize correlations is to perform random measurements and consider the moments of the resulting probability distribution. We present…

Quantum Physics · Physics 2021-04-23 Satoya Imai , Nikolai Wyderka , Andreas Ketterer , Otfried Gühne

We prove multi-dimensional central limit theorems for the spectral moments (of arbitrary degrees) associated with random matrices with real-valued i.i.d. entries, satisfying some appropriate moment conditions. Our techniques rely on a…

Probability · Mathematics 2009-09-30 Ivan Nourdin , Giovanni Peccati

We develop a variant of Stein's method of comparison of generators to bound the Kolmogorov, total variation, and Wasserstein-1 distances between distributions on the real line. Our discrepancy is expressed in terms of the ratio of reverse…

Probability · Mathematics 2025-10-28 Paul Mansanarez , Guillaume Poly , Yvik Swan

We are concerned with obtaining novel concentration inequalities for the missing mass, i.e. the total probability mass of the outcomes not observed in the sample. We not only derive - for the first time - distribution-free Bernstein-like…

Machine Learning · Statistics 2015-06-22 Bahman Yari Saeed Khanloo , Gholamreza Haffari

This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…

Probability · Mathematics 2011-07-22 Alex Gittens , Joel A. Tropp

By exploiting the well-known observation that size-biasing or zero-biasing an infinitely divisible random variable may be achieved by adding an independent increment, combined with tools from Stein's method for compound Poisson and Gaussian…

Probability · Mathematics 2025-12-11 Fraser Daly

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…

Statistics Theory · Mathematics 2016-09-06 Benoit Collins , Sho Matsumoto , Nadia Saad

Using a modification of Stein's method, we generalize the results of Bentkus, G{\"o}tze, and Tikhomirov \cite{bentkus1997berry} to obtain Berry-Esseen bounds for a broad class of statistics of sequences of $\phi$-mixing, non-stationary…

Probability · Mathematics 2026-04-07 Brendan Williams , Yeor Hafouta

We obtain explicit error bounds for the $d$-dimensional normal approximation on hyperrectangles for a random vector that has a Stein kernel, or admits an exchangeable pair coupling, or is a non-linear statistic of independent random…

Probability · Mathematics 2020-09-08 Xiao Fang , Yuta Koike

We use Stein's method to bound the Wasserstein distance of order $2$ between a measure $\nu$ and the Gaussian measure using a stochastic process $(X_t)_{t \geq 0}$ such that $X_t$ is drawn from $\nu$ for any $t > 0$. If the stochastic…

Probability · Mathematics 2020-05-12 Thomas Bonis

We use tools from random matrix theory to study the multi-spiked tensor model, i.e., a rank-$r$ deformation of a symmetric random Gaussian tensor. In particular, thanks to the nature of local optimization methods used to find the maximum…

Statistics Theory · Mathematics 2025-03-06 Yang Qi , Alexis Decurninge

Consider the Klein-Gordon equation (KGE) in $\R^n$, $n\ge 2$, with constant or variable coefficients. We study the distribution $\mu_t$ of the random solution at time $t\in\R$. We assume that the initial probability measure $\mu_0$ has zero…

Mathematical Physics · Physics 2009-11-11 T. V. Dudnikova , A. I. Komech , E. A. Kopylova , Yu. M. Suhov

With ${\mathcal{Q}}_{q,n}$ the distribution of $n$ minus the rank of a matrix chosen uniformly from the collection of all $n\times(n+m)$ matrices over the finite field $\mathbb{F}_q$ of size $q\ge2$, and ${\mathcal{Q}}_q$ the distributional…

Probability · Mathematics 2015-05-15 Jason Fulman , Larry Goldstein

In this expository note, we give a modern proof of Hanson-Wright inequality for quadratic forms in sub-gaussian random variables. We deduce a useful concentration inequality for sub-gaussian random vectors. Two examples are given to…

Probability · Mathematics 2013-10-02 Mark Rudelson , Roman Vershynin

We prove a version of the multidimensional Fourth Moment Theorem for chaotic random vectors, in the general context of diffusion Markov generators. In addition to the usual componentwise convergence and unlike the infinite-dimensional…

Probability · Mathematics 2015-10-09 Simon Campese , Ivan Nourdin , Giovanni Peccati , Guillaume Poly

We define a novel class of distances between statistical multivariate distributions by modeling an optimal transport problem on their marginals with respect to a ground distance defined on their conditionals. These new distances are metrics…

Machine Learning · Computer Science 2020-11-03 Frank Nielsen , Ke Sun

This paper establishes sharp dimension-free concentration and expectation bounds for the deviation of a sample cross-covariance matrix from its mean. For sub-Gaussian random vectors, we prove a high-probability operator-norm bound governed…

Probability · Mathematics 2026-05-19 Jiaheng Chen , Daniel Sanz-Alonso

This paper proposes a new family of lower and upper bounds on the minimum mean squared error (MMSE). The key idea is to minimize/maximize the MMSE subject to the constraint that the joint distribution of the input-output statistics lies in…

Information Theory · Computer Science 2020-06-09 Michael Fauß , Alex Dysto , H. Vincent Poor