Transport with Support: Data-Conditional Diffusion Bridges

Ella Tamir, Martin Trapp, Arno Solin
1/31/2023
cs.LG

No official code found. Best implementation: AaltoML/iterative-smoothing-bridge (5 stars, MIT, last commit 2023-11-24).

Abstract

The dynamic Schrödinger bridge problem provides an appealing setting for solving constrained time-series data generation tasks posed as optimal transport problems. It consists of learning non-linear diffusion processes using efficient iterative solvers. Recent works have demonstrated state-of-the-art results (eg. in modelling single-cell embryo RNA sequences or sampling from complex posteriors) but are limited to learning bridges with only initial and terminal constraints. Our work extends this paradigm by proposing the Iterative Smoothing Bridge (ISB). We integrate Bayesian filtering and optimal control into learning the diffusion process, enabling the generation of constrained stochastic processes governed by sparse observations at intermediate stages and terminal constraints. We assess the effectiveness of our method on synthetic and real-world data generation tasks and we show that the ISB generalises well to high-dimensional data, is computationally efficient, and provides accurate estimates of the marginals at intermediate and terminal times.

View on arXivView PDF

Code Implementations(1)

MIT

Code for 'Transport with Support: Data-Conditional Diffusion Bridges'

50PythonOct 30, 20232 years agoMIT
diffusion-modelsoptimal-transporttmlr

Similar Papers

Cite this paper

@article{tamir2023transport,
  title  = {Transport with Support: Data-Conditional Diffusion Bridges},
  author = {Ella Tamir and Martin Trapp and Arno Solin},
  year   = {2023},
  eprint = {2301.13636},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.13636v2}
}

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/2301.13636.svg)](https://codeofpaper.com/paper/2301.13636)

Discussion