Transport meets Variational Inference: Controlled Monte Carlo Diffusions

Francisco Vargas, Shreyas Padhy, Denis Blessing, Nikolas Nusken
2/12/2026

No official code found. Best implementation: shreyaspadhy/CMCD (18 stars, MIT, last commit 2024-09-30).

Abstract

Connecting optimal transport and variational inference, 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 \emph{Controlled Monte Carlo Diffusion} sampler (CMCD) for Bayesian computation, a score-based annealing technique that crucially adapts both forward and backward dynamics in a diffusion model. On the way, we clarify the relationship between the EM-algorithm and iterative proportional fitting (IPF) for Schr{\"o}dinger bridges, deriving as well a regularised objective that bypasses the iterative bottleneck of standard IPF-updates. Finally, we show that CMCD has a strong foundation in the Jarzinsky and Crooks identities from statistical physics, and that it convincingly outperforms competing approaches across a wide array of experiments.

View on arXivView PDF

Code Implementations(1)

shreyaspadhy/CMCDCommunity100%
MIT

Implementing Controlled Monte Carlo Diffusions (ICLR 2024)

181Python, Jupyter NotebookFeb 14, 20242 years agoMIT

Similar Papers

Cite this paper

@article{vargas2026transport,
  title  = {Transport meets Variational Inference: Controlled Monte Carlo Diffusions},
  author = {Francisco Vargas and Shreyas Padhy and Denis Blessing and Nikolas Nusken},
  year   = {2026},
  eprint = {2307.01050},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2307.01050},
  journal = {ICLR 2023 2023}
}

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

Discussion