English
Related papers

Related papers: Wasserstein-p Bounds in the Central Limit Theorem …

200 papers

Random measures provide flexible parameters for Bayesian nonparametric models. Given two different priors for a random measure, we develop a natural framework to investigate the rate at which the corresponding posteriors merge, as the…

Statistics Theory · Mathematics 2025-09-17 Marta Catalano , Hugo Lavenant

We establish general upper bounds on the Kolmogorov distance between two probability distributions in terms of the distance between these distributions as measured with respect to the Wasserstein or smooth Wasserstein metrics. These bounds…

Probability · Mathematics 2023-01-02 Robert E. Gaunt , Siqi Li

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 derive central limit theorems for the Wasserstein distance between the empirical distributions of Gaussian samples. The cases are distinguished whether the underlying laws are the same or different. Results are based on the (quadratic)…

Statistics Theory · Mathematics 2016-02-22 Thomas Rippl , Axel Munk , Anja Sturm

We give some rates of convergence in the distances of Kolmogorov and Wasserstein for standardized martingales with differences having finite variances. For the Kolmogorov distances, we present some exact Berry-Esseen bounds for martingales,…

Probability · Mathematics 2023-09-18 Xiequan Fan , Zhonggen Su

We study nonparametric density estimation problems where error is measured in the Wasserstein distance, a metric on probability distributions popular in many areas of statistics and machine learning. We give the first minimax-optimal rates…

Statistics Theory · Mathematics 2020-04-30 Jonathan Niles-Weed , Quentin Berthet

Based on Stein's method, we derive upper bounds for Poisson process approximation in the $L_1$-Wasserstein metric $d_2^{(p)}$, which is based on a slightly adapted $L_p$-Wasserstein metric between point measures. For the case $p=1$, this…

Probability · Mathematics 2009-06-12 Dominic Schuhmacher

We propose a new statistical model, the spiked transport model, which formalizes the assumption that two probability distributions differ only on a low-dimensional subspace. We study the minimax rate of estimation for the Wasserstein…

Statistics Theory · Mathematics 2019-09-18 Jonathan Niles-Weed , Philippe Rigollet

It was shown in [6] that the Wasserstein distance is equivalent to the Mean Optimal Sub-Pattern Assignment (MOSPA) measure for empirical probability density functions. A more recent paper [7], extends on it by drawing new connections…

Statistics Theory · Mathematics 2016-12-21 Gabriel M. Lipsa , Marco Guerriero

In this paper, we give explicit rates in the central limit theorem and in the almost sure invariance principle for general R d-valued cocycles that appear in the study of the left random walk on linear groups. Our method of proof lies on a…

Probability · Mathematics 2019-09-19 Christophe Cuny , Jérôme Dedecker , Florence Merlevède

We quantify, uniformly over time and with high probability, the discrepancy between the predictions of a two-layer neural network trained by stochastic gradient descent (SGD) and their mean-field limit, for quadratic loss and ridge…

Neural and Evolutionary Computing · Computer Science 2026-03-03 Arnaud Guillin , Boris Nectoux , Paul Stos

This paper studies distributional model risk in marginal problems, where each marginal measure is assumed to lie in a Wasserstein ball centered at a fixed reference measure with a given radius. Theoretically, we establish several…

Optimization and Control · Mathematics 2023-07-04 Yanqin Fan , Hyeonseok Park , Gaoqian Xu

In $1946$, Mark Kac proved a Central Limit type theorem for a sequence of random variables that were not independent. The random variables under consideration were obtained from the angle-doubling map. The idea behind Kac's proof was to…

Probability · Mathematics 2025-04-04 Suprio Bhar , Ritwik Mukherjee , Prathmesh Patil

We establish various bounds on the solutions to a Stein equation for Poisson approximation in Wasserstein distance with non-linear transportation costs. The proofs are a refinement of those in [Barbour and Xia (2006)] using the results in…

Probability · Mathematics 2020-04-01 Zhong-Wei Liao , Yutao Ma , Aihua Xia

Minimising upper bounds on the population risk or the generalisation gap has been widely used in structural risk minimisation (SRM) -- this is in particular at the core of PAC-Bayesian learning. Despite its successes and unfailing surge of…

Machine Learning · Statistics 2023-10-30 Paul Viallard , Maxime Haddouche , Umut Şimşekli , Benjamin Guedj

We define a modified Wasserstein distance for distribution clustering which inherits many of the properties of the Wasserstein distance but which can be estimated easily and computed quickly. The modified distance is the sum of two terms.…

Methodology · Statistics 2018-12-31 Isabella Verdinelli , Larry Wasserman

We develop the theory of a metric, which we call the $\nu$-based Wasserstein metric and denote by $W_\nu$, on the set of probability measures $\mathcal P(X)$ on a domain $X \subseteq \mathbb{R}^m$. This metric is based on a slight…

Optimization and Control · Mathematics 2022-09-16 Luca Nenna , Brendan Pass

This article derives quantitative limit theorems for multivariate Poisson and Poisson process approximations. Employing the solution of Stein's equation for Poisson random variables, we obtain an explicit bound for the multivariate Poisson…

Probability · Mathematics 2021-06-01 Federico Pianoforte , Riccardo Turin

This paper introduces Wasserstein variational inference, a new form of approximate Bayesian inference based on optimal transport theory. Wasserstein variational inference uses a new family of divergences that includes both f-divergences and…

We prove a quantitative local limit theorem for the number of descents in a random permutation. Our proof uses a conditioning argument and is based on bounding the characteristic function $\phi(t)$ of the number of descents. We also…

Probability · Mathematics 2019-01-23 Bryce Cai , Annie Chen , Ben Heller , Eyob Tsegaye