Optimal Transport to a Variety

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Çelik, T. Ö., Jamneshan, A., Montúfar, G., Sturmfels, B., & Venturello, L. (2020). Optimal Transport to a Variety. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11989 LNCS, pp. 364–381). Springer. https://doi.org/10.1007/978-3-030-43120-4_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free