Transport meets Variational Inference: Controlled Monte Carlo Diffusions
About
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.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Target Distribution Sampling | Funnel 10D | Sinkhorn Distance124.9 | 29 | |
| Toy target distribution sampling | GMM40 d = 50 | W2 (Entropy Regulated, eps=0.05)4.26e+3 | 18 | |
| Amortised Sampling | MoS d = 50 | Sinkhorn Cost1.85e+3 | 13 | |
| Amortised Sampling | GMM40 d = 50 | Sinkhorn Distance4.26e+3 | 12 | |
| Amortised Sampling | Robot4 d = 10 | Sinkhorn Distance3.71 | 12 | |
| Learning Continuous Target Distributions | MoS d = 50 | Sinkhorn Cost1.85e+3 | 11 | |
| Target Distribution Sampling | Many-Well 5D | Sinkhorn Distance0.51 | 11 |