Inverse optimal transport
From MaRDI portal
Abstract: Discrete optimal transportation problems arise in various contexts in engineering, the sciences and the social sciences. Often the underlying cost criterion is unknown, or only partly known, and the observed optimal solutions are corrupted by noise. In this paper we propose a systematic approach to infer unknown costs from noisy observations of optimal transportation plans. The algorithm requires only the ability to solve the forward optimal transport problem, which is a linear program, and to generate random numbers. It has a Bayesian interpretation, and may also be viewed as a form of stochastic optimization. We illustrate the developed methodologies using the example of international migration flows. Reported migration flow data captures (noisily) the number of individuals moving from one country to another in a given period of time. It can be interpreted as a noisy observation of an optimal transportation map, with costs related to the geographical position of countries. We use a graph-based formulation of the problem, with countries at the nodes of graphs and non-zero weighted adjacencies only on edges between countries which share a border. We use the proposed algorithm to estimate the weights, which represent cost of transition, and to quantify uncertainty in these weights.
Recommendations
Cites work
- A note on two problems in connexion with graphs
- Calculating some inverse linear programming problems
- Computational optimal transport. With applications to data sciences
- Cupid's invisible hand: social surplus and identification in matching models
- Data assimilation: the Schrödinger perspective
- Equation of state calculations by fast computing machines
- Estimation of emigration, return migration, and transit migration between all pairs of countries
- scientific article; zbMATH DE number 1349965 (Why is no real title available?)
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Integrated Modeling of European Migration
- Inverse linear programming
- Inverse Optimization
- Learning to match via inverse optimal transport
- MCMC methods for functions: modifying old algorithms to make them faster
- Monte Carlo sampling methods using Markov chains and their applications
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal scaling of random-walk Metropolis algorithms on general target distributions
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- Statistical and computational inverse problems.
- The earth mover's distance as a metric for image retrieval
- Weak convergence and optimal scaling of random walk Metropolis algorithms
Cited in
(13)- Ground metric learning on graphs
- A mean field game inverse problem
- The empirical cost of optimal incomplete transportation
- Estimating matching affinity matrices under low-rank constraints
- Understanding mass transfer directions via data-driven models with application to mobile phone data
- Learning to match via inverse optimal transport
- <scp>SISTA</scp>: Learning Optimal Transport Costs under Sparsity Constraints
- Empirical optimal transport under estimated costs: distributional limits and statistical applications
- Estimation of stationary optimal transport plans
- Nonlinear inverse optimal transport: identifiability of the transport cost from its marginals and optimal values
- Synchronized optimal transport for joint modeling of dynamics across multiple spaces
- Well-posedness and efficient algorithms for inverse optimal transport with Bregman regularization
- Truncated Differentiation for Inverse Potential MFGs
This page was built for publication: Inverse optimal transport
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217710)
