mlsanityData to 7 Oct 2026

Estimating Latent Population Flows from Aggregated Data via Inversing Multi-Marginal Optimal Transport

arXiv 2212.14527 ↗First posted 30 Dec 2022cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

We study the problem of estimating latent population flows from aggregated count data. This problem arises when individual trajectories are not available due to privacy issues or measurement fidelity. Instead, the aggregated observations are measured over discrete-time points, for estimating the population flows among states. Most related studies tackle the problems by learning the transition parameters of a time-homogeneous Markov process. Nonetheless, most real-world population flows can be influenced by various uncertainties such as traffic jam and weather conditions. Thus, in many cases, a time-homogeneous Markov model is a poor approximation of the much more complex population flows. To circumvent this difficulty, we resort to a multi-marginal optimal transport (MOT) formulation that can naturally represent aggregated observations with constrained marginals, and encode time-dependent transition matrices by the cost functions. In particular, we propose to estimate the transition flows from aggregated data by learning the cost functions of the MOT framework, which enables us to capture time-varying dynamic patterns. The experiments demonstrate the improved accuracy of the proposed algorithms than the related methods in estimating several real-world transition flows.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 10 of its 29 references that are in the map. First posted on arXiv 30 Dec 2022.

Builds on

10 of 29 references.

References · 10

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2018Learning to Match via Inverse Optimal Transportcited by 22
  3. 2020Multi-marginal optimal transport and probabilistic graphical modelscited by 13
  4. 2020Learning Stochastic Behaviour from Aggregate Datacited by 12
  5. 2020SISTA: learning optimal transport costs under sparsity constraintscited by 7
  6. 2020Inference with Aggregate Data: An Optimal Transport Approachcited by 6
  7. 2021Scalable computation of dynamic flow problems via multi-marginal graph-structured optimal transportcited by 5
  8. 2019Estimating ensemble flows on a hidden Markov chaincited by 4
  9. 2020Learning Hidden Markov Models from Aggregate Observationscited by 3
  10. 2016Consistently Estimating Markov Chains with Noisy Aggregate Datacited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 3; 2025: 0; 2026: 2.

6 papers.