Fetching the paper…
Reading the bibliography…
We study the fixed-support Wasserstein barycenter problem (FS-WBP), which consists in computing the Wasserstein barycenter of $m$ discrete probability measures supported on a finite metric space of size $n$.
On the efficiency of the Sinkhorn and Greenkhorn algorithms and their acceleration for optimal transport
T. Lin, N. Ho, and M. I. Jordan · 1906
Earlier work this paper cites.
On the complexity of approximating multimarginal optimal transport
T. Lin, N. Ho, M. Cuturi, and M. I. Jordan · 1910
Earlier work this paper cites.
Caractérisation des matrices totalement unimodulaires
A. Ghouila-Houri · 1962
Earlier work this paper cites.
Convex Analysis , volume 28
R. T. Rockafellar · 1970
Earlier work this paper cites.
Optimal maps for the multidimensional Monge-Kantorovich problem
W. Gangbo and A. Swiech · 1998
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner · 1998
Earlier work this paper cites.
The Theory of Graphs
C. Berge · 2001
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Local geometry of deformable templates
A. Trouvé and L. Younes · 2005
Earlier work this paper cites.
Optimal Transport: Old and New , volume 338
C. Villani · 2008
Earlier work this paper cites.
Matching for teams
G. Carlier and I. Ekeland · 2010
Earlier work this paper cites.
Hedonic price equilibria, stable matching, and optimal transport: equivalence, topology, and uniqueness
P-A. Chiappori, R. J. McCann, and L. P. Nesheim · 2010
Earlier work this paper cites.
Barycenters in the Wasserstein space
M. Agueh and G. Carlier · 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.
Optimal-transport formulation of electronic density-functional theory
G. Buttazzo, L. De Pascale, and P. Gori-Giorgi · 2012
Earlier work this paper cites.
Elements of Information Theory
T. M. Cover and J. A. Thomas · 2012
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Earlier work this paper cites.
Density functional theory and optimal transportation with coulomb cost
C. Cotar, G. Friesecke, and C. Klüppelberg · 2013
Earlier work this paper cites.
Sinkhorn distances: lightspeed computation of optimal transport
M. Cuturi · 2013
Earlier work this paper cites.
Gradient methods for minimizing composite functions
Y. Nesterov · 2013
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.
Sliced and radon wasserstein barycenters of measures
N. Bonneel, J. Rabin, G. Peyré, and H. Pfister · 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.
Accelerated, parallel, and proximal coordinate descent
O. Fercoq and P. Richtárik · 2015
Cited alongside, same era.
Semidual regularized optimal transport
M. Cuturi and G. Peyré · 2018
Later among the works it cites.
Decentralize and randomize: faster algorithm for Wasserstein barycenters
P. Dvurechenskii, D. Dvinskikh, A. Gasnikov, C. Uribe, and A. Nedich · 2018
Later among the works it cites.
Computational optimal transport: complexity by accelerated gradient descent is better than by Sinkhorn’s algorithm
P. Dvurechensky, A. Gasnikov, and A. Kroshnin · 2018
Later among the works it cites.
Scalable Bayes via barycenter in Wasserstein space
S. Srivastava, C. Li, and D. B. Dunson · 2018
Later among the works it cites.
Distributed computation of Wasserstein barycenters over networks
C. A. Uribe, D. Dvinskikh, P. Dvurechensky, A. Gasnikov, and A. Nedić · 2018
Later among the works it cites.
A fast globally linearly convergent algorithm for the computation of Wasserstein barycenters
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Probabilistic fréchet means for time varying persistence diagrams
E. Munch, K. Turner, P. Bendich, S. Mukherjee, J. Mattingly, J. Harer, et al · 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.
Discrete wasserstein barycenters: Optimal transport for discrete data
E. Anderes, S. Borgwardt, and J. Miller · 2016
Cited alongside, same era.
Wasserstein barycentric coordinates: histogram regression using optimal transport
N. Bonneel, G. Peyré, and M. Cuturi · 2016
Cited alongside, same era.
A smoothed dual approach for variational Wasserstein problems
M. Cuturi and G. Peyré · 2016
Cited alongside, same era.
Stochastic optimization for large-scale optimal transport
A. Genevay, M. Cuturi, G. Peyré, and F. Bach · 2016
Cited alongside, same era.
L. Yang, J. Li, D. Sun, and K. Toh · 2018
Later among the works it cites.
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.
Accelerated alternating minimization, accelerated Sinkhorn’s algorithm and accelerated iterative Bregman projections
S. Guminov, P. Dvurechensky, N. Tupitsa, and A. Gasnikov · 2019
Later among the works it cites.
A direct tilde { \{ O } \} (1/epsilon) iteration parallel algorithm for optimal transport
A. Jambulapati, A. Sidford, and K. Tian · 2019
Later among the works it cites.
On the complexity of approximating Wasserstein barycenters
A. Kroshnin, N. Tupitsa, D. Dvinskikh, P. Dvurechensky, A. Gasnikov, and C. Uribe · 2019
Later among the works it cites.
A graph theoretic additive approximation of optimal transport
N. Lahn, D. Mulchandani, and S. Raghvendra · 2019
Later among the works it cites.
On scalable variant of Wasserstein barycenter
T. Le, V. Huynh, N. Ho, D. Phung, and M. Yamada · 2019
Later among the works it cites.
Computational optimal transport
G. Peyré and M. Cuturi · 2019
Later among the works it cites.
Approximating optimal transport with linear programs
K. Quanrud · 2019
Later among the works it cites.
Stabilized sparse scaling algorithms for entropy regularized transport problems
B. Schmitzer · 2019
Later among the works it cites.
Improved linear programs for discrete barycenters
S. Borgwardt and S. Patterson · 2020
Closest in time.
On the computation of Wasserstein barycenters
G. Puccetti, L. Rüschendorf, and S. Vanduffel · 2020
Closest in time.