Wasserstein Distance to Independence Models
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Mar 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 0; 2025: 1.
4 papers.
- 2021Geometry of Linear Convolutional Networkscited by 27
- 2021The Geometry of Memoryless Stochastic Policy Optimization in Infinite-Horizon POMDPscited by 9
- 2022Discrete Optimal Transport with Independent Marginals is #P-Hardcited by 3
- 2025Temporal Robustness in Discrete Time Linear Dynamical Systemscited by 0
- 2025Temporal Robustness in Discrete Time Linear Dynamical Systems5 May 2025
- 2022Discrete Optimal Transport with Independent Marginals is #P-Hard2 Mar 2022
- 2021The Geometry of Memoryless Stochastic Policy Optimization in Infinite-Horizon POMDPs14 Oct 2021
- 2021Geometry of Linear Convolutional Networks3 Aug 2021