mlsanityData to 7 Oct 2026

Simulation-free Unbalanced Dynamic Optimal Transport with General Growth Penalty

arXiv 2609.04710 ↗First posted 4 Sep 2026cs.LG cs.AI q-bio.QMcited by 0

Not on the map. Why?

Abstract (arXiv)

Inferring cellular dynamics from unpaired single-cell snapshots requires modeling both state transitions and population growth or death. Unbalanced dynamic optimal transport (UDOT) addresses this by penalizing growth along transport paths, making the choice of growth penalty a key way to encode biological priors on proliferation and apoptosis. However, existing UDOT solvers either rely on computationally expensive NeuralODE simulations or depend on analytical solutions of conditional paths, restricting their efficiency solely to quadratic penalties, i.e. Wasserstein-Fisher-Rao (WFR) geodesics. To enable an efficient UDOT solver for general growth penalties, we first show that concave growth penalties lead to degenerate solutions where growth and transport are separated. We then introduce Simulation-free Unbalanced Dynamic Optimal transport (SUDO), a simulation-free framework for UDOT with general non-quadratic convex growth penalties. SUDO learns the conditional paths and transport costs, solves the induced semi-coupling problem, and subsequently leverages unbalanced flow matching to achieve a simulation-free solution. On WFR benchmarks, SUDO matches the accuracy of efficient, analytical solution-driven algorithms while outperforming simulation-based methods in computational speed. Beyond WFR, SUDO supports asymmetric penalties that encode proliferation-dominant priors and produce more plausible trajectories and growth estimates on synthetic and single-cell datasets.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 52 references that are in the map. First posted on arXiv 4 Sep 2026.

Builds on

27 of 52 references.

References · 27

  1. 2022Flow Matching for Generative Modelingcited by 5,426
  2. 2018Neural Ordinary Differential Equationscited by 3,733
  3. 2022Building Normalizing Flows with Stochastic Interpolantscited by 964
  4. 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 935
  5. 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 835
  6. 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
  7. 2017The Deep Ritz method: A deep learning-based numerical algorithm for solving variational problemscited by 581
  8. 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 155
  9. 2023Diffusion Schr"odinger Bridge Matchingcited by 151
  10. 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
  11. 2023Simulation-free Schr"odinger bridges via score and flow matchingcited by 81
  12. 2024Metric Flow Matching for Smooth Interpolations on the Data Manifoldcited by 74
15 more
  1. 2022The Schr"odinger Bridge between Gaussian Measures has a Closed Formcited by 63
  2. 2022Manifold Interpolating Optimal-Transport Flows for Trajectory Inferencecited by 63
  3. 2023Unbalancedness in Neural Monge Maps Improves Unpaired Domain Translationcited by 32
  4. 2024Learning stochastic dynamics from snapshots through regularized unbalanced optimal transportcited by 30
  5. 2023GENOT: Entropic (Gromov) Wasserstein Flow Matching with Applications to Single-Cell Genomicscited by 27
  6. 2025Joint Velocity-Growth Flow Matching for Single-Cell Dynamics Modelingcited by 20
  7. 2025Curly Flow Matching for Learning Non-gradient Field Dynamicscited by 17
  8. 2022Neural Unbalanced Optimal Transport via Cycle-Consistent Semi-Couplingscited by 16
  9. 2025Multi-Marginal Stochastic Flow Matching for High-Dimensional Snapshot Data at Irregular Time Pointscited by 11
  10. 2021Regularized unbalanced optimal transport as entropy minimization with respect to branching Brownian motioncited by 10
  11. 2025Variational Regularized Unbalanced Optimal Transport: Single Network, Least Actioncited by 10
  12. 2025Taming Flow Matching with Unbalanced Optimal Transport into Fast Pansharpeningcited by 6
  13. 2026WFR-FM: Simulation-Free Dynamic Unbalanced Optimal Transportcited by 6
  14. 2026Beyond Continuity: Simulation-free Reconstruction of Discrete Branching Dynamics from Single-cell Snapshotscited by 2
  15. 2026MIOFlow 2.0: A unified framework for inferring cellular stochastic dynamics from single cell and spatial transcriptomics datacited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026WFR-MFM: One-Step Inference for Dynamic Unbalanced Optimal Transport
  2. 2026Multiscale Supervised Unbalanced Optimal Transport Flow Matching
  3. 2026Dynamic Generalized Gromov-Wasserstein Optimal Transport
  4. 2026TempoBridge: Source-Conditioned Flow Matching with Optimal Transport Couplings for Single-Cell Population Transitions
  5. 2026TracingFlow: A Simulation-Free Trajectory Inference Framework Based on Second-Order Dynamics
  6. 2026Branched Optimal Transport Amortization
  7. 2026Efficient Diffusion Models under Nonconvex Equality and Inequality constraints via Landing
  8. 2025The Curse of Conditions: Analyzing and Improving Optimal Transport for Conditional Flow-Based Generation