TL;DR
This paper introduces Tsallis regularized optimal transport ( rot), unifying various divergence measures, and applies it to ecological inference, demonstrating its effectiveness in reconstructing joint distributions from marginals.
Contribution
The paper develops rot, a unified framework for optimal transport that interpolates multiple divergences and applies it to ecological inference with proven algorithms and convergence.
Findings
rot~generalizes known metric properties of Sinkhorn-Cuturi.
Efficient algorithms with convergence proofs are provided for rot.
Experiments show rot~faithfully reconstructs joint distributions in electoral data.
Abstract
Optimal transport is a powerful framework for computing distances between probability distributions. We unify the two main approaches to optimal transport, namely Monge-Kantorovitch and Sinkhorn-Cuturi, into what we define as Tsallis regularized optimal transport (\trot). \trot~interpolates a rich family of distortions from Wasserstein to Kullback-Leibler, encompassing as well Pearson, Neyman and Hellinger divergences, to name a few. We show that metric properties known for Sinkhorn-Cuturi generalize to \trot, and provide efficient algorithms for finding the optimal transportation plan with formal convergence proofs. We also present the first application of optimal transport to the problem of ecological inference, that is, the reconstruction of joint distributions from their marginals, a problem of large interest in the social sciences. \trot~provides a convenient framework for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
