Pith. sign in

REVIEW 5 cited by

Simulation-free Schr\"odinger bridges via score and flow matching

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 2307.03672 v3 pith:AO5DLPHI submitted 2023-07-07 cs.LG

classification cs.LG
keywords dynamicsflowmatchingproblemsimulation-freestochasticcelldata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We present simulation-free score and flow matching ([SF]$^2$M), a simulation-free objective for inferring stochastic dynamics given unpaired samples drawn from arbitrary source and target distributions. Our method generalizes both the score-matching loss used in the training of diffusion models and the recently proposed flow matching loss used in the training of continuous normalizing flows. [SF]$^2$M interprets continuous-time stochastic generative modeling as a Schr\"odinger bridge problem. It relies on static entropy-regularized optimal transport, or a minibatch approximation, to efficiently learn the SB without simulating the learned stochastic process. We find that [SF]$^2$M is more efficient and gives more accurate solutions to the SB problem than simulation-based methods from prior work. Finally, we apply [SF]$^2$M to the problem of learning cell dynamics from snapshot data. Notably, [SF]$^2$M is the first method to accurately model cell dynamics in high dimensions and can recover known gene regulatory networks from simulated data. Our code is available in the TorchCFM package at https://github.com/atong01/conditional-flow-matching.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Feynman-Kac-Flow: Inference Steering of Conditional Flow Matching to an Energy-Tilted Posterior

    cs.LG 2025-09 conditional novelty 6.0 of 10

    Feynman-Kac particle steering, previously diffusion-only, is derived for conditional flow matching and used to generate chirality-correct chemical transition states.

  2. Beyond Optimal Transport: Model-Aligned Coupling for Flow Matching

    cs.CV 2025-05 conditional novelty 6.0 of 10

    MAC improves few-step flow-matching generation by up-weighting couplings with the lowest prediction error under the current model.

  3. Materials Behavior as Mechanism Ensembles: A Probabilistic Framework for Emergent Behaviors

    cond-mat.mtrl-sci 2026-07 conditional novelty 5.0 of 10

    Materials phenomena such as fatigue crack growth are framed as conditional probability landscapes over competing unit mechanisms, to be inferred from multiscale simulation and multimodal data and then optimized toward...

  4. 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.

  5. Bidirectional Diffusion Bridge Models

    cs.CV 2025-02 conditional novelty 5.0 of 10

    BDBM uses a single masked noise-prediction network to model both forward and backward diffusion bridges between two image distributions, enabling bidirectional translation at roughly half the model cost.

Pith tools