arXiv Analytics

Sign in

arXiv:2003.06725 [math.OC]AbstractReferencesReviewsResources

Wasserstein Distance to Independence Models

Türkü Özlüm Çelik, Asgar Jamneshan, Guido Montúfar, Bernd Sturmfels, Lorenzo Venturello

Published 2020-03-15Version 1

An independence model for discrete random variables is a Segre-Veronese variety in a probability simplex. Any metric on the set of joint states of the random variables induces a Wasserstein metric on the probability simplex. The unit ball of this polyhedral norm is dual to the Lipschitz polytope. Given any data distribution, we seek to minimize its Wasserstein distance to a fixed independence model. The solution to this optimization problem is a piecewise algebraic function of the data. We compute this function explicitly in small instances, we examine its combinatorial structure and algebraic degrees in the general case, and we present some experimental case studies.

Related articles: Most relevant | Search more
arXiv:2305.09046 [math.OC] (Published 2023-05-15)
Convex optimization over a probability simplex
arXiv:2105.08653 [math.OC] (Published 2021-05-18, updated 2022-04-25)
Minimal angle spread in the probability simplex with respect to the uniform distribution
arXiv:1812.00032 [math.OC] (Published 2018-11-30)
Optimal Transport on the Probability Simplex with Logarithmic Cost