mlsanityData to 14 Oct 2026

Partially Observed Trajectory Inference using Optimal Transport and a Dynamics Prior

arXiv 2406.07475 ↗First posted 11 Jun 2024cs.LG stat.MLcited by 13

Not on the map. Why?

Abstract (arXiv)

Trajectory inference seeks to recover the temporal dynamics of a population from snapshots of its (uncoupled) temporal marginals, i.e. where observed particles are not tracked over time. Prior works addressed this challenging problem under a stochastic differential equation (SDE) model with a gradient-driven drift in the observed space, introducing a minimum entropy estimator relative to the Wiener measure and a practical grid-free mean-field Langevin (MFL) algorithm using Schr"odinger bridges. Motivated by the success of observable state space models in the traditional paired trajectory inference problem (e.g. target tracking), we extend the above framework to a class of latent SDEs in the form of observable state space models. In this setting, we use partial observations to infer trajectories in the latent space under a specified dynamics model (e.g. the constant velocity/acceleration models from target tracking). We introduce the PO-MFL algorithm to solve this latent trajectory inference problem and provide theoretical guarantees to the partially observed setting. Experiments validate the robustness of our method and the exponential convergence of the MFL dynamics, and demonstrate significant outperformance over the latent-free baseline in key scenarios.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 27 of its 74 references that are in the map. First posted on arXiv 11 Jun 2024.

Builds on

27 of 74 references.

References · 27

  1. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  3. 2018Computational Optimal Transportcited by 780
  4. 2021Score-based Generative Modeling in Latent Spacecited by 636
  5. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 292
  6. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 223
  7. 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 160
  8. 2014On the relation between optimal transport and Schr"odinger bridges: A stochastic control viewpointcited by 99
  9. 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 93
  10. 2022The Schr"odinger Bridge between Gaussian Measures has a Closed Formcited by 63
  11. 2022Mean-Field Langevin Dynamics: Exponential Convergence and Annealingcited by 61
  12. 2022Convex Analysis of the Mean Field Langevin Dynamicscited by 55
15 more
  1. 2019Mean-Field Langevin Dynamics and Energy Landscape of Neural Networkscited by 50
  2. 2019An Optimal Transport approach for the Schr"odinger bridge problem and convergence of Sinkhorn algorithmcited by 38
  3. 2022Trajectory Inference via Mean-field Langevin in Path Spacecited by 30
  4. 2019Analysis of a Two-Layer Neural Network via Displacement Convexitycited by 27
  5. 2022Uniform-in-time propagation of chaos for mean field Langevin dynamicscited by 23
  6. 2020Fast and Smooth Interpolation on Wasserstein Spacecited by 22
  7. 2023Latent Traversals in Generative Models as Potential Flowscited by 17
  8. 2023Flow Factorized Representation Learningcited by 11
  9. 2023Nonlinear Filtering with Brenier Optimal Transport Mapscited by 11
  10. 2024Latent Schr"odinger Bridge Diffusion Model for Generative Learningcited by 10
  11. 2018An entropy minimization approach to second-order variational mean-field gamescited by 9
  12. 2023Manifold learning in Wasserstein spacecited by 6
  13. 2020Feedback Particle Filter for Collective Inferencecited by 2
  14. 2023Manifold Learning with Sparse Regularised Optimal Transportcited by 2
  15. 2015Ensemble Observability of Linear Systemscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 7; 2026: 4.

13 papers.

Sort:

By area: