Learning Urban Access Costs from Origin-Destination Flows via Inverse Optimal Transport
Summary
This paper introduces two inverse optimal transport estimators to recover latent choice costs from observed origin-destination flows, applied to Philippine school choice data to quantify how much perceived travel cost an education subsidy offsets.
View Cached Full Text
Cached at: 06/15/26, 09:11 AM
# Learning Urban Access Costs from Origin–Destination Flows via Inverse Optimal Transport
Source: [https://arxiv.org/html/2606.14157](https://arxiv.org/html/2606.14157)
###### Abstract
Cities deliver basic services through mixed public\-private facility networks, including schools, clinics, transit providers, and subsidized service points\. In these systems, planners often observe where households go, but not the latent cost function through which they trade off factors such as distance, price, and institutional access\. We study this urban problem through school choice in the Philippines, where the country’s largest national education subsidy is intended to redirect learners from congested public schools to participating private schools\. Treating school\-to\-school enrollment flows as an entropic optimal transport plan, we recover latent choice costs using two complementary inverse optimal transport models: an interpretable distance\-banded model with a subsidy term, and a neural cost model trained through a differentiable Sinkhorn forward pass\. Applied to 283,016 learner trips across 23,820 observed flows in the most populated region, the framework estimates a subsidy\-equivalent distance,λ\(k\)\\lambda^\{\(k\)\}, interpreted as the kilometers of perceived travel cost offset by the subsidy\. The case demonstrates how administrative origin\-destination data can be transformed into interpretable planning metrics for accessibility\-aware subsidy design, facility siting, and urban service allocation\.
## 1 Introduction
Many urban services are delivered through mixed networks of public and private institutions\. Education, health care, and social services increasingly depend on subsidies and distributed facilities that ask households to choose among spatially uneven options\. In such systems, access is determined not only by nominal price or proximity to the nearest facility, but by a latent cost function through which households trade off distance, affordability, and institutional quality\. However, planners typically observe the resulting origin\-destination flows but not the behavioral cost surface that produced them\.
School choice provides a concrete instance of this problem\. In the Philippines, the largest national education subsidy program funds enrollment in participating private junior high schools, partly to relieve congestion in overcrowded public schools\. Yet a subsidy can only decongest the public system if the schools it makes affordable are also spatially reachable\. Existing approaches model flows with forward gravity or discrete\-choice models\[[6](https://arxiv.org/html/2606.14157#bib.bib6)\], which are useful for prediction but do not directly answer the planning question that matters:*how many kilometers of perceived access does a subsidy buy, and does that value change across spatial regimes?*
We address this gap with inverse optimal transport \(OT\)\. Given observed school\-to\-school flows, we recover the cost function under which those flows are plausible and translate recovered costs into a policy\-facing measure of subsidy reach\. The paper makes three contributions\. First, we introduce two complementary inverse OT estimators: an interpretable distance\-banded piecewise model with explicit subsidy terms, and a neural cost model trained through a differentiable Sinkhorn forward pass\. Second, we demonstrate the framework on large\-scale Philippine school\-choice flows as a case study of subsidy\-mediated access in a mixed public–private service network\. Third, we derive the subsidy\-equivalent distanceλ\(k\)\\lambda^\{\(k\)\}, which measures how many kilometers of perceived travel cost a subsidy offsets in each distance band — a metric directly usable for subsidy calibration, facility placement, and accessibility\-aware service allocation\.
## 2 Method and Data
Figure 1:Recovered distance\-cost sensitivity\. Horizontal segments show piecewise MAP estimates; neural curves showdc/dddc/ddat zero subsidy, the median positive subsidy of 9,000 pesos, and the maximum subsidy of 13,000 pesos\. The neural model improves fit by 13\.7% and suggests a short\-range distance–subsidy interaction rather than a sharp long\-range threshold\.LetTobsT\_\{\\mathrm\{obs\}\}be the observed school\-to\-school learner flow matrix, normalized as a transport plan with origin marginals𝐩\\mathbf\{p\}and destination marginals𝐪\\mathbf\{q\}\. Given a cost matrixCC, the forward model is the entropic OT solution
T^=Sinkhorn\(𝐩,𝐪,C,ε\),ε=0\.1\.\\hat\{T\}=\\operatorname\{Sinkhorn\}\(\\mathbf\{p\},\\mathbf\{q\},C,\\varepsilon\),\\qquad\\varepsilon=0\.1\.The inverse problem estimates the cost function that minimizes
Φ=‖Tobs−T^‖F22σ2\.\\Phi=\\frac\{\\\|T\_\{\\mathrm\{obs\}\}\-\\hat\{T\}\\\|\_\{F\}^\{2\}\}\{2\\sigma^\{2\}\}\.
We estimate two complementary cost models\. The first is an interpretable piecewise model,
cij=θd\(k\(dij\)\)dij\+θeej,c\_\{ij\}=\\theta\_\{d\}^\{\(k\(d\_\{ij\}\)\)\}d\_\{ij\}\+\\theta\_\{e\}e\_\{j\},wheredijd\_\{ij\}is road\-network distance,eje\_\{j\}is the destination subsidy in thousands of pesos, andk\(dij\)k\(d\_\{ij\}\)indexes 0–5, 5–15, and 15–50 km bands\. The policy quantity is
λ\(k\)=−θeθd\(k\),\\lambda^\{\(k\)\}=\-\\frac\{\\theta\_\{e\}\}\{\\theta\_\{d\}^\{\(k\)\}\},interpreted as kilometers of perceived travel cost offset by a 1,000\-peso subsidy increase\. The second model is a neural cost function,cij=fw\(dij,ej\)c\_\{ij\}=f\_\{w\}\(d\_\{ij\},e\_\{j\}\), estimated by backpropagating through the differentiable Sinkhorn operator\.
The case study uses data from the Philippine Department of Education for school years 2022\-2024 in the most populous region\. We aggregate individual records to school\-to\-school OD flows and link destinations to school coordinates, road\-network distances, and subsidy amounts\. The working matrix contains 4,200 origin schools, 1,861 destination schools, 1,852,177 feasible OD pairs within 50 km, and 23,820 observed positive OD pairs representing 283,016 learner trips\. All flows are aggregate; no individual learner is identifiable\.
## 3 Preliminary Results
The piecewise model was estimated by GPU\-accelerated maximum a posteriori \(MAP\) optimization with a log\-domain Sinkhorn forward pass\. The likelihood scale was calibrated so that the initial parameter setting hadΦ=5\.00\\Phi=5\.00; the piecewise MAP model reduced this toΦ\(θMAP\)=3\.29\\Phi\(\\theta\_\{\\mathrm\{MAP\}\}\)=3\.29\. The estimated coefficients areθd\(1\)=0\.185\\theta\_\{d\}^\{\(\\text\{1\}\)\}=0\.185,θd\(2\)=0\.163\\theta\_\{d\}^\{\(\\text\{2\}\)\}=0\.163,θd\(3\)=0\.994\\theta\_\{d\}^\{\(\\text\{3\}\)\}=0\.994, andθe=−0\.989\\theta\_\{e\}=\-0\.989\. These imply subsidy\-equivalent distances ofλ\(1\)=5\.35\\lambda^\{\(\\text\{1\}\)\}=5\.35km,λ\(2\)=6\.07\\lambda^\{\(\\text\{2\}\)\}=6\.07km, andλ\(3\)=1\.00\\lambda^\{\(\\text\{3\}\)\}=1\.00km per 1,000 pesos\. For example, in the 5–15 km band, a 1,000\-peso increase in subsidy offsets roughly 6\.07 km of perceived travel cost; the subsidy makes a farther school appear closer in the recovered choice\-cost function, not that learners physically travel less\.
The neural inverse OT model improves fit, achievingΦ\(w∗\)=2\.84\\Phi\(w^\{\*\}\)=2\.84, a 13\.7% reduction relative to the piecewise model\. Figure[1](https://arxiv.org/html/2606.14157#S2.F1)compares the piecewise coefficients with the neural distance derivative,dc/dddc/dd, evaluated at no subsidy, the median positive subsidy of 9,000 pesos, and the maximum subsidy of 13,000 pesos\. At zero subsidy, neural distance sensitivity is smooth and low, ranging from 0\.083 to 0\.196\. At the median positive subsidy, it ranges from 0\.083 to 0\.736; at the maximum subsidy, from 0\.080 to 0\.612\. In both subsidized cases, the largest values occur at very short distances and flatten over medium and longer ranges\.
These results show why the two\-model design matters\. The piecewise model provides an interpretable planning metric,λ\(k\)\\lambda^\{\(k\)\}, while the neural model reveals a finer\-grained distance–subsidy interaction\. In particular, the neural derivative does not reproduce the sharp long\-range increase implied by the broad 15–50 km piecewise band, suggesting that some apparent long\-distance friction may reflect band aggregation\.
## 4 Discussion and Impact on Urban Systems
The central planning implication is that a subsidy has a spatial footprint\. Its effect depends not only on the nominal amount, but also on where subsidized facilities are located relative to demand and how distance\-sensitive households are in different parts of the network\. In the Philippine school\-choice case, a uniform subsidy may therefore produce unequal accessibility gains: effective where participating schools are nearby, weaker where subsidized capacity is spatially mismatched with congested public\-school catchments\.
The framework generalizes beyond education\. Health facility choice, transit ridership, subsidized housing search, market access, and evacuation behavior can all be represented as OD matrices with latent spatial frictions\. Inverse OT provides a reusable Urban AI approach for learning interpretable behavioral costs from administrative flow data, supporting subsidy design, facility siting, capacity allocation, and accessibility\-aware public\-service planning\.
## References
- \[1\]A\. Anas, “Discrete choice theory, information theory and the multinomial logit and gravity models,”*Transportation Research Part B*, vol\. 17, no\. 1, pp\. 13–23, 1983\.
- \[2\]M\. Cuturi, “Sinkhorn distances: Lightspeed computation of optimal transport,” in*NeurIPS*, 2013\.
- \[3\]A\. M\. Stuart and M\.\-T\. Wolfram, “Inverse optimal transport,”*SIAM Journal on Applied Mathematics*, vol\. 80, no\. 1, pp\. 599–619, 2020\.
- \[4\]G\. Peyré and M\. Cuturi, “Computational optimal transport,”*Foundations and Trends in Machine Learning*, vol\. 11, no\. 5–6, pp\. 355–607, 2019\.
- \[5\]P\. A\. Pathak and P\. Shi, “How well do structural demand models work? Counterfactual predictions in school choice,”*Journal of Econometrics*, vol\. 215, no\. 2, pp\. 687–721, 2020\.
- \[6\]S\. Bundoc, P\. Martinez, S\. Ibañez, E\. Legara, “Student flow modeling for school decongestion via stochastic gravity estimation and constrained spatial allocation,” in*Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining \(KDD ’26\)*, Jeju, Korea, 2026\.Similar Articles
Multimarginal flow matching with optimal transport potentials
Proposes OTP-FM, a novel method for multimarginal flow matching that uses optimal transport potentials to softly steer flows through intermediate marginals, achieving state-of-the-art performance on single-cell RNA sequencing, oceanographic, and meteorological datasets.
An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning
This paper introduces MMOT, an online mixture model learning framework based on optimal transport theory that addresses incremental learning with distributional shifts through dynamic centroid updates and improved class similarity estimation. The approach includes a Dynamic Preservation strategy to mitigate catastrophic forgetting and maintain class separability in latent space.
DOT-MoE: Differentiable Optimal Transport for MoEfication
DOT-MoE formulates dense layer decomposition as a differentiable optimal transport problem, enabling efficient training of sparse MoE models that retain 90% of original performance while reducing active parameters by 50%.
The Shadow Price of Reasoning: Economic Perspective on Optimal Budget Allocation for LLMs
This paper formulates LLM inference budget allocation as a constrained optimization problem, proposing CLEAR to reallocate resources from low-utility queries to those near emergence thresholds, achieving up to 3× accuracy improvement under tight budgets.
Optimal Transport-based Permutation-Invariant Bayesian Optimization of Offshore Wind Farm Layouts
The paper proposes a permutation-invariant Bayesian optimization method based on Optimal Transport for optimizing offshore wind farm layouts, which reduces computation time by half and yields better layouts compared to vanilla Bayesian optimization.