A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters

12 September 2018

Papers citing "A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters"

11 / 11 papers shown

Title
Distributed Computation of Wasserstein Barycenters over Networks César A. Uribe D. Dvinskikh Pavel Dvurechensky Alexander Gasnikov A. Nedić 28 53 0 08 Mar 2018
Computational Optimal Transport Gabriel Peyré Marco Cuturi OT 203 2,146 0 01 Mar 2018
Stochastic Wasserstein Barycenters Sebastian Claici Edward Chien Justin Solomon 53 71 0 15 Feb 2018
A Fast Proximal Point Method for Computing Exact Wasserstein Distance Yujia Xie Xiangfeng Wang Ruijia Wang H. Zha 50 18 0 12 Feb 2018
Wasserstein Dictionary Learning: Optimal Transport-based unsupervised non-linear dictionary learning M. Schmitz Matthieu Heitz Nicolas Bonneel Fred-Maurice Ngole-Mboula D. Coeurjolly Marco Cuturi Gabriel Peyré Jean-Luc Starck OT 57 136 0 07 Aug 2017
Regularized Optimal Transport and the Rot Mover's Distance Arnaud Dessein Nicolas Papadakis Jean-Luc Rouas OT 72 84 0 20 Oct 2016
Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support Jianbo Ye Panruo Wu Jianmin Wang Jia Li 40 132 0 30 Sep 2015
A Smoothed Dual Approach for Variational Wasserstein Problems Marco Cuturi Gabriel Peyré 54 175 0 09 Mar 2015
Fast Computation of Wasserstein Barycenters Marco Cuturi Arnaud Doucet OT 86 740 0 16 Oct 2013
Bregman Alternating Direction Method of Multipliers Huahua Wang A. Banerjee 75 206 0 13 Jun 2013
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances Marco Cuturi OT 201 4,258 0 04 Jun 2013