Optimal Transport to a Variety

DOI10.1007/978-3-030-43120-4_29OpenAlexW3013909493MaRDI QIDQ5014695

Guido Montúfar, Turku Ozlum Celik, Asgar Jamneshan, Bernd Sturmfels, Lorenzo Venturello

Publication date: 8 December 2021

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.11716

zbMATH Keywords

triangulationlinear programmingWasserstein distancepolynomial optimizationalgebraic statisticstransportation polytopeoptimal transport estimator

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Related Items

Tropical optimal transport and Wasserstein distances, Geometry of Linear Convolutional Networks, Nonlinear algebra and applications, Voronoi diagrams of algebraic varieties under polyhedral norms, Wasserstein distance to independence models

Uses Software

• Wasserstein GAN

Cites Work

• Unnamed Item
• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• Triangulations. Structures for algorithms and applications
• Discrete statistical models with rational maximum likelihood estimator
• Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
• On minimum Kantorovich distance estimators
• An Introduction to Polynomial and Semi-Algebraic Optimization
• Dualities in Convex Algebraic Geometry
• Tropical and ordinary convexity combined
• Algebraic Statistics
• Mixtures and products in two graphical models
• Maximum likelihood estimation of the Latent Class Model through model boundary decomposition
• Approximate Bayesian Computation with the Wasserstein Distance
• Optimal Transport