Related papers: The Wasserstein Distances Between Pushed-Forward M…

We introduce the Wasserstein Transform (WT), a general unsupervised framework for updating distance structures on given data sets with the purpose of enhancing features and denoising. Our framework represents each data point by a…

We study the Wasserstein distance $W_2$ for Gaussian samples. We establish the exact rate of convergence $\sqrt{\log\log n/n}$ of the expected value of the $W_2$ distance between the empirical and true $c.d.f.$'s for the normal…

Let $\mu$ be a doubling measure in $\mathbb{R}^n$. We investigate quantitative relations between the rectifiability of $\mu$ and its distance to flat measures. More precisely, for $x$ in the support $\Sigma$ of $\mu$ and $r > 0$, we…

Comparing metric measure spaces (i.e. a metric space endowed with aprobability distribution) is at the heart of many machine learning problems. The most popular distance between such metric measure spaces is theGromov-Wasserstein (GW)…

We present a framework that allows for the non-asymptotic study of the $2$-Wasserstein distance between the invariant distribution of an ergodic stochastic differential equation and the distribution of its numerical approximation in the…

Statistical models often include thousands of parameters. However, large models decrease the investigator's ability to interpret and communicate the estimated parameters. Reducing the dimensionality of the parameter space in the estimation…

We revisit Markowitz's mean-variance portfolio selection model by considering a distributionally robust version, where the region of distributional uncertainty is around the empirical measure and the discrepancy between probability measures…

Wasserstein gradient flows are continuous time dynamics that define curves of steepest descent to minimize an objective function over the space of probability measures (i.e., the Wasserstein space). This objective is typically a divergence…

Bayesian inference typically requires the computation of an approximation to the posterior distribution. An important requirement for an approximate Bayesian inference algorithm is to output high-accuracy posterior mean and uncertainty…

By a method inspired of the Stein's method, we derive an upper-bound of the Rubinstein distance between two absolutely continuous probability measures on configurations space. As an application, we show that the best way to approximate a…

This paper studies convergence behavior of latent mixing measures that arise in finite and infinite mixture models, using transportation distances (i.e., Wasserstein metrics). The relationship between Wasserstein distances on the space of…

Let $f: [0,1]^d \rightarrow \mathbb{R}$ be a continuous function with zero mean and interpret $f_{+} = \max(f, 0)$ and $f_{-} = -\min(f, 0)$ as the densities of two measures. We prove that if the cost of transport from $f_{+}$ to $f_{-}$ is…

We derive Wasserstein distance bounds between the probability distributions of a stochastic integral (It\^o) process with jumps $(X_t)_{t\in [0,T]}$ and a jump-diffusion process $(X^\ast_t)_{t\in [0,T]}$. Our bounds are expressed using the…

Stein's method has been widely used for probability approximations. However, in the multi-dimensional setting, most of the results are for multivariate normal approximation or for test functions with bounded second- or higher-order…

We use Wasserstein distances to characterize and study probabilistic frames. Adapting results from Olkin and Pukelsheim, from Gelbrich and from Cuesta-Albertos, Matran-Bea and Tuero-Diaz to frame operators, we show that the sets of…

The Sliced-Wasserstein distance (SW) is being increasingly used in machine learning applications as an alternative to the Wasserstein distance and offers significant computational and statistical benefits. Since it is defined as an…

Generalized Wasserstein distances allow to quantitatively compare two continuous or atomic mass distributions with equal or different total mass. In this paper, we propose four numerical methods for the approximation of three different…

In this article, we represent the Wasserstein metric of order $p$, where $p\in [1,\infty)$, in terms of the comonotonicity copula, for the case of probability measures on $\R^d$, by revisiting existing results. In 1973, Vallender…

In this paper, we define the generalized Wasserstein distance for sets of Borel probability measures and demonstrate that the weak convergence of sublinear expectations can be characterized by means of this distance.

The study of the closest point(s) on a statistical model from a given distribution in the probability simplex with respect to a fixed Wasserstein metric gives rise to a polyhedral norm distance optimization problem. There are two components…