Fetching the paper…
Reading the bibliography…
Computing Wasserstein barycenters is a fundamental geometric problem with widespread applications in machine learning, statistics, and computer graphics.
Polynomial algorithms in linear programming
L. G. Khachiyan · 1980
Earlier work this paper cites.
The ellipsoid method and its consequences in combinatorial optimization
M. Grötschel, L. Lovász, and A. Schrijver · 1981
Earlier work this paper cites.
Constructing arrangements of lines and hyperplanes with applications
H. Edelsbrunner, J. O’Rourke, and R. Seidel · 1986
Earlier work this paper cites.
Power diagrams: properties, algorithms and applications
F. Aurenhammer · 1987
Earlier work this paper cites.
Concrete and abstract Voronoi diagrams
R. Klein · 1989
Earlier work this paper cites.
An optimal convex hull algorithm in any fixed dimension
B. Chazelle · 1993
Earlier work this paper cites.
Introduction to linear optimization
D. Bertsimas and J. N. Tsitsiklis · 1997
Earlier work this paper cites.
Topics in optimal transportation
C. Villani · 2003
Earlier work this paper cites.
Barycenters in the Wasserstein space
M. Agueh and G. Carlier · 2011
Earlier work this paper cites.
LEMON–an open source C++ graph template library
B. Dezső, A. Jüttner, and P. Kovács · 2011
Earlier work this paper cites.
Wasserstein barycenter and its application to texture mixing
J. Rabin, G. Peyré, J. Delon, and M. Bernot · 2011
Earlier work this paper cites.
Geometric algorithms and combinatorial optimization
M. Grötschel, L. Lovász, and A. Schrijver · 2012
Earlier work this paper cites.
Computing medians and means in Hadamard spaces
M. Bacák · 2014
Cited alongside, same era.
Fast computation of Wasserstein barycenters
M. Cuturi and A. Doucet · 2014
Cited alongside, same era.
Iterative Bregman projections for regularized transportation problems
J.-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré · 2015
Cited alongside, same era.
Numerical methods for matching for teams and Wasserstein barycenters
G. Carlier, A. Oberman, and E. Oudet · 2015
Cited alongside, same era.
Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains
J. Solomon, F. De Goes, G. Peyré, M. Cuturi, A. Butscher, A. Nguyen, T. Du, and L. Guibas · 2015
Cited alongside, same era.
A fixed-point approach to barycenters in Wasserstein space
P. C. Álvarez-Esteban, E. Del Barrio, J. Cuesta-Albertos, and C. Matrán · 2016
On the computational complexity of finding a sparse Wasserstein barycenter
S. Borgwardt and S. Patterson · 2019
Later among the works it cites.
Interior-point methods strike back: Solving the Wasserstein barycenter problem
D. Ge, H. Wang, Z. Xiong, and Y. Ye · 2019
Later among the works it cites.
On the complexity of approximating Wasserstein barycenter
A. Kroshnin, D. Dvinskikh, P. Dvurechensky, A. Gasnikov, N. Tupitsa, and C. Uribe · 2019
Later among the works it cites.
Sinkhorn barycenters with free support via Frank-Wolfe algorithm
G. Luise, S. Salzo, M. Pontil, and C. Ciliberto · 2019
Later among the works it cites.
Statistical aspects of Wasserstein distances
V. M. Panaretos and Y. Zemel · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Discrete Wasserstein barycenters: Optimal transport for discrete data
E. Anderes, S. Borgwardt, and J. Miller · 2016
Cited alongside, same era.
Strongly polynomial 2-approximations of discrete Wasserstein barycenters
S. Borgwardt · 2017
Cited alongside, same era.
Multilevel clustering via Wasserstein means
N. Ho, X. L. Nguyen, M. Yurochkin, H. H. Bui, V. Huynh, and D. Phung · 2017
Cited alongside, same era.
Computational optimal transport
G. Peyré and M. Cuturi · 2017
Cited alongside, same era.
Parallel streaming Wasserstein barycenters
M. Staib, S. Claici, J. M. Solomon, and S. Jegelka · 2017
Cited alongside, same era.
Scalable Bayes via barycenter in Wasserstein space
S. Srivastava, C. Li, and D. B. Dunson · 2018
Cited alongside, same era.
Hardness results for Multimarginal Optimal Transport problems
J. M. Altschuler and E. Boix-Adserà · 2020
Closest in time.
J. M. Altschuler and E. Boix-Adserà · 2020
Closest in time.
Gradient descent algorithms for Bures-Wasserstein barycenters
S. Chewi, T. Maunu, P. Rigollet, and A. J. Stromme · 2020
Closest in time.
Multi-marginal optimal transport using partial information with applications in robust localization and sensor fusion
F. Elvander, I. Haasler, A. Jakobsson, and J. Karlsson · 2020
Closest in time.
H. Janati, M. Cuturi, and A. Gramfort · 2020
Closest in time.
Fixed-support Wasserstein barycenters: Computational hardness and fast algorithm
T. Lin, N. Ho, X. Chen, M. Cuturi, and M. Jordan · 2020
Closest in time.