English
Related papers

Related papers: A Generalized Sinkhorn Algorithm for Mean-Field Sc…

200 papers

Mean-Field Game (MFG) serves as a crucial mathematical framework in modeling the collective behavior of individual agents interacting stochastically with a large population. In this work, we aim at solving a challenging class of MFGs in…

Machine Learning · Statistics 2022-09-21 Guan-Horng Liu , Tianrong Chen , Oswin So , Evangelos A. Theodorou

The Mean-Field Schrodinger Bridge (MFSB) problem is an optimization problem aiming to find the minimum effort control policy to drive a McKean-Vlassov stochastic differential equation from one probability measure to another. In the context…

Machine Learning · Computer Science 2025-06-19 George Rapakoulias , Ali Reza Pedram , Panagiotis Tsiotras

Solutions to the Schr\"{o}dinger bridge problem and its generalizations yield feedback control policies for optimal density steering over a controlled diffusion. To numerically compute the same, the dynamic Sinkhorn recursion has become a…

Optimization and Control · Mathematics 2026-04-28 Georgiy A. Bondar , Asmaa Eldesoukey , Yongxin Chen , Abhishek Halder

Schr\"{o}dinger bridge can be viewed as a continuous-time stochastic control problem where the goal is to find an optimally controlled diffusion process whose terminal distribution coincides with a pre-specified target distribution. We…

Machine Learning · Statistics 2024-04-23 Jhanvi Garg , Xianyang Zhang , Quan Zhou

The Iterative Markovian Fitting (IMF) procedure, which iteratively projects onto the space of Markov processes and the reciprocal class, successfully solves the Schr\"odinger Bridge (SB) problem. However, an efficient practical…

The Schr\"odinger Bridge (SB) problem offers a powerful framework for combining optimal transport and diffusion models. A promising recent approach to solve the SB problem is the Iterative Markovian Fitting (IMF) procedure, which alternates…

Machine Learning · Computer Science 2024-11-06 Nikita Gushchin , Daniil Selikhanovych , Sergei Kholkin , Evgeny Burnaev , Alexander Korotin

Understanding the continuous evolution of populations from discrete temporal snapshots is a critical research challenge, particularly in fields like developmental biology and systems medicine where longitudinal tracking of individual…

Machine Learning · Statistics 2025-10-21 Byoungwoo Park , Juho Lee

A computational PDE-constrained optimization approach is proposed for optimal trajectory planning under uncertainty by means of an associated Schroedinger Bridge Problem (SBP). The proposed SBP formulation is interpreted as the mean-field…

Optimization and Control · Mathematics 2026-05-20 Dante Kalise , Wenxin Liu

Progressively applying Gaussian noise transforms complex data distributions to approximately Gaussian. Reversing this dynamic defines a generative model. When the forward noising process is given by a Stochastic Differential Equation (SDE),…

Machine Learning · Statistics 2023-04-06 Valentin De Bortoli , James Thornton , Jeremy Heng , Arnaud Doucet

Modern distribution matching algorithms for training diffusion or flow models directly prescribe the time evolution of the marginal distributions between two boundary distributions. In this work, we consider a generalized distribution…

Recent advancements in diffusion bridges for distribution transport problems have heavily relied on matching frameworks, yet existing methods often face a trade-off between scalability and access to optimal pairings during training. Fully…

The Schr\"odinger Bridge (SB) problem has become a fundamental tool in computational optimal transport and generative modeling. To address this problem, ideal methods such as Iterative Proportional Fitting and Iterative Markovian Fitting…

Machine Learning · Statistics 2025-10-27 Marta Gentiloni Silveri , Giovanni Conforti , Alain Durmus

Diffusion Schr\"odinger bridges (DSB) have recently emerged as a powerful framework for recovering stochastic dynamics via their marginal observations at different time points. Despite numerous successful applications, existing algorithms…

Solving transport problems, i.e. finding a map transporting one given distribution to another, has numerous applications in machine learning. Novel mass transport methods motivated by generative modeling have recently been proposed, e.g.…

Machine Learning · Statistics 2023-12-13 Yuyang Shi , Valentin De Bortoli , Andrew Campbell , Arnaud Doucet

In this paper, we study the Schr\"odinger Bridge Problem (SBP), which is central to entropic optimal transport. For general reference processes and begin--endpoint distributions, we propose a forward-reverse iterative Monte Carlo procedure…

Machine Learning · Statistics 2025-07-02 Denis Belomestny , John. Schoenmakers

This paper introduces a novel theoretical simplification of the Diffusion Schr\"odinger Bridge (DSB) that facilitates its unification with Score-based Generative Models (SGMs), addressing the limitations of DSB in complex data generation…

Machine Learning · Computer Science 2024-10-30 Zhicong Tang , Tiankai Hang , Shuyang Gu , Dong Chen , Baining Guo

In 1931/32, Schroedinger studied a hot gas Gedankenexperiment, an instance of large deviations of the empirical distribution and an early example of the so-called maximum entropy inference method. This so-called Schroedinger bridge problem…

Optimization and Control · Mathematics 2020-11-30 Yongxin Chen , Tryphon T. Georgiou , Michele Pavon

The purpose of this note is to clarify the importance of the relation $\boldsymbol{gg}^{\top}\propto \boldsymbol{\sigma\sigma}^{\top}$ in solving control-affine Schr\"{o}dinger bridge problems via the Hopf-Cole transform, where…

Optimization and Control · Mathematics 2025-03-26 Alexis Teter , Abhishek Halder

Recent advances in flow-based generative modelling have provided scalable methods for computing the Schr\"odinger Bridge (SB) between distributions, a dynamic form of entropy-regularised Optimal Transport (OT) for the quadratic cost. The…

Machine Learning · Statistics 2025-11-04 Samuel Howard , Peter Potaptchik , George Deligiannidis

Consider a reference Markov process with initial distribution $\pi_{0}$ and transition kernels $\{M_{t}\}_{t\in[1:T]}$, for some $T\in\mathbb{N}$. Assume that you are given distribution $\pi_{T}$, which is not equal to the marginal…

Computation · Statistics 2020-01-01 Espen Bernton , Jeremy Heng , Arnaud Doucet , Pierre E. Jacob
‹ Prev 1 2 3 10 Next ›