We lifted 1 functions out of this paper's own repositories and ran 1 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| copy not recorded | — | 1 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| pad_t_like_x | Ran | this paper's copy was not recorded; identical code first harvested from atong01/conditional-flow-matching pointer only · get_code("9e320fdaa5a3063f") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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ödinger 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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2307.03672")
get_code_for_paper("2307.03672")
have("2307.03672")
Connect an agent — have() is free.