Continuous Regularized Wasserstein Barycenters

08/28/2020
by   Lingxiao Li, et al.
4

Wasserstein barycenters provide a geometrically meaningful way to aggregate probability distributions, built on the theory of optimal transport. They are difficult to compute in practice, however, leading previous work to restrict their supports to finite sets of points. Leveraging a new dual formulation for the regularized Wasserstein barycenter problem, we introduce a stochastic algorithm that constructs a continuous approximation of the barycenter. We establish strong duality and use the corresponding primal-dual relationship to parametrize the barycenter implicitly using the dual potentials of regularized transport problems. The resulting problem can be solved with stochastic gradient descent, which yields an efficient online algorithm to approximate the barycenter of continuous distributions given sample access. We demonstrate the effectiveness of our approach and compare against previous work on synthetic examples and real-world applications.

READ FULL TEXT
research
10/22/2021

Variational Wasserstein Barycenters with c-Cyclical Monotonicity

Wasserstein barycenter, built on the theory of optimal transport, provid...
research
02/15/2018

Stochastic Wasserstein Barycenters

We present a stochastic algorithm to compute the barycenter of a set of ...
research
02/20/2020

Stochastic Optimization for Regularized Wasserstein Estimators

Optimal transport is a foundational problem in optimization, that allows...
research
06/12/2020

Handling Multiple Costs in Optimal Transport: Strong Duality and Efficient Computation

We introduce an extension of the optimal transportation (OT) problem whe...
research
05/24/2018

Primal-Dual Wasserstein GAN

We introduce Primal-Dual Wasserstein GAN, a new learning algorithm for b...
research
02/16/2021

Efficient Discretizations of Optimal Transport

Obtaining solutions to Optimal Transportation (OT) problems is typically...
research
10/05/2016

Convex Histogram-Based Joint Image Segmentation with Regularized Optimal Transport Cost

We investigate in this work a versatile convex framework for multiple im...

Please sign up or login with your details

Forgot password? Click here to reset