mlsanityData to 7 Oct 2026

Discrete Probabilistic Inverse Optimal Transport

arXiv 2112.09754 ↗First posted 17 Dec 2021stat.ML cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Optimal transport (OT) formalizes the problem of finding an optimal coupling between probability measures given a cost matrix. The inverse problem of inferring the cost given a coupling is Inverse Optimal Transport (IOT). IOT is less well understood than OT. We formalize and systematically analyze the properties of IOT using tools from the study of entropy-regularized OT. Theoretical contributions include characterization of the manifold of cross-ratio equivalent costs, the implications of model priors, and derivation of an MCMC sampler. Empirical contributions include visualizations of cross-ratio equivalent effect on basic examples and simulations validating theoretical results.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 12 of its 25 references that are in the map. First posted on arXiv 17 Dec 2021.

Builds on

12 of 25 references.

References · 12

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2015Optimal Transport for Domain Adaptationcited by 457
  3. 2015Learning with a Wasserstein Losscited by 194
  4. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
  5. 2018Improving GANs Using Optimal Transportcited by 122
  6. 2019Inverse optimal transportcited by 25
  7. 2019A mathematical theory of cooperative communicationcited by 23
  8. 2018Learning to Match via Inverse Optimal Transportcited by 22
  9. 2018Unsupervised Hyperalignment for Multilingual Word Embeddingscited by 17
  10. 2020Regularized Optimal Transport is Ground Cost Adversarialcited by 17
  11. 2016Estimating matching affinity matrix under low-rank constraintscited by 8
  12. 2018Generalizing the theory of cooperative inferencecited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 6; 2025: 0; 2026: 1.

7 papers.