Related papers: New error bounds in multivariate normal approximat…

Let $(W,W')$ be an exchangeable pair. Assume that \[E(W-W'|W)=g(W)+r(W),\] where $g(W)$ is a dominated term and $r(W)$ is negligible. Let $G(t)=\int_0^tg(s)\,ds$ and define $p(t)=c_1e^{-c_0G(t)}$, where $c_0$ is a properly chosen constant…

Distributionally robust optimization has emerged as an attractive way to train robust machine learning models, capturing data uncertainty and distribution shifts. Recent statistical analyses have proved that generalization guarantees of…

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…

It is shown that under suitable regularity conditions, differential entropy is a Lipschitz functional on the space of distributions on $n$-dimensional Euclidean space with respect to the quadratic Wasserstein distance. Under similar…

We introduce a version of Stein's method of comparison of operators specifically tailored to the problem of bounding the Wasserstein-1 distance between continuous and discrete distributions on the real line. Our approach rests on a new…

We establish asymptotic upper and lower bounds for the Wasserstein distance of any order $p\ge 1$ between the empirical measure of a fractional Brownian motion on a flat torus and the uniform Lebesgue measure. Our inequalities reveal an…

Using Chen-Stein method in combination with size-biased couplings, we obtain the multivariate Poisson approximation in terms of the Wasserstein distance. As applications, we study the multivariate Poisson approximation of the distribution…

This paper deals with bilateral-gamma (BG) approximation to functionals of an isonormal Gaussian process. We use Malliavin-Stein method to obtain the error bounds for the smooth Wasserstein distance. As by-products, the error bounds for…

This paper introduces a comprehensive framework to adjust a discrete test statistic for improving its hypothesis testing procedure. The adjustment minimizes the Wasserstein distance to a null-approximating continuous distribution, tackling…

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 address the estimation problem for general finite mixture models, with a particular focus on the elliptical mixture models (EMMs). Compared to the widely adopted Kullback-Leibler divergence, we show that the Wasserstein distance provides…

In this article we propose a general framework for normal approximation using Stein's method. We introduce the new concept of Stein couplings and we show that it lies at the heart of popular approaches such as the local approach,…

The Wasserstein distance between mixing measures has come to occupy a central place in the statistical analysis of mixture models. This work proposes a new canonical interpretation of this distance and provides tools to perform inference on…

We establish new lower bounds for the normal approximation in the Wasserstein distance of random variables that are functionals of a Poisson measure. Our results generalize previous findings by Nourdin and Peccati (2012, 2015) and Bierm\'e,…

We investigate the Wasserstein distance between the empirical spectral distribution of non-Hermitian random matrices and the Circular Law. For general entry distributions, we obtain a nearly optimal rate of convergence in 1-Wasserstein…

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…

This work presents several expected generalization error bounds based on the Wasserstein distance. More specifically, it introduces full-dataset, single-letter, and random-subset bounds, and their analogues in the randomized subsample…

The maximum mean discrepancy and Wasserstein distance are popular distance measures between distributions and play important roles in many machine learning problems such as metric learning, generative modeling, domain adaption, and…

We consider a Markov chain on $\mathbb{R}^d$ with invariant measure $\mu$. We are interested in the rate of convergence of the empirical measures towards the invariant measure with respect to various dual distances, including in particular…

This paper is concerned with minimax conditional independence testing. In contrast to some previous works on the topic, which use the total variation distance to separate the null from the alternative, here we use the Wasserstein distance.…