An exact and fast solution of the inverse Regularized Optimal Transport problem
Abstract
Optimal transport describes the most efficient way to move mass between two distributions, given a cost matrix for moving mass between each pair of locations. Entropic optimal transport, solved via the Sinkhorn algorithm, is a widely used regularized version of this problem. Its inverse problem asks the opposite question: given an observed transport plan, what cost matrix produced it? This is difficult because the cost is identifiable only up to an additive gauge freedom. Here we show that this freedom can be fixed exactly by a single double-centering operation applied to the observed plan, yielding the true cost matrix in closed form, with no iterative optimization required. When a modest number of true cost entries are known, the same approach lets us jointly estimate the temperature parameter controlling the entropic regularization, together with a diagnostic for the reliability of this estimate. We further show that the method is not specific to the entropic optimal transport, but extends to a broader class of transport models defined by an invertible relation between cost and plan.
Related
- Exact Solution of the Direct and Inverse Quasi-stationary Dynamo Problem in the Expanding Plasma Ball
- Underdamped Stochastic Optimal Transport with Landauer boundary conditions: machine learning and analytical solution
- Derivation of the General Solution of the Black-Scholes Boundary-Value Problem
- A constructive solution to the n-representability problem
- Inverse Feshbach's problem: Solvability and solutions
BibTeX
@misc{mazzilli2026exact,
title = {{An exact and fast solution of the inverse Regularized Optimal Transport problem}},
author = {Dario Mazzilli and Riccardo Piombo and Lorenzo Buffa and Aurelio Patelli},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.01278},
eprint = {2609.01278},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.01278},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - An exact and fast solution of the inverse Regularized Optimal Transport problem
AU - Dario Mazzilli
AU - Riccardo Piombo
AU - Lorenzo Buffa
AU - Aurelio Patelli
PY - 2026
DA - 2026/09/01
PB - arXiv
DO - 10.48550/arxiv.2609.01278
UR - https://arxiv.org/abs/2609.01278
AB - Optimal transport describes the most efficient way to move mass between two distributions, given a cost matrix for moving mass between each pair of locations. Entropic optimal transport, solved via the Sinkhorn algorithm, is a widely used regularized version of this problem. Its inverse problem asks the opposite question: given an observed transport plan, what cost matrix produced it? This is difficult because the cost is identifiable only up to an additive gauge freedom. Here we show that this freedom can be fixed exactly by a single double-centering operation applied to the observed plan, yielding the true cost matrix in closed form, with no iterative optimization required. When a modest number of true cost entries are known, the same approach lets us jointly estimate the temperature parameter controlling the entropic regularization, together with a diagnostic for the reliability of this estimate. We further show that the method is not specific to the entropic optimal transport, but extends to a broader class of transport models defined by an invertible relation between cost and plan.
ER -