Fetching the paper…
Reading the bibliography…
Discrete Wasserstein barycenters correspond to optimal solutions of transportation problems for a set of probability measures with finite support.
MacQueen JB (1967) Some methods of classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp 281–297
1967
Earlier work this paper cites.
Lloyd SP (1982) Least squares quantization in pcm. IEEE Transactions on Information Theory 28(2):129–137
1982
Earlier work this paper cites.
Tardos E (1986) A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34(2):250–256
1986
Earlier work this paper cites.
Jain A, Zhong Y, Dubuisson-Jolly MP (1998) Deformable template models: A review. Signal Processing 71(2):109–129
1998
Earlier work this paper cites.
LeCun Y, Bottou L, Bengio Y, Haffner P (1998) Gradient-based learning applied to document recognition. Proceedings of the IEEE 86(11):2278–2324
1998
Earlier work this paper cites.
Villani C (2003) Topics in Optimal Transportation. American Mathematical Society
2003
Earlier work this paper cites.
Trouvé A, Younes L (2005) Local Geometry of Deformable Templates. SIAM Journal on Mathematical Analysis 37 (1):17–59
2005
Earlier work this paper cites.
Villani C (2009) Optimal transport: old and new. Springer
2009
Earlier work this paper cites.
Carlier G, Ekeland I (2010) Matching for teams. Economic Theory 42(2):397–418
2010
Earlier work this paper cites.
Chiaporri PA, McCann R, Nesheim L (2010) Hedonic price equilibiria, stable matching and optimal transport; equivalence, topology and uniqueness. Economic Theory 42 (2):317–354
2010
Earlier work this paper cites.
Agueh M, Carlier G (2011) Barycenters in the Wasserstein space. SIAM Journal on Mathematical Analysis 43 (2):904–924
2011
Earlier work this paper cites.
Mileyko Y, Mukherjee S, Harer J (2011) Probability measures on the space of persistence diagrams. Inverse Problems 27(12)
2011
Earlier work this paper cites.
Buttazzo G, Pascale LD, Gori-Giorgi P (2012) Optimal-transport formulation of electronic density-functional theory. Physical Review A 85:062502
2012
Earlier work this paper cites.
Rabin J, Peyré G, Delon J, Bernot M (2012) Wasserstein Barycenter and its Application to Texture Mixing. Scale Space and Variatonal Methods in Computer Vision Lecture Notes in Computer Science 6667:435–446
2012
Earlier work this paper cites.
Beiglböck M, Henry-Labordere P, Penkner F (2013) Model-independent bounds for option prices – a mass transport approach. Finance and Stochastics 17 (3):477–501
2013
Earlier work this paper cites.
Cotar C, Friesecke G, Klüppelberg C (2013) Density functional theory and optimal transportation with Coulomb cost. Communications on Pure and Applied Mathematics 66(4):548–599
2013
Earlier work this paper cites.
Cuturi M (2013) Sinkhorn Distances: Lightspeed Computation of Optimal Transport. In: Advances in Neural Information Processing Systems, vol 26, pp 2292–2300
2013
Earlier work this paper cites.
Cuturi M, Doucet A (2014) Fast Computation of Wasserstein Barycenters. In: Proceedings of the 31st International Conference on Machine Learning (ICML-14), pp 685–693
2014
Cited alongside, same era.
Galichon A, Henry-Labordere P, Touzi N (2014) A stochastic control approach to non-arbitrage bounds given marginals, with an application to lookback options. Annals of Applied Probability 24(1):312–336
2014
Cited alongside, same era.
Pass B (2014) Multi-marginal optimal transport and multi-agent matching problems: Uniqueness and structure of solutions. Discrete and Continuous Dynamical Systems A 34 (4):1623–1639
2014
Cited alongside, same era.
Solomon J, Rustamov R, Guibas L, Butscher A (2014) Earth Mover’s Distances on Discrete Surfaces. ACM Transactions on Graphics 33(4):67:1–67:12
2014
Cited alongside, same era.
Essid M, Solomon J (2017) Quadratically Regularized Optimal Transport on Graphs. SIAM Journal on Scientific Computing 40:A1961–A1986
2017
Closest in time.
Staib M, Claici S, Solomon J, Jegelka S (2017) Parallel Streaming Wasserstein Barycenters. Advances in Neural Information Processing Systems (NIPS) 30 pp 2644–2655
2017
Closest in time.
Ye J, Wu P, Wang JZ, Li J (2017) Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support. IEEE Transactions on Signal Processing 65(9):2317–2332
2017
Closest in time.
Claici S, Chien E, Solomon J (2018) Stochastic Wasserstein Barycenters. Proceedings of the 35th International Conference on Machine Learning (PMLR) 80:999–1008
2018
Closest in time.
Gadat S, Gavra I, Risser L (2018) How to Calculate the Barycenter of a Weighted Graph. Mathematics of Operations Research 43(4):1085–1118
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
Benamou JD, Carlier G, Cuturi M, Nenna L, Peyré G (2015) Iterative Bregman Projections for Regularized Transportation Problems. SIAM Journal on Scientific Computing 37(2):A1111–A1138
2015
Cited alongside, same era.
Boissard E, Gouic TL, Loubes JM (2015) Distribution’s template estimate with Wasserstein metrics. Bernoulli 21 (2):740–759
2015
Cited alongside, same era.
Bonneel N, Rabin J, Peyré G, Pfister H (2015) Sliced and Radon Wasserstein Barycenters of Measures. Journal of Mathematical Imaging and Vision 51(1):22–45
2015
Cited alongside, same era.
Carlier G, Oberman A, Oudet E (2015) Numerical methods for matching for teams and Wasserstein barycenters. ESAIM: Mathematical Modelling and Numerical Analysis 49(6):1621–1642
2015
Cited alongside, same era.
Lubin M, Dunning I (2015) Computing in Operations Research Using Julia. INFORMS Journal on Computing 27(2):238–248
2015
Cited alongside, same era.
Munch E, Turner K, Bendich P, Mukherjee S, Mattingly J, Harer J (2015) Probabilistic Frechet means for time varying persistence diagrams. Electronic Journal of Statistics 9:1173–1204
2015
Cited alongside, same era.
Solomon J, de Goes F, Peyré G, Cuturi M, Butscher A, Nguyen A, Du T, Guibas L (2015) Convolutional Wasserstein Distances: Efficient Optimal Transportation on Geometric Domains. ACM Transactions on Graphics 34(4):66:1–66:11
2015
Cited alongside, same era.
2018
Closest in time.
Luise G, Rudi A, Pontil M, Ciliberto C (2018) Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distance. Advances in Neural Information Processing Systems (NIPS) 31 pp 5859–5870
2018
Closest in time.
Srivastava S, Li C, Dunson DB (2018) Scalable Bayes via Barycenter in Wasserstein Space. Journal of Machine Learning Research 19:1–35
2018
Closest in time.
Auricchio G, Bassetti F, Gualandi S, Veneroni S (2019) Computing Wasserstein Barycenters via Linear Programming. In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp 355–363
2019
Closest in time.
del Barrio E, Cuesta-Albertos J, Matrán C, Mayo-Íscar A (2019) Robust clustering tools based on optimal transportation. Statistics and Computing 29(1):139–160
2019
Closest in time.
Frogner C, Mirzazadeh F, Solomon J (2019) Learning Embeddings into Entropic Wasserstein Spaces. eprint arXiv:190503329
2019
Closest in time.
Kroshnin A, Dvinskikh D, Dvurechensky P, Gasnikov A, Tupitsa N, Uribe C (2019) On the Complexity of Approximating Wasserstein Barycenter. In: Proceedings of the 36th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol 97, pp 3530–3540
2019
Closest in time.
Luise G, Salzo S, Pontil M, Ciliberto C (2019) Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithm. eprint arXiv:190513194
2019
Closest in time.
Panaretos VM, Zemel Y (2019) Statistical Aspects of Wasserstein Distances. Annual Review of Statistics and Its Application 6(1):405–431
2019
Closest in time.
Peyré G, Cuturi M (2019) Computational optimal transport. Foundations and Trends in Machine Learning 11(5-6):355–607
2019
Closest in time.
Yang L, Li J, Sun D, Toh KC (2019) A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters. eprint arXiv:180904249
2019
Closest in time.
2019
Closest in time.
Borgwardt S, Patterson S (2020) Improved Linear Programs for Discrete Barycenters. INFORMS Journal on Optimization 2(1):14–33
2020
Closest in time.