Skip to content

Data-to-Energy Stochastic Dynamics

Sep 2025 · arXiv.org · Vol abs/2509.26364 · 4 citations · 65 references
Computer Science

TL;DR

This paper proposes the first general method for modelling Schr\"odinger bridges when one (or both) distributions are given by their unnormalised densities, with no access to data samples, and applies 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.

Abstract

The Schr\"odinger 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 allow to infer such dynamics only for cases where samples from both distributions are available. In this paper, we propose the first general method for modelling Schr\"odinger 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\"odinger 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. Code: https://github.com/mmacosha/d2e-stochastic-dynamics

View source

Similar papers

Preprint Aug 2026

Self-supervised In-context Operator Learning for Stochastic Mean-Field Control

Stochastic mean-field control (MFC) provides a fundamental framework for coordinating large populations of interacting agents under uncertainty, with a wide range of applications. Existing numerical and deep-learning methods solve one MFC problem instance at a time and must be re-optimized whenever the task changes. In...

Suyi Gao, Mo Zhou, Rong-Jie Lai · 0 citations
Preprint Sep 2026

Stochastic optimisation method for estimating large deviations

A stochastic optimisation method was recently proposed to efficiently compute large deviation functions, used in statistical physics to characterise the fluctuations of nonequilibrium systems, modelled as Markov processes. The method, called LDSTOP, combines numerical techniques from control theory and machine learning...

Daniël W. H. Cloete, Hugo Touchette · 0 citations
#diffusion models Open access Sep 2026

Mean-field path-integral diffusion from samples to interacting agents

Moving probability distributions in the context of stochastic processes efficiently is central to modern generative modeling, uncertainty quantification, and control of large engineered systems. Most current methods generate temporal trajectories independently, leaving open whether the trajectories can cooperate throug...

M. Chertkov · 0 citations
#machine learning Preprint Oct 2026

Conditional Flow Matching for Transport Between Markov Processes

A flow matching based algorithm is formulated which learns a transport map from the source to target trajectory distribution, while preserving the Markov structure, which is consistent in the population limit and derive finite-sample error bounds under mixing time assumptions.

Syamantak Kumar, D. Nagaraj, Saptarshi Roy et al. · 0 citations
Preprint Sep 2026

Trajectory Optimization via Schr\"{o}dinger Bridge Sampling

We take a new look at the relation between finite-horizon trajectory optimization and Schr\"odinger bridge sampling. Viewed as inference, KL-regularized trajectory optimization is solved by sampling from a Gibbs--Boltzmann distribution whose energy is the trajectory cost, and the adjoint Schr\"odinger bridge sampler (A...

Mattia Mosso, Yang Liu, Heng Yang · 0 citations
Preprint Aug 2026

StocBench: A Benchmark for Generative Modeling of Stochastic Dynamics

While stochastic diffusion samplers such as DDPM better preserve the enstrophy spectrum during rollouts in the stochastic setting, deterministic samplers such as DDIM and DPM-2 show better spectral preservation in the deterministic setting.

S. Pfister, Benjamin J. Holzschuh, Nils Thuerey · 2 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.