Pith. sign in

REVIEW 2 cited by

TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamics

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.04461 v2 pith:P6J4FWVW submitted 2020-02-09 stat.ML cs.CVcs.LGq-bio.QM

classification stat.MLcs.CVcs.LGq-bio.QM
keywords optimalcontinuousdynamictransportcellulardatadynamicsmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

It is increasingly common to encounter data from dynamic processes captured by static cross-sectional measurements over time, particularly in biomedical settings. Recent attempts to model individual trajectories from this data use optimal transport to create pairwise matchings between time points. However, these methods cannot model continuous dynamics and non-linear paths that entities can take in these systems. To address this issue, we establish a link between continuous normalizing flows and dynamic optimal transport, that allows us to model the expected paths of points over time. Continuous normalizing flows are generally under constrained, as they are allowed to take an arbitrary path from the source to the target distribution. We present TrajectoryNet, which controls the continuous paths taken between distributions to produce dynamic optimal transport. We show how this is particularly applicable for studying cellular dynamics in data from single-cell RNA sequencing (scRNA-seq) technologies, and that TrajectoryNet improves upon recently proposed static optimal transport-based models that can be used for interpolating cellular distributions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Convex Relaxations for the Optimization of Markov Processes

    math.OC 2026-07 conditional novelty 6.0 of 10

    Sequential-coupling convex relaxations using local marginals and cluster moments solve high-dimensional Markov process optimization, recovering Benamou–Brenier dynamics and general kernels as special cases.

  2. Multi-marginal temporal Schr\"odinger Bridge Matching from unpaired data

    cs.LG 2025-10 reject novelty 5.0 of 10

    MMtSBM extends diffusion Schrödinger bridge matching to multiple time marginals via a factorized iterative Markovian fitting algorithm, claiming state-of-the-art trajectory inference and video generation from unpaired data.

Pith tools