mlsanityData to 7 Oct 2026

Trajectory Inference via Mean-field Langevin in Path Space

arXiv 2205.07146 ↗First posted 14 May 2022math.OC cs.LG stat.MLcited by 29

Not on the map. Why?

Abstract (arXiv)

Trajectory inference aims at recovering the dynamics of a population from snapshots of its temporal marginals. To solve this task, a min-entropy estimator relative to the Wiener measure in path space was introduced by Lavenant et al. arXiv:2102.09204, and shown to consistently recover the dynamics of a large class of drift-diffusion processes from the solution of an infinite dimensional convex optimization problem. In this paper, we introduce a grid-free algorithm to compute this estimator. Our method consists in a family of point clouds (one per snapshot) coupled via Schr"odinger bridges which evolve with noisy gradient descent. We study the mean-field limit of the dynamics and prove its global convergence to the desired estimator. Overall, this leads to an inference method with end-to-end theoretical guarantees that solves an interpretable model for trajectory inference. We also present how to adapt the method to deal with mass variations, a useful extension when dealing with single cell RNA-sequencing data where cells can branch and die.

Key facts. Cited by 29 papers in the map (data through 7 Oct 2026). Builds on 19 of its 45 references that are in the map. First posted on arXiv 14 May 2022.

Builds on

19 of 45 references.

References · 19

  1. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
  2. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  3. 2015Learning with a Wasserstein Losscited by 194
  4. 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
  5. 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 155
  6. 2018Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithmcited by 111
  7. 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 91
  8. 2022Mean-Field Langevin Dynamics: Exponential Convergence and Annealingcited by 60
  9. 2022Convex Analysis of the Mean Field Langevin Dynamicscited by 53
  10. 2019Mean-Field Langevin Dynamics and Energy Landscape of Neural Networkscited by 49
  11. 2019An Optimal Transport approach for the Schr"odinger bridge problem and convergence of Sinkhorn algorithmcited by 38
  12. 2021Towards a mathematical theory of trajectory inferencecited by 31
7 more
  1. 2019Analysis of a Two-Layer Neural Network via Displacement Convexitycited by 27
  2. 2020Super-efficiency of automatic differentiation for functions defined as a minimumcited by 24
  3. 2022An improved central limit theorem and fast convergence rates for entropic transportation costscited by 18
  4. 2017Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transportcited by 16
  5. 2021Regularized unbalanced optimal transport as entropy minimization with respect to branching Brownian motioncited by 10
  6. 2018An entropy minimization approach to second-order variational mean-field gamescited by 9
  7. 2016Analysis of k-Nearest Neighbor Distances with Application to Entropy Estimationcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 3; 2024: 7; 2025: 11; 2026: 7.

29 papers.

Sort:

By area:

  1. 2022Action Matching: Learning Stochastic Dynamics from Samplescited by 94
  2. 2023Deep Momentum Multi-Marginal Schr"odinger Bridgecited by 40
  3. 2024Learning stochastic dynamics from snapshots through regularized unbalanced optimal transportcited by 30
  4. 2024Partially Observed Trajectory Inference using Optimal Transport and a Dynamics Priorcited by 13
  5. 2025Modeling Cell Dynamics and Interactions with Unbalanced Mean Field Schr"odinger Bridgecited by 12
  6. 2023Wasserstein Mirror Gradient Flow as the limit of the Sinkhorn Algorithmcited by 10
  7. 2024Identifying Drift, Diffusion, and Causal Structure from Temporal Snapshotscited by 10
  8. 2025Trajectory Inference with Smooth Schr"odinger Bridgescited by 10
  9. 2025Variational Regularized Unbalanced Optimal Transport: Single Network, Least Actioncited by 10
  10. 2024Inferring biological processes with intrinsic noise from cross-sectional datacited by 9
  11. 2025Integrating Dynamical Systems Modeling with Spatiotemporal scRNA-seq Data Analysiscited by 9
  12. 2024Plug-in estimation of Schr"odinger bridgescited by 8
17 more
  1. 2026WFR-FM: Simulation-Free Dynamic Unbalanced Optimal Transportcited by 6
  2. 2023Stochastic force inference via density estimationcited by 5
  3. 2024Neural McKean-Vlasov Processes: Distributional Dependence in Diffusion Processescited by 4
  4. 2025Inferring stochastic dynamics with growth from cross-sectional datacited by 4
  5. 2025Mirror Mean-Field Langevin Dynamicscited by 3
  6. 2025Learning non-equilibrium diffusions with Schr"odinger bridges: from exactly solvable to simulation-freecited by 3
  7. 2025Gradient-flow SDEs have unique transient population dynamicscited by 2
  8. 2026Beyond Continuity: Simulation-free Reconstruction of Discrete Branching Dynamics from Single-cell Snapshotscited by 2
  9. 2026Relative Entropy Estimation in Function Space: Theory and Applications to Trajectory Inferencecited by 1
  10. 2026Thinned Mean Field Langevin Dynamicscited by 1
  11. 2024The Central Spanning Tree Problemcited by 0
  12. 2025Machine-Learned Sampling of Conditioned Path Measurescited by 0
  13. 2025Private Continuous-Time Synthetic Trajectory Generation via Mean-Field Langevin Dynamicscited by 0
  14. 2025Statistical Analysis of the Sinkhorn Iterations for Two-Sample Schr"odinger Bridge Estimationcited by 0
  15. 2026Learning biophysical models of gene regulation with probability flow matchingcited by 0
  16. 2026TracingFlow: A Simulation-Free Trajectory Inference Framework Based on Second-Order Dynamicscited by 0
  17. 2026Schr"odinger Bridges over Kinetic Swarming Modelscited by 0