Pith. sign in

REVIEW 1 cited by

Multi-marginal Schr\"odinger Bridges with Iterative Reference Refinement

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 2408.06277 v4 pith:32QH7QJF submitted 2024-08-12 stat.ML cs.LGstat.ME

classification stat.MLcs.LGstat.ME
keywords timecelldatapointsreferencesingleacrossbridges
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Practitioners often aim to infer an unobserved population trajectory using sample snapshots at multiple time points. E.g., given single-cell sequencing data, scientists would like to learn how gene expression changes over a cell's life cycle. But sequencing any cell destroys that cell. So we can access data for any particular cell only at a single time point, but we have data across many cells. The deep learning community has recently explored using Schr\"odinger bridges (SBs) and their extensions in similar settings. However, existing methods either (1) interpolate between just two time points or (2) require a single fixed reference dynamic (often set to Brownian motion within SBs). But learning piecewise from adjacent time points can fail to capture long-term dependencies. And practitioners are typically able to specify a model family for the reference dynamic but not the exact values of the parameters within it. So we propose a new method that (1) learns the unobserved trajectories from sample snapshots across multiple time points and (2) requires specification only of a family of reference dynamics, not a single fixed one. We demonstrate the advantages of our method on simulated and real data.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Private Continuous-Time Synthetic Trajectory Generation via Mean-Field Langevin Dynamics

    cs.LG 2025-06 reject novelty 5.0 of 10

    A differentially private particle-gradient algorithm generates continuous-time synthetic trajectories from one snapshot per person, but its headline recovery rate applies only to a non-private infinite-particle idealization.

Pith tools