Curvature of optimal transport with respect to the cost and applications to inverse optimal transport
Gabriel Peyr\'e, Clarice Poon, Oscar Tron

TL;DR
This paper investigates the inverse optimal transport problem, revealing how regularity of marginals affects the problem's structure, and establishes conditions for local identifiability and stability, especially for bilinear costs.
Contribution
It characterizes the curvature of the inverse optimal transport functional in continuous settings, proving local identifiability and stability results, and analyzing the case of structured bilinear costs.
Findings
Non-degeneracy of the second variation yields strict curvature in continuous transport.
Ground costs with bilinear parametrizations are identifiable from a single optimal coupling.
Regularity of marginals ensures stability and local invertibility in inverse optimal transport.
Abstract
We study the inverse optimal transport problem of recovering the ground cost from an optimal transport plan. In discrete settings, this problem reduces to inverse linear programming and is intrinsically ill-posed, exhibiting non-identifiability and flat directions. We show that in the continuous setting, the regularity of the marginals fundamentally alters the structure of the inverse problem. Assuming smooth positive densities for the source and target measures, we characterize the second variation of the optimal transport functional with respect to the ground cost in H\"older spaces. In particular, we show that it is non-degenerate modulo the natural transport invariances, yielding a strict curvature property that is absent in discrete transport. As a consequence, we obtain local identifiability and stability results for inverse optimal transport. For the structured family of bilinear…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
