On Approaches to Building Surrogate ODE Models for Diffusion Bridges

Maria Khilchuk, Vladimir Latypov, Pavel Kleshchev, Alexander Hvatov
12/14/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Diffusion and Schrödinger Bridge models have established state-of-the-art performance in generative modeling but are often hampered by significant computational costs and complex training procedures. While continuous-time bridges promise faster sampling, overparameterized neural networks describe their optimal dynamics, and the underlying stochastic differential equations can be difficult to integrate efficiently. This work introduces a novel paradigm that uses surrogate models to create simpler, faster, and more flexible approximations of these dynamics. We propose two specific algorithms: SINDy Flow Matching (SINDy-FM), which leverages sparse regression to identify interpretable, symbolic differential equations from data, and a Neural-ODE reformulation of the Schrödinger Bridge (DSBM-NeuralODE) for flexible continuous-time parameterization. Our experiments on Gaussian transport tasks and MNIST latent translation demonstrate that these surrogates achieve competitive performance while offering dramatic improvements in efficiency and interpretability. The symbolic SINDy-FM models, in particular, reduce parameter counts by several orders of magnitude and enable near-instantaneous inference, paving the way for a new class of tractable and high-performing bridge models for practical deployment.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{khilchuk2025approaches,
  title  = {On Approaches to Building Surrogate ODE Models for Diffusion Bridges},
  author = {Maria Khilchuk and Vladimir Latypov and Pavel Kleshchev and Alexander Hvatov},
  year   = {2025},
  eprint = {2512.12671},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.12671v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.12671.svg)](https://codeofpaper.com/paper/2512.12671)

Discussion