Wasserstein metric

In mathematics, the Wasserstein distance or Kantorovich– Rubinstein metric is a distance function defined between probability distributions on a given metric space $M$. It is named after Leonid Vaseršteĭn.

Intuitively, if each distribution is viewed as a unit amount of earth (soil) piled on ''$M$'', the metric is the minimum "cost" of turning one pile into the other, which is assumed to be the amount of earth that needs to be moved times the mean distance it has to be moved. This problem was first formalised by Gaspard Monge in 1781. Because of this analogy, the metric is known in computer science as the earth mover's distance.

The name "Wasserstein distance" was coined by R. L. Dobrushin in 1970, after learning of it in the work of Leonid Vaseršteĭn on Markov processes describing large systems of automata (Russian, 1969). However the metric was first defined by Leonid Kantorovich in ''The Mathematical Method of Production Planning and Organization'' (Russian original 1939) in the context of optimal transport planning of goods and materials. Some scholars thus encourage use of the terms "Kantorovich metric" and "Kantorovich distance". Most English-language publications use the German spelling "Wasserstein" (attributed to the name "Vaseršteĭn" being of German origin).

Definition

Let $(M,d)$ be a metric space that is a Radon space. For p \in ,_\infty),_the_Wasserstein_$p$-distance_between_two_probability_measures_$\mu$_and_$\nu$_on_$M$_with_finite_$p$- ,_\infty),_the_Wasserstein_$p$-distance_between_two_probability_measures_$\mu$_and_$\nu$_on_$M$_with_finite_$p$-Moment_(mathematics)">moments_is
:$W_p(\mu,_\nu)_=_\left(_\inf__\mathbf__d(x,_y)^p_\right)^$
where_$\Gamma(\mu,_\nu)$_is_the_set_of_all_coupling_(probability).html" ;"title="Moment_(mathematics).html" ;"title="probability_measure.html" ;"title=", \infty), the Wasserstein $p$-distance between two probability measure">, \infty), the Wasserstein $p$-distance between two probability measures $\mu$ and $\nu$ on $M$ with finite $p$-Moment (mathematics)">moments is
:$W_p(\mu, \nu) = \left( \inf_ \mathbf_ d(x, y)^p \right)^$
where $\Gamma(\mu, \nu)$ is the set of all coupling (probability)">couplings of $\mu$ and $\nu$. A coupling $\gamma$ is a joint probability measure on $M \times M$ whose marginal distribution, marginals are $\mu$ and $\nu$ on the first and second factors, respectively. That is,
:$\int_M \gamma(x, y) \,\mathrmy = \mu(x)$
:$\int_M \gamma(x, y) \,\mathrmx = \nu(y)$

Intuition and connection to optimal transport

One way to understand the above definition is to consider the optimal transport problem. That is, for a distribution of mass $\mu(x)$ on a space $X$, we wish to transport the mass in such a way that it is transformed into the distribution $\nu(x)$ on the same space; transforming the 'pile of earth' $\mu$ to the pile $\nu$. This problem only makes sense if the pile to be created has the same mass as the pile to be moved; therefore without loss of generality assume that $\mu$ and $\nu$ are probability distributions containing a total mass of 1. Assume also that there is given some cost function

:$c(x,y) \geq 0$

that gives the cost of transporting a unit mass from the point $x$ to the point $y$.
A transport plan to move $\mu$ into $\nu$ can be described by a function $\gamma(x,y)$ which gives the amount of mass to move from $x$ to $y$. You can imagine the task as the need to move a pile of earth of shape $\mu$ to the hole in the ground of shape $\nu$ such that at the end, both the pile of earth and the hole in the ground completely vanish. In order for this plan to be meaningful, it must satisfy the following properties

:$\begin \int \gamma(x,y) \,\mathrm y = \mu(x) & \qquad \text x \text \\ \int \gamma(x,y) \,\mathrm x = \nu(y) & \qquad \text y \text \end$
That is, that the total mass moved ''out of'' an infinitesimal region around $x$ must be equal to $\mu(x) \mathrmx$ and the total mass moved ''into'' a region around $y$ must be $\nu(y)\mathrmy$. This is equivalent to the requirement that $\gamma$ be a joint probability distribution with marginals $\mu$ and $\nu$. Thus, the infinitesimal mass transported from $x$ to $y$ is $\gamma(x,y) \, \mathrm x \, \mathrm y$, and the cost of moving is $c(x,y) \gamma(x,y) \, \mathrm x \, \mathrm y$, following the definition of the cost function. Therefore, the total cost of a transport plan $\gamma$ is
:$\iint c(x,y) \gamma(x,y) \, \mathrm x \, \mathrm y = \int c(x,y) \, \mathrm \gamma(x,y)$

The plan $\gamma$ is not unique; the optimal transport plan is the plan with the minimal cost out of all possible transport plans. As mentioned, the requirement for a plan to be valid is that it is a joint distribution with marginals $\mu$ and $\nu$; letting $\Gamma$ denote the set of all such measures as in the first section, the cost of the optimal plan is
:$C = \inf_ \int c(x,y) \, \mathrm \gamma(x,y)$
If the cost of a move is simply the distance between the two points, then the optimal cost is identical to the definition of the $W_1$ distance.

Examples

Point masses (degenerate distributions)

Let $\mu_ = \delta_$ and $\mu_ = \delta_$ be two degenerate distributions (i.e. Dirac delta distributions) located at points $a_$ and $a_$ in $\mathbb$. There is only one possible coupling of these two measures, namely the point mass $\delta_$ located at $(a_, a_) \in \mathbb^$. Thus, using the usual absolute value function as the distance function on $\mathbb$, for any $p \geq 1$, the $p$-Wasserstein distance between $\mu_$ and $\mu_2$ is
:$W_p (\mu_1, \mu_2) = , a_1 - a_2 , .$
By similar reasoning, if $\mu_ = \delta_$ and $\mu_ = \delta_$ are point masses located at points $a_$ and $a_$ in $\mathbb^$, and we use the usual Euclidean norm on $\mathbb^$ as the distance function, then
:$W_p (\mu_1, \mu_2) = \, a_1 - a_2 \, _2 .$

Normal distributions

Let $\mu_1 = \mathcal(m_1, C_1)$ and $\mu_2 = \mathcal(m_2, C_2)$ be two non-degenerate Gaussian measures (i.e. normal distributions) on $\mathbb^n$, with respective expected values $m_1$ and $m_2 \in \mathbb^n$ and symmetric positive semi-definite covariance matrices $C_$ and $C_2 \in \mathbb^$. Then, with respect to the usual Euclidean norm on $\mathbb^$, the 2-Wasserstein distance between $\mu_$ and $\mu_$ is
:$W_ (\mu_1, \mu_2)^2 = \, m_1 - m_2 \, _2^2 + \mathop \bigl( C_1 + C_2 - 2 \bigl( C_2^ C_1 C_2^ \bigr)^ \bigr) .$
This result generalises the earlier example of the Wasserstein distance between two point masses (at least in the case $p = 2$), since a point mass can be regarded as a normal distribution with covariance matrix equal to zero, in which case the trace term disappears and only the term involving the Euclidean distance between the means remains.

One-dimensional distributions

Let $\mu_1, \mu_2 \in P_p(\mathbb)$ be probability measures on $\mathbb$, and denote their cumulative distribution functions by $F_1(x)$ and $F_2(x)$. Then the transport problem has an analytic solution: Optimal transport preserves the order of probability mass elements, so the mass at quantile $q$ of $\mu_1$ moves to quantile $q$ of $\mu_2$.
Thus, the $p$-Wasserstein distance between $\mu_1$ and $\mu_2$ is
:$W_p(\mu_1, \mu_2) = \left(\int_0^1 \left, F_1^(q) - F_2^(q) \^p \, \mathrm q\right)^$
where $F_1^$ and $F_2^$ are the quantile functions (inverse CDFs).
In the case of $p=1$, a change of variables leads to the formula
:$W_1(\mu_1, \mu_2) = \int_ \left, F_1(x) - F_2(x) \ \, \mathrm x$.

Applications

The Wasserstein metric is a natural way to compare the probability distributions of two variables ''X'' and ''Y'', where one variable is derived from the other by small, non-uniform perturbations (random or deterministic).

In computer science, for example, the metric ''W''₁ is widely used to compare discrete distributions, ''e.g.'' the color histograms of two digital images; see earth mover's distance for more details.

In their paper ' Wasserstein GAN', Arjovsky et al. use the Wasserstein-1 metric as a way to improve the original framework of Generative Adversarial Networks (GAN), to alleviate the vanishing gradient and the mode collapse issues. The special case of normal distributions is used in a Frechet Inception Distance.

The Wasserstein metric has a formal link with Procrustes analysis, with application to chirality measures, and to shape analysis.

In computational biology, Wasserstein metric can be used to compare between persistence diagrams of cytometry datasets.

The Wasserstein metric also has been used in inverse problems in geophysics.

The Wasserstein metric is used in Integrated information theory to compute the difference between concepts and conceptual structures.

Properties

Metric structure

It can be shown that ''W''_''p'' satisfies all the axioms of a metric on ''P''_''p''(''M''). Furthermore, convergence with respect to ''W''_''p'' is equivalent to the usual weak convergence of measures plus convergence of the first ''p''th moments.

Dual representation of ''W''₁

The following dual representation of ''W''₁ is a special case of the duality theorem of Kantorovich and Rubinstein (1958): when ''μ'' and ''ν'' have bounded support,

:$W_1 (\mu, \nu) = \sup \left\,$

where Lip(''f'') denotes the minimal Lipschitz constant for ''f''.

Compare this with the definition of the Radon metric:

:$\rho (\mu, \nu) := \sup \left\.$

If the metric ''d'' is bounded by some constant ''C'', then

:$2 W_1 (\mu, \nu) \leq C \rho (\mu, \nu),$

and so convergence in the Radon metric (identical to total variation convergence when ''M'' is a Polish space) implies convergence in the Wasserstein metric, but not vice versa.

Proof

The following is an intuitive proof which skips over technical points. A fully rigorous proof is found in.

Discrete case: When $M$ is discrete, solving for the 1-Wasserstein distance is a problem in linear programming:$\begin \min_\gamma \sum_ c(x, y) \gamma(x, y) \\ \sum_y \gamma(x, y) = \mu(x) \\ \sum_x \gamma(x, y) = \nu(y) \\ \gamma \geq 0 \end$where $c: M \times M \to$dual_problem_
In__mathematical_optimization_theory,_duality_or_the_duality_principle_is_the_principle_that__optimization_problems_may_be_viewed_from_either_of_two_perspectives,_the_primal_problem_or_the_dual_problem._If_the_primal_is_a_minimization_problem_then__...
:\begin
__\max__\sum_x_\mu(x)f(x)_+_\sum_y_\nu(y)g(y)\\
__f(x)_+_g(y)_\leq_c(x,_y)
__\endand_by_the_Dual_linear_program#Strong_duality.html" ;"title="Dual_linear_program.html" "title=", \infty) is a general "cost function".

By carefully writing the above equations as matrix equations, we obtain its Dual linear program">dual problem