Abstract
We study the problem of minimizing the Wasserstein distance between a probability distribution and an algebraic variety. We consider the setting of finite state spaces and describe the solution depending on the choice of the ground metric and the given distribution. The Wasserstein distance between the distribution and the variety is the minimum of a linear functional over a union of transportation polytopes. We obtain a description in terms of the solutions of a finite number of systems of polynomial equations. The case analysis is based on the ground metric. A detailed analysis is given for the two bit independence model.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Allman, E., et al.: Maximum likelihood estimation of the latent class model through model boundary decomposition. J. Algebraic Stat. 34, 51–84 (2019)
Arjovsky, M., Chintala, S., Bottou, L.: Wasserstein GAN. arXiv:1701.07875
Bassetti, F., Bodini, A., Regazzini, E.: On minimum Kantorovich distance estimators. Stat. Probab. Lett. 76, 1298–1302 (2006)
Bernton, E., Jacob, P., Gerber, M., Robert, C.: On parameter estimation with the Wasserstein distance. Inf. Infer. J. IMA 8(4), 657–676 (2019)
Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: Advances in Neural Information Processing Systems, Proceedings NIPS 2013, pp. 2292–2300 (2013)
De Loera, J.A., Rambau, J., Santos, F.: Triangulations: Structures for Algorithms and Applications, Algorithms and Computation in Mathematics, vol. 25. Springer-Verlag, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12971-1
Duarte, E., Marigliano, O., Sturmfels, B.: Discrete statistical models with rational maximum likelihood estimator. arXiv:1903.06110
Kulas, K., Joswig, M.: Tropical and ordinary convexity combined. Adv. Geom. 10, 333–352 (2010)
Lasserre, J.: An Introduction to Polynomial and Semi-Algebraic Optimization, Texts in Applied Mathematics. Cambridge University Press, Cambridge (2015)
Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. Graduate Texts in Mathematics, vol. 227. Springer-Verlag, New York (2005). https://doi.org/10.1007/b138602
Pele, O., Werman, M.: Fast and robust earth mover’s distances. In: 2009 IEEE 12th International Conference on Computer Vision, pp. 460–467, September 2009
Peyre, G., Cuturi, M.: Computational optimal transport. Found. Trends Mach. Learn. 11, 355–607 (2019)
Rostalski, P., Sturmfels, B.: Dualities in convex algebraic geometry. Rendiconti di Matematica 30, 285–327 (2010)
Seigal, A., Montúfar, G.: Mixtures and products in two graphical models. J. Alg. Stat. 9, 1–20 (2018)
Sturmfels, B.: Gröbner Bases and Convex Polytopes. University Lecture Series, vol. 8. American Mathematical Society, Providence (1996)
Sullivant, S.: Algebraic Statistics. Graduate Studies in Math. American Mathematical Society, Providence (2018)
Villani, C.: Optimal Transport: Old and New. Grundlehren Series, vol. 338. Springer Verlag, Heidelberg (2008). https://doi.org/10.1007/978-3-540-71050-9
Weed, J., Bach, F.: Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance. arXiv:1707.00087
Acknowledgments
GM has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant no 757983).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Çelik, T.Ö., Jamneshan, A., Montúfar, G., Sturmfels, B., Venturello, L. (2020). Optimal Transport to a Variety. In: Slamanig, D., Tsigaridas, E., Zafeirakopoulos, Z. (eds) Mathematical Aspects of Computer and Information Sciences. MACIS 2019. Lecture Notes in Computer Science(), vol 11989. Springer, Cham. https://doi.org/10.1007/978-3-030-43120-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-030-43120-4_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43119-8
Online ISBN: 978-3-030-43120-4
eBook Packages: Computer ScienceComputer Science (R0)