MCMC: Bridging Rendering, Optimization and Generative AI
Not on the map. Why?
Abstract (arXiv)
Generative artificial intelligence (AI) has made unprecedented advances in vision language models over the past two years. During the generative process, new samples (images) are generated from an unknown high-dimensional distribution. Markov Chain Monte Carlo (MCMC) methods are particularly effective in drawing samples from such complex, high-dimensional distributions. This makes MCMC methods an integral component for models like EBMs, ensuring accurate sample generation. Gradient-based optimization is at the core of modern generative models. The update step during the optimization forms a Markov chain where the new update depends only on the current state. This allows exploration of the parameter space in a memoryless manner, thus combining the benefits of gradient-based optimization and MCMC sampling. MCMC methods have shown an equally important role in physically based rendering where complex light paths are otherwise quite challenging to sample from simple importance sampling techniques. A lot of research is dedicated towards bringing physical realism to samples (images) generated from diffusion-based generative models in a data-driven manner, however, a unified framework connecting these techniques is still missing. In this course, we take the first steps toward understanding each of these components and exploring how MCMC could potentially serve as a bridge, linking these closely related areas of research. Our course aims to provide necessary theoretical and practical tools to guide students, researchers and practitioners towards the common goal of generative physically based rendering. All Jupyter notebooks with demonstrations associated to this tutorial can be found on the project webpage: https://sinbag.github.io/mcmc/
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 35 references that are in the map. First posted on arXiv 10 Oct 2025.
Builds on
14 of 35 references.
References · 14
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
- 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,058
- 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,101
- 2021Variational Diffusion Modelscited by 1,153
- 2020Improved Techniques for Training Score-Based Generative Modelscited by 1,043
- 2019Sliced Score Matching: A Scalable Approach to Density and Score Estimationcited by 384
- 2022Understanding Diffusion Models: A Unified Perspectivecited by 340
- 2017A Conceptual Introduction to Hamiltonian Monte Carlocited by 209
- 2020Learning Energy-Based Models by Diffusion Recovery Likelihoodcited by 123
- 2015Bridging the Gap between Stochastic Gradient MCMC and Stochastic Optimizationcited by 17
- 2017Reversible Jump Metropolis Light Transport using Inverse Mappingscited by 3
2 more
- 2019Regeneration-enriched Markov processes with application to Monte Carlocited by 2
- 2016Charted Metropolis Light Transportcited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024Diffusion Generative Modelling for Divide-and-Conquer MCMC
- 2023Accelerating Markov Chain Monte Carlo sampling with diffusion models
- 2022Speed up the inference of diffusion models via shortcut MCMC sampling
- 2026Leveraging generative models to assist Monte Carlo sampling
- 2022Denoising MCMC for Accelerating Diffusion-Based Generative Models
- 2024Markovian Flow Matching: Accelerating MCMC with Continuous Normalizing Flows
- 2022Accelerating Score-based Generative Models with Preconditioned Diffusion Sampling
- 2023MCMC-Correction of Score-Based Diffusion Models for Model Composition