Related papers: Wasserstein distance on configuration space
Measuring dependence between random variables is a fundamental problem in Statistics, with applications across diverse fields. While classical measures such as Pearson's correlation have been widely used for over a century, they have…
Given a determinate (multivariate) probability measure $\mu$, we characterize Gaussian mixtures $\nu\_\phi$ which minimize the Wasserstein distance $W\_2(\mu,\nu\_\phi)$ to $\mu$ when the mixing probability measure $\phi$ on the parameters…
In this work, we present a method to compute the Kantorovich-Wasserstein distance of order one between a pair of two-dimensional histograms. Recent works in Computer Vision and Machine Learning have shown the benefits of measuring…
This work characterizes, analytically and numerically, two major effects of the quadratic Wasserstein ($W_2$) distance as the measure of data discrepancy in computational solutions of inverse problems. First, we show, in the…
The convergence rate in Wasserstein distance is estimated for empirical measures of ergodic Markov processes, and the estimate can be sharp in some specific situations. The main result is applied to subordinations of typical models excluded…
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…
We set up a general theory for a quantum Wasserstein distance of order 1 in an operator algebraic framework, extending recent work in finite dimensions. In addition, this theory applies not only to states, but also to channels, giving a…
Wasserstein balls, which contain all probability measures within a pre-specified Wasserstein distance to a reference measure, have recently enjoyed wide popularity in the distributionally robust optimization and machine learning communities…
We present a framework for obtaining explicit bounds on the rate of convergence to equilibrium of a Markov chain on a general state space, with respect to both total variation and Wasserstein distances. For Wasserstein bounds, our main tool…
Optimal Transport has received much attention in Machine Learning as it allows to compare probability distributions by exploiting the geometry of the underlying space. However, in its original formulation, solving this problem suffers from…
We study the discretization of generalized Wasserstein distances with nonlinear mobilities on the real line via suitable discrete metrics on the cone of N ordered particles, a setting which naturally appears in the framework of…
This paper establishes the quantitative stability of invariant measures $\mu_{\alpha}$ for $\mathbb{R}^d$-valued ergodic stochastic differential equations driven by rotationally invariant multiplicative $\alpha$-stable processes with…
We prove existence of an optimal transport map in the Monge-Kantorovich problem associated to a cost $c(x,y)$ which is not finite everywhere, but coincides with $|x-y|^2$ if the displacement $y-x$ belongs to a given convex set $C$ and it is…
We discuss a new notion of distance on the space of finite and nonnegative measures which can be seen as a generalization of the well-known Kantorovich-Wasserstein distance. The new distance is based on a dynamical formulation given by an…
The Bregman-Wasserstein divergence is the optimal transport cost when the underlying cost function is given by a Bregman divergence, and arises naturally in fields such as statistics and machine learning. We establish fundamental properties…
This paper discusses a class of combinatorial optimization problems with uncertain costs in the objective function. It is assumed that a sample of the cost realizations is available, which defines an empirical probability distribution for…
The convergence rate in Wasserstein distance is estimated for the empirical measures of symmetric semilinear SPDEs. Unlike in the finite-dimensional case that the convergence is of algebraic order in time, in the present situation the…
We formulate and study an optimal transportation problem with infinitely many marginals; this is a natural extension of the multi-marginal problem studied by Gangbo and Swiech (1998). We prove results on the existence, uniqueness and…
Wasserstein GANs with Gradient Penalty (WGAN-GP) are a very popular method for training generative models to produce high quality synthetic data. While WGAN-GP were initially developed to calculate the Wasserstein 1 distance between…
Projection robust Wasserstein (PRW) distance, or Wasserstein projection pursuit (WPP), is a robust variant of the Wasserstein distance. Recent work suggests that this quantity is more robust than the standard Wasserstein distance, in…