Twisted Schrödinger Bridge Matching

• URL: http://arxiv.org/abs/2607.16987v1
• Date: Sat, 18 Jul 2026 22:30:43 GMT
• Title: Twisted Schrödinger Bridge Matching
• Abstract summary: Diffusion-based Schrdinger bridge models have been proposed to approximate optimal transport dynamics between two prescribed boundary distributions.<n>We introduce Twisted Schrdinger Bridge Matching, a diffusion-based method designed to handle both continuous- and discrete-time potentials.
• Score: 34.126987447337534
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Over the past few years, diffusion-based Schrödinger bridge models have been proposed to approximate optimal transport dynamics between two prescribed boundary distributions, with successful applications to generative modeling. More precisely, these methods aim to estimate a path measure whose initial and terminal marginals match the two boundary distributions, while minimizing the Kullback-Leibler divergence with respect to a reference Markov process. In this work, we consider the generalized Schrödinger bridge problem, in which the reference process is a twisted Brownian motion, that is, a Feynman-Kac transform of a Brownian motion induced by a time-dependent differentiable potential. Building on the Iterative Markovian Fitting (IMF) paradigm, and in particular on its special case Diffusion Schrödinger Bridge Matching (DSBM), which corresponds to the zero potential case, we introduce Twisted Schrödinger Bridge Matching (TSBM), a diffusion-based method designed to handle both continuous- and discrete-time potentials. Unlike previous approaches, TSBM provides a rigorous extension of the IMF scheme to the generalized Schrödinger bridge problem. This derivation leads to a new bridge-matching loss that depends explicitly on the gradient of the potential and recovers the DSBM objective when the potential vanishes, yielding improved performance. We further introduce trajectory-based variance-reduction techniques that substantially stabilize optimization and may be useful beyond the present setting. Finally, we empirically demonstrate the benefits of TSBM for trajectory inference across increasingly high-dimensional settings, including crowd navigation and single-cell data. Code available at https://github.com/maxencenoble/twisted-sb-matching.

Related papers

• SDDBMs: Soft Denoising Diffusion Bridge Models [9.271715699156374]
  Diffusion bridge models leverage Doob's (h)-transform to construct transports between arbitrary endpoint distributions.<n>Most existing bridge models rely on hard endpoint conditioning, which forces the terminal state to match a prescribed target exactly.<n>We propose Soft Denoising Diffusion Bridge Models (SDDBMs), a framework that regularizes diffusion bridges directly at the level of their terminal constraints.
  arXiv  Detail & Related papers  (2026-08-09T09:19:46Z)
• Entropy Across the Bridge: Conditional-Marginal Discretization for Flow and Schrödinger Samplers [68.9946633641494]
  Flow matching and Schrdinger bridges define probability, yet their inference grids are usually or inherited from one-endpoint diffusion.<n>We derive a conditional-marginal entropy-rate objective for bridge-aware discretization, separating endpoint-conditioned bridge geometry from marginal flow evolution.<n>On EDM/CIFAR-10, the entropic time-discretization gives the best tested five-step FID (186.3 pm 4.0 versus 200.5 pm 2.9 for linear and 238.0 pm 5.3 for cosine)
  arXiv  Detail & Related papers  (2026-05-15T16:11:10Z)
• Branched Schrödinger Bridge Matching [45.105452288011726]
  We introduce Branched Schr"odinger Bridge Matching (BranchSBM), a novel framework that learns branched Schr"odinger bridges.<n>BranchSBM parameterizes multiple time-dependent velocity fields and growth processes, enabling the representation of population-level divergence into terminal distributions.<n>We show that BranchSBM is not only more expressive but also essential for tasks involving multi-path surface navigation, modeling cell fate bifurcations from homogeneous progenitor states, and simulating diverging cellular responses to perturbations.
  arXiv  Detail & Related papers  (2025-06-10T17:29:48Z)
• Single-Step Bidirectional Unpaired Image Translation Using Implicit Bridge Consistency Distillation [55.45188329646137]
  Implicit Bridge Consistency Distillation (IBCD) enables single-step bidirectional unpaired translation without using adversarial loss.<n>IBCD achieves state-of-the-art performance on benchmark datasets in a single generation step.
  arXiv  Detail & Related papers  (2025-03-19T09:48:04Z)
• Bidirectional Diffusion Bridge Models [14.789137197695654]
  Diffusion bridges have shown potential in paired image-to-image (I2I) translation tasks.<n>Existing methods are limited by their unidirectional nature, requiring separate models for forward and reverse translations.<n>We introduce the Bidirectional Diffusion Bridge Model (BDBM), a scalable approach that facilitates bidirectional translation between two coupled distributions.
  arXiv  Detail & Related papers  (2025-02-12T04:43:02Z)
• Latent Schrodinger Bridge: Prompting Latent Diffusion for Fast Unpaired Image-to-Image Translation [58.19676004192321]
  Diffusion models (DMs), which enable both image generation from noise and inversion from data, have inspired powerful unpaired image-to-image (I2I) translation algorithms. We tackle this problem with Schrodinger Bridges (SBs), which are differential equations (SDEs) between distributions with minimal transport cost. Inspired by this observation, we propose Latent Schrodinger Bridges (LSBs) that approximate the SB ODE via pre-trained Stable Diffusion. We demonstrate that our algorithm successfully conduct competitive I2I translation in unsupervised setting with only a fraction of cost required by previous DM-
  arXiv  Detail & Related papers  (2024-11-22T11:24:14Z)
• BM$^2$: Coupled Schrödinger Bridge Matching [4.831663144935879]
  We propose a non-iterative approach for learning Schr"odinger bridges with neural networks.<n>A preliminary theoretical analysis of the convergence properties of BM$2$ is carried out, supported by numerical experiments.
  arXiv  Detail & Related papers  (2024-09-14T08:57:46Z)
• Plug-in estimation of Schrödinger bridges [15.685006881635209]
  We propose a procedure for estimating the Schr"odinger bridge between two probability distributions. We show that our proposal, which we call the emphSinkhorn bridge, provably estimates the Schr"odinger bridge with a rate of convergence that depends on the intrinsic dimensionality of the target measure.
  arXiv  Detail & Related papers  (2024-08-21T15:07:25Z)
• Adversarial Schrödinger Bridge Matching [66.39774923893103]
  Iterative Markovian Fitting (IMF) procedure alternates between Markovian and reciprocal projections of continuous-time processes. We propose a novel Discrete-time IMF (D-IMF) procedure in which learning of processes is replaced by learning just a few transition probabilities in discrete time. We show that our D-IMF procedure can provide the same quality of unpaired domain translation as the IMF, using only several generation steps instead of hundreds.
  arXiv  Detail & Related papers  (2024-05-23T11:29:33Z)
• Light and Optimal Schrödinger Bridge Matching [67.93806073192938]
  We propose a novel procedure to learn Schr"odinger Bridges (SB) which we call the textbf Schr"odinger bridge matching. We show that the optimal bridge matching objective coincides with the recently discovered energy-based modeling (EBM) objectives to learn EOT/SB. We develop a light solver (which we call LightSB-M) to implement optimal matching in practice using the mixture parameterization of the Schr"odinger potential.
  arXiv  Detail & Related papers  (2024-02-05T17:17:57Z)
• Generalized Schrödinger Bridge Matching [54.171931505066]
  Generalized Schr"odinger Bridge (GSB) problem setup is prevalent in many scientific areas both within and without machine learning. We propose Generalized Schr"odinger Bridge Matching (GSBM), a new matching algorithm inspired by recent advances. We show that such a generalization can be cast as solving conditional optimal control, for which variational approximations can be used.
  arXiv  Detail & Related papers  (2023-10-03T17:42:11Z)
• Transport meets Variational Inference: Controlled Monte Carlo Diffusions [5.5654189024307685]
  We present a principled and systematic framework for sampling and generative modelling centred around divergences on path space. Our work culminates in the development of the emphControlled Monte Carlo Diffusion sampler (CMCD) for Bayesian computation.
  arXiv  Detail & Related papers  (2023-07-03T14:28:36Z)
• Aligned Diffusion Schrödinger Bridges [41.95944857946607]
  Diffusion Schr"odinger bridges (DSBs) have recently emerged as a powerful framework for recovering dynamics via their marginal observations at different time points. Existing algorithms for solving DSBs have so far failed to utilize the structure of aligned data. We propose a novel algorithmic framework that, for the first time, solves DSBs while respecting the data alignment.
  arXiv  Detail & Related papers  (2023-02-22T14:55:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.