Transport meets Variational Inference: Controlled Monte Carlo Diffusions
Francisco Vargas, Shreyas Padhy, Denis Blessing, Nikolas Nüsken
OpenReview ground truth
TL;DR — Connecting optimal transport and variational inference, we develop a score-based annealing technique for Bayesian computation.
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 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 Schroedinger 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.
Author context
Most prolific author: 2 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 36 comparisons
Ranked above opponent in 62% of matchups.
- ▲ beat Detect Every Thing with Few Examples ×10
- ▲ beat Sparse Autoencoders Find Highly Interpreta… ×8
- ▼ lost to Denoising Diffusion Bridge Models ×6
- ▼ lost to Last-Iterate Convergence Properties of Reg… ×6
- ▲ beat Block-local learning with probabilistic la… ×4
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 36)