Metraipolis › archive › dc_60898ef31eeb

Simulation-free Unbalanced Dynamic Optimal Transport with General Growth Penalty — arXiv:2609.04710

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.04710
License (as archived)
CC0-1.0
Archived
2026-10-16T22:26:34.122Z
SHA-256 of the archived text
02c59204a60a905e514fb30b5c0eda30f5e61d6741079d1319221d75177c3cae
Stable URL of this page
https://metraipolis.com/documento/dc_60898ef31eeb

How to cite

Simulation-free Unbalanced Dynamic Optimal Transport with General Growth Penalty — arXiv:2609.04710 — arXiv (en), https://arxiv.org/abs/2609.04710 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_60898ef31eeb (Metraipolis archive dc_60898ef31eeb, sha256 02c59204a60a905e514fb30b5c0eda30f5e61d6741079d1319221d75177c3cae)
BibTeX
@misc{dc60898ef31eeb,
  title = {Simulation-free Unbalanced Dynamic Optimal Transport with General Growth Penalty — arXiv:2609.04710},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.04710},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_60898ef31eeb; sha256 02c59204a60a905e514fb30b5c0eda30f5e61d6741079d1319221d75177c3cae},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04710. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 \textbf{S}imulation-free \textbf{U}nbalanced \textbf{D}ynamic \textbf{O}ptimal 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.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-07 in cs.AI).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Quantitative Methods (q-bio.QM).
Pagina del lavoro: https://arxiv.org/abs/2609.04710 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T22:18:11.519Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).