276

Fast Computation of Wasserstein Barycenters

Abstract

We present new algorithms to compute the mean of a set of empirical probability measures under the optimal transport metric. This mean, known as the Wasserstein barycenter (Agueh and Carlier, 2011), is the measure that minimizes the sum of its Wasserstein distances to each element in that set. We argue through a simple example that Wasserstein barycenters have appealing properties that differentiate them from other barycenters proposed recently, which all build on kernel smoothing and/or Bregman divergences. Two original algorithms are proposed that require the repeated computation of primal and dual optimal solutions of transport problems. A direct implementation of these algorithms is, however, too costly as optimal transports are notoriously computationally expensive. Extending the work of Cuturi (2013), we smooth both the primal and dual optimal transport problems to recover fast approximations to their optima. We apply these algorithms to the visualization of perturbed images and to the resolution of a constrained clustering problem.

View on arXiv
Comments on this paper