English
Related papers

Related papers: Sharp High-dimensional Central Limit Theorems for …

200 papers

We prove that for $c>0$ a sufficiently small universal constant that a random set of $c d^2/\log^4(d)$ independent Gaussian random points in $\mathbb{R}^d$ lie on a common ellipsoid with high probability. This nearly establishes a…

Probability · Mathematics 2022-12-22 Daniel M. Kane , Ilias Diakonikolas

We prove optimal sampling bounds achieving $(1\pm\varepsilon)$-relative error for a broad class of Lipschitz continuous classification loss functions under various regularization terms. This includes important functions such as logistic and…

Machine Learning · Computer Science 2026-05-25 Meysam Alishahi , Alexander Munteanu , Simon Omlor , Jeff M. Phillips

In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability…

Information Theory · Computer Science 2013-02-28 Amir Ingber , Ram Zamir , Meir Feder

We consider the 2-dimensional random matching problem in $\mathbb{R}^2.$ In a challenging paper, Caracciolo et. al. arXiv:1402.6993 on the basis of a subtle linearization of the Monge Ampere equation, conjectured that the expected value of…

Mathematical Physics · Physics 2020-08-26 Dario Benedetto , Emanuele Caglioti

We present a way to use Stein's method in order to bound the Wasserstein distance of order $2$ between two measures $\nu$ and $\mu$ supported on $\mathbb{R}^d$ such that $\mu$ is the reversible measure of a diffusion process. In order to…

Probability · Mathematics 2018-06-25 Thomas Bonis

Consider an empirical measure $\mathbb{P}_n$ induced by $n$ iid samples from a $d$-dimensional $K$-subgaussian distribution $\mathbb{P}$ and let $\gamma = N(0,\sigma^2 I_d)$ be the isotropic Gaussian measure. We study the speed of…

Probability · Mathematics 2025-02-11 Adam Block , Zeyu Jia , Yury Polyanskiy , Alexander Rakhlin

We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…

Probability · Mathematics 2026-04-10 Steven Hoehner , Christoph Thäle

This work studies the convergence and finite sample approximations of entropic regularized Wasserstein distances in the Hilbert space setting. Our first main result is that for Gaussian measures on an infinite-dimensional Hilbert space,…

Machine Learning · Statistics 2021-02-16 Minh Ha Quang

We are interested in the Wasserstein distance between two probability measures on $\R^n$ sharing the same copula $C$. The image of the probability measure $dC$ by the vectors of pseudo-inverses of marginal distributions is a natural…

Probability · Mathematics 2013-07-17 Aurélien Alfonsi , Benjamin Jourdain

Score-based generative modeling, implemented through probability flow ODEs, has shown impressive results in numerous practical settings. However, most convergence guarantees rely on restrictive regularity assumptions on the target…

Machine Learning · Statistics 2025-10-21 Gitte Kremling , Francesco Iafrate , Mahsa Taheri , Johannes Lederer

We consider $n\times n$ random matrices $M_{n}=\sum_{\alpha =1}^{m}{\tau _{\alpha }}\mathbf{y}_{\alpha }\otimes \mathbf{y}_{\alpha }$, where $\tau _{\alpha }\in \mathbb{R}$, $\{\mathbf{y}_{\alpha }\}_{\alpha =1}^{m}$ are i.i.d. isotropic…

Probability · Mathematics 2013-12-02 O. Guédon , A. Lytova , A. Pajor , L. Pastur

Underdamped Langevin dynamics (ULD) is a widely-used sampler for Gibbs distributions $\pi\propto e^{-V}$, and is often empirically effective in high dimensions. However, existing non-asymptotic convergence guarantees for discretized ULD…

Machine Learning · Computer Science 2026-03-04 Shiyuan Zhang , Qiwei Di , Xuheng Li , Quanquan Gu

Score-based Generative Models (SGMs) aim to sample from a target distribution by learning score functions using samples perturbed by Gaussian noise. Existing convergence bounds for SGMs in the W2-distance rely on stringent assumptions about…

Machine Learning · Statistics 2025-12-12 Marta Gentiloni-Silveri , Antonio Ocello

We give a fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime. Suppose that the CSP has $n$ variables with domain size at most q, each constraint contains at most k…

Data Structures and Algorithms · Computer Science 2023-03-10 Kun He , Chunyang Wang , Yitong Yin

Let $\{X_{k,i};i\geq 1,k\geq 1\}$ be an array of i.i.d. random variables and let $\{p_n;n\geq 1\}$ be a sequence of positive integers such that $n/p_n$ is bounded away from 0 and $\infty$. For $W_n=\max_{1\leq i<j\leq…

Probability · Mathematics 2007-05-23 Deli Li , Andrew Rosalsky

Sampling from various kinds of distributions is an issue of paramount importance in statistics since it is often the key ingredient for constructing estimators, test procedures or confidence intervals. In many situations, the exact sampling…

Computation · Statistics 2016-12-06 Arnak S. Dalalyan

In a remarkable paper, Peter Hall [{\it On the rate of convergence of normal extremes}, J. App. Prob, {\bf 16} (1979) 433--439] proved that the supremum norm distance between the distribution function of the normalized maximum of $n$…

Probability · Mathematics 2013-08-27 Armengol Gasull , Maria Jolis , Frederic Utzet

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 study the problem of sampling from strongly log-concave distributions over $\mathbb{R}^d$ using the Poisson midpoint discretization (a variant of the randomized midpoint method) for overdamped/underdamped Langevin dynamics. We prove its…

Probability · Mathematics 2025-10-02 Rishikesh Srinivasan , Dheeraj Nagaraj

We study the dimensional Brunn-Minkowski inequality for even log-concave probability measures $\mu$ on $\mathbb{R}^n$ via an analytic approach based on diffusion operators and gradient estimates. Our main result asserts that for every pair…

Metric Geometry · Mathematics 2026-05-05 Alexandros Eskenazis , Apostolos Giannopoulos , Natalia Tziotziou