6 citations · 17 across the 29 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.OC2020★ 6 cited
Improved Complexity Bounds in Wasserstein Barycenter Problem
Darina Dvinskikh, Daniil Tiapkin
In this paper, we focus on computational aspects of the Wasserstein barycenter problem. We propose two algorithms to compute Wasserstein barycenters of discrete measures of siz…
math.OC2020★ 3 cited
Stochastic Saddle-Point Optimization for Wasserstein Barycenters
Daniil Tiapkin, Alexander Gasnikov, Pavel Dvurechensky
We consider the population Wasserstein barycenter problem for random probability measures supported on a finite set of points and generated by an online stream of data. This leads…