English
Related papers

Related papers: Wasserstein-2 bounds in normal approximation under…

200 papers

Let $(M^n,g,f)$ be a Ricci shrinker such that $\textrm{Ric}_f=\frac{1}{2}g$ and the measure induced by the weighted volume element $(4\pi)^{-\frac{n}{2}}e^{-f}dv_{g}$ is a probability measure. Given a point $p\in M$, we consider two…

Differential Geometry · Mathematics 2023-09-29 Franciele Conrado , Detang Zhou

By a delicate analysis for the Stein's equation associated to the $\alpha$-stable law approximation with $\alpha \in (0,2)$, we prove a quantitative stable central limit theorem in Wasserstein type distance, which generalizes the results in…

Probability · Mathematics 2023-01-26 Peng Chen , Ivan Nourdin , Lihu Xu , Xiaochuan Yang

Let $\pi\in \Pi(\mu,\nu)$ be a coupling between two probability measures $\mu$ and $\nu$ on a Polish space. In this article we propose and study a class of nonparametric measures of association between $\mu$ and $\nu$, which we call…

Statistics Theory · Mathematics 2021-11-05 Johannes Wiesel

We extend PAC-Bayesian theory to generative models and develop generalization bounds for models based on the Wasserstein distance and the total variation distance. Our first result on the Wasserstein distance assumes the instance space is…

Machine Learning · Computer Science 2023-11-15 Sokhna Diarra Mbacke , Florence Clerc , Pascal Germain

The Wasserstein metric is an important measure of distance between probability distributions, with applications in machine learning, statistics, probability theory, and data analysis. This paper provides upper and lower bounds on…

Statistics Theory · Mathematics 2019-11-11 Shashank Singh , Barnabás Póczos

In the density estimation model, we investigate the problem of constructing adaptive honest confidence sets with radius measured in Wasserstein distance $W_p$, $p\geq1$, and for densities with unknown regularity measured on a Besov scale.…

Statistics Theory · Mathematics 2021-11-18 Neil Deo , Thibault Randrianarisoa

We obtain explicit Berry-Esseen bounds in the Kolmogorov distance for the normal approximation of non-linear functionals of vectors of independent random variables. Our results are based on the use of Stein's method and of random difference…

Probability · Mathematics 2015-05-19 Raphaël Lachièze-Rey , Giovanni Peccati

The paper gives the bounds on the solutions to a Stein equation for the negative binomial distribution that are needed for approximation in terms of the Wasserstein metric. The proofs are probabilistic, and follow the approach introduced in…

Probability · Mathematics 2015-06-02 A. D. Barbour , H. L. Gan , A. Xia

This short note is on a property of the $\mathcal{W}_2$ Wasserstein distance which indicates that independent elliptical distributions minimize their $\mathcal{W}_2$ Wasserstein distance from given independent elliptical distributions with…

Statistics Theory · Mathematics 2020-12-08 Song Fang , Quanyan Zhu

We study the weighted total variation distance between probability measures. Using Fourier-analytic tools, we present estimates in terms of Wasserstein distances between the respective probabilities, under appropriate smoothness and moment…

Probability · Mathematics 2025-06-23 Iván Ivkovic , Miklós Rásonyi

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 study the problem of sampling from a probability distribution $\pi$ on $\rset^d$ which has a density \wrt\ the Lebesgue measure known up to a normalization factor $x \mapsto \rme^{-U(x)} / \int_{\rset^d} \rme^{-U(y)} \rmd y$. We analyze…

Statistics Theory · Mathematics 2019-09-17 M. Barkhagen , N. H. Chau , É. Moulines , M. Rásonyi , S. Sabanis , Y. Zhang

We propose a variational approach to approximate measures with measures uniformly distributed over a 1 dimentional set. The problem consists in minimizing a Wasserstein distance as a data term with a regularization given by the length of…

Analysis of PDEs · Mathematics 2024-10-17 Antonin Chambolle , Vincent Duval , Joao Miguel Machado

We show how the infinitesimal exchangeable pairs approach to Stein's method combines naturally with the theory of Markov semigroups. We present a multivariate normal approximation theorem for functions of a random variable invariant with…

Probability · Mathematics 2025-10-01 David Grzybowski , Mark Meckes

In this paper we provide explicit upper bounds on some distances between the (law of the) output of a random Gaussian NN and (the law of) a random Gaussian vector. Our results concern both shallow random Gaussian neural networks with…

Covariate shift arises when covariate distributions differ between source and target populations while the conditional distribution of the response remains invariant, and it underlies problems in missing data and causal inference. We…

Methodology · Statistics 2026-01-13 Junjun Lang , Qiong Zhang , Yukun Liu

In this paper we characterize the so called uniformly rectifiable sets of David and Semmes in terms of the Wasserstein distance $W_2$ from optimal mass transport. To obtain this result, we first prove a localization theorem for the distance…

Classical Analysis and ODEs · Mathematics 2011-08-30 Xavier Tolsa

In this paper, we establish sharp upper and lower bounds on the convergence rate of the empirical measures of point processes under the Wasserstein distance. To this end, we first introduce a new metric on the space of counting measures…

Statistics Theory · Mathematics 2026-04-28 Dongzhou Huang , Tianyi Jiang , Haonan Wang

The Wasserstein distance is a metric on a space of probability measures that has seen a surge of applications in statistics, machine learning, and applied mathematics. However, statistical aspects of Wasserstein distances are bottlenecked…

Probability · Mathematics 2022-03-02 Ziv Goldfeld , Kengo Kato , Sloan Nietert , Gabriel Rioux

We study a general framework of distributional computational graphs: computational graphs whose inputs are probability distributions rather than point values. We analyze the discretization error that arises when these graphs are evaluated…

Machine Learning · Statistics 2026-02-13 Olof Hallqvist Elias , Michael Selby , Phillip Stanley-Marbell