mlsanityData to 7 Oct 2026

Trajectory Inference with Smooth Schr"odinger Bridges

arXiv 2503.00530 ↗First posted 1 Mar 2025stat.ML cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Motivated by applications in trajectory inference and particle tracking, we introduce Smooth Schr"odinger Bridges. Our proposal generalizes prior work by allowing the reference process in the Schr"odinger Bridge problem to be a smooth Gaussian process, leading to more regular and interpretable trajectories in applications. Though na"ively smoothing the reference process leads to a computationally intractable problem, we identify a class of processes (including the Mat'ern processes) for which the resulting Smooth Schr"odinger Bridge problem can be lifted to a simpler problem on phase space, which can be solved in polynomial time. We develop a practical approximation of this algorithm that outperforms existing methods on numerous simulated and real single-cell RNAseq datasets. The code can be found at https://github.com/WanliHongC/SmoothSB

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 20 of its 50 references that are in the map. First posted on arXiv 1 Mar 2025.

Builds on

20 of 50 references.

References · 20

  1. 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
  2. 2019Machine Learning for Fluid Mechanicscited by 380
  3. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
  4. 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 155
  5. 2021Solving Schr"odinger Bridges via Maximum Likelihoodcited by 140
  6. 2022The Schr"odinger Bridge between Gaussian Measures has a Closed Formcited by 63
  7. 2022Manifold Interpolating Optimal-Transport Flows for Trajectory Inferencecited by 63
  8. 2022Entropic Neural Optimal Transport via Diffusion Processescited by 49
  9. 2023Deep Momentum Multi-Marginal Schr"odinger Bridgecited by 40
  10. 2022Trajectory Inference via Mean-field Langevin in Path Spacecited by 29
  11. 2021Wasserstein barycenters are NP-hard to computecited by 28
  12. 2019On the Complexity of Approximating Multimarginal Optimal Transportcited by 27
8 more
  1. 2024Multi-marginal Schr"odinger Bridges with Iterative Reference Refinementcited by 26
  2. 2020Fast and Smooth Interpolation on Wasserstein Spacecited by 21
  3. 2018Second order models for optimal transport and cubic splines on the Wasserstein spacecited by 19
  4. 2018Measure-valued spline curves: an optimal transport viewpointcited by 17
  5. 2020Polynomial-time algorithms for Multimarginal Optimal Transport problems with structurecited by 15
  6. 2024Efficient Trajectory Inference in Wasserstein Space Using Consecutive Averagingcited by 9
  7. 2022Wasserstein-Fisher-Rao Splinescited by 5
  8. 2020Learning Hidden Markov Models from Aggregate Observationscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 6; 2026: 4.

10 papers.