arXiv AI

Dynamic Generalized Gromov-Wasserstein Optimal Transport

The paper introduces TP‑DATE, a dynamic framework that extends Gromov–Wasserstein optimal transport (GW‑OT) to reconstruct continuous trajectories without simulation. It formulates a broad class of static and dynamic Quadratic‑form OT (QOT) via path actions, proving static‑dynamic equivalence, and develops travelling‑pair flow matching to capture interacting conditional paths in a single vector field. Experiments on synthetic and real spatial transcriptomics data show that TP‑DATE better preserves spatial structure and improves 3D dynamics reconstruction.

Hugging Face Trending Papers
Sep 17

Dynamic Generalized Gromov-Wasserstein Optimal Transport

Dynamic Generalized Gromov-Wasserstein Optimal Transport extends classical optimal transport by incorporating structure-aware transport costs, which is especially relevant for spatial transcriptomics where preserving tissue structure is crucial. The paper introduces TP-DATE, a simulation-free framework that generalizes GW-OT dynamically, formulating static and dynamic Quadratic-form OT through path actions and proving their equivalence. TP-DATE employs travelling-pair flow matching to enable interacting conditional paths, resulting in better preservation of spatial structure and improved continuous 3D dynamics reconstruction on both synthetic and real spatial transcriptomics data.

arXiv Machine Learning
Aug 18

A Unified Geometric Framework for Developmental Analysis of Spatial Transcriptomic Data

arXiv:2608. 15306v1 Announce Type: cross Abstract: High-throughput single-cell and spatial transcriptomic technologies provide high-resolution snapshots of heterogeneous cellular states, but their destructive nature prevents repeated measurements of the same cells over time.

By Mary Chriselda Antony Oliver, Kaitlyn Hohmeier, Tuyen Tran, Alejandra Castillo, Caroline Moosm\"uller, Shiying Li
arXiv AI
Sep 7

Simulation-free Unbalanced Dynamic Optimal Transport with General Growth Penalty

The paper introduces SUDO, a simulation‑free framework for unbalanced dynamic optimal transport (UDOT) that supports general convex growth penalties beyond the quadratic Wasserstein‑Fisher‑Rao case. By showing that concave penalties lead to degenerate solutions, the authors focus on convex penalties, learning conditional paths and transport costs to solve a semi‑coupling problem and then applying unbalanced flow matching. On benchmark datasets, SUDO matches the accuracy of analytical WFR solvers while being faster than simulation‑based methods, and it also handles asymmetric penalties that better reflect proliferation‑dominant biological priors.

By Junda Ying, Yuxuan Wang, Bowen Yang, Peijie Zhou, Lei Zhang