Stochastic Saddle-Point Optimization for Wasserstein Barycenters

06/11/2020
by   Daniil Tiapkin, et al.
0

We study the computation of non-regularized Wasserstein barycenters of probability measures supported on the finite set. The first result gives a stochastic optimization algorithm for the discrete distribution over the probability measures which is comparable with the current best algorithms. The second result extends the previous one to the arbitrary distribution using kernel methods. Moreover, this new algorithm has a total complexity better than the Stochastic Averaging approach via the Sinkhorn algorithm in many cases.

READ FULL TEXT
research
06/11/2018

Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters

We study the problem of decentralized distributed computation of a discr...
research
06/16/2020

Primal Dual Interpretation of the Proximal Stochastic Gradient Langevin Algorithm

We consider the task of sampling with respect to a log concave probabili...
research
02/05/2021

Projection Robust Wasserstein Barycenter

Collecting and aggregating information from several probability measures...
research
12/21/2018

Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures

This paper is devoted to the stochastic approximation of entropically re...
research
04/04/2022

Revisiting Sliced Wasserstein on Images: From Vectorization to Convolution

The conventional sliced Wasserstein is defined between two probability m...
research
01/24/2019

On the Complexity of Approximating Wasserstein Barycenter

We study the complexity of approximating Wassertein barycenter of m disc...
research
01/21/2020

SA vs SAA for population Wasserstein barycenter calculation

In Machine Learning and Optimization community there are two main approa...

Please sign up or login with your details

Forgot password? Click here to reset