Data-to-Energy Stochastic Dynamics
Kirill Tamogashev, Nikolay Malkin
Abstract
The Schrödinger bridge problem is concerned with finding a stochastic dynamical system bridging two marginal distributions that minimises a certain transportation cost. This problem, which represents a generalisation of optimal transport to the stochastic case, has received attention due to its connections to diffusion models and flow matching, as well as its applications in the natural sciences. However, all existing algorithms enable the inference of such dynamics only for cases where samples from both distributions are available. In this paper, we propose the first general method for modelling Schrödinger bridges when one (or both) distributions are given by their unnormalised densities, with no access to data samples. Our algorithm relies on a generalisation of the iterative proportional fitting (IPF) procedure to the data-free case, inspired by recent developments in off-policy reinforcement learning for training of diffusion samplers. We demonstrate the efficacy of the proposed data-to-energy IPF on synthetic problems, finding that it can successfully learn transports between multimodal distributions. As a secondary consequence of our reinforcement learning formulation, which assumes a fixed time discretisation scheme for the dynamics, we find that existing data-to-data Schrödinger bridge algorithms can be substantially improved by learning the diffusion coefficient of the dynamics. Finally, we apply the newly developed algorithm to the problem of sampling posterior distributions in latent spaces of generative models, thus creating a data-free image-to-image translation method.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext fdea7f5c-c4b3-426c-a2bf-6b49a97e4d8aCited by top-tier papers2
- FLAC: Maximum Entropy RL via Kinetic Energy Regularized Bridge MatchingLei Lyu, Yunfei Li, Yu Luo, Fuchun Sun et al.ICML 2026 · 5 citations
- Discrete Diffusion Samplers and Bridges: Off-Policy Algorithms and Applications in Latent SpacesArran Carter, Sanghyeok Choi, Kirill Tamogashev, Víctor Elvira et al.ICML 2026 · 1 citation
Builds on26
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 35,902 citations
- Diffusion Models Beat GANs on Image SynthesisPrafulla Dhariwal, Alexander Quinn NicholNeurIPS 2021 · 13,211 citations
- High-Resolution Image Synthesis with Latent Diffusion ModelsRobin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser et al.CVPR 2022 · 13,123 citations
- Alias-Free Generative Adversarial NetworksTero Karras, Miika Aittala, Samuli Laine, Erik Härkönen et al.NeurIPS 2021 · 2,126 citations
- DiffWave: A Versatile Diffusion Model for Audio SynthesisZhifeng Kong, Wei Ping, Jiaji Huang, Kexin Zhao et al.ICLR 2021 · 1,902 citations
Related papers
- Diffusion Schrödinger Bridge with Applications to Score-Based Generative ModelingValentin De Bortoli, James Thornton, Jeremy Heng, Arnaud DoucetNeurIPS 2021 · 811 citations
- Diffusion & Adversarial Schrödinger Bridges via Iterative Proportional Markovian FittingSergei Kholkin, Grigoriy Ksenofontov, David Li, Nikita Kornilov et al.ICLR 2026 · 6 citations
- Adversarial Schrödinger Bridge MatchingNikita Gushchin, Daniil Selikhanovych, Sergei Kholkin, Evgeny Burnaev et al.NeurIPS 2024 · 14 citations
- Schrödinger Bridge Matching for Tree-Structured Costs and Entropic Wasserstein BarycentresSamuel Howard, Peter Potaptchik, George DeligiannidisNeurIPS 2025 · 4 citations
- Diffusion Schrödinger Bridge MatchingYuyang Shi, Valentin De Bortoli, Andrew Campbell, Arnaud DoucetNeurIPS 2023 · 178 citations
