Skip to content
Review

Leveraging generative models to assist Monte Carlo sampling

Aug 2026 · 0 citations
Mathematics Physics Computer Science

TL;DR

A new paradigm that has recently emerged at the interface of machine learning and computational statistical physics: the use of generative models as tools for sampling through flexible probabilistic models that can assist the sampling of distributions known only up to a normalization constant is explored.

Abstract

Sampling high-dimensional probability distributions is a central task in scientific computing, with applications ranging from Bayesian inference to statistical physics and molecular simulation. Despite decades of methodological developments, two major challenges remain: scaling to high dimensions and efficiently exploring multimodal distributions characterized by metastable states. Classical approaches such as Markov chain Monte Carlo, tempering methods, or enhanced sampling based on collective variables have achieved major successes, but they also face intrinsic limitations. This tutorial review explores a new paradigm that has recently emerged at the interface of machine learning and computational statistical physics: the use of generative models as tools for sampling. In this context, models such as normalizing flows and diffusion models are not used in their traditional data-driven setting, but rather as flexible probabilistic models that can assist the sampling of distributions known only up to a normalization constant. This manuscript reviews the early development of this rapidly evolving field and discusses several methodological directions, including exact samplers based on generative models and strategies to train such models in the absence of data. While an exhaustive survey of the literature is not attempted, we present a selection of key ideas and methods, along with a discussion of their strengths and limitations. The review is intended to be an accessible tutorial for both physics and machine learning audiences, and it aims to provide a starting point for researchers interested in exploring this exciting area of research.

View source

Similar papers

FUND: Density Flow for Sampling Unnormalised Distributions

Efficient sampling from Boltzmann distributions is central to modelling complex physical systems. Markov Chain Monte Carlo (MCMC) methods suffer from critical slowing down, high autocorrelation, and poor mode-mixing, limiting their scalability. Recent advances, like Boltzmann Generators, offer a promising alternative b...

V. Kanaujia, Vipul Arora · 1 citation
#machine learning Preprint Sep 2026

Bridging Stochastic Flow Maps and Boltzmann Generators with Normalizing Flows

Generating independent, equilibrium samples of molecular systems at scale remains a central obstacle in computational statistical mechanics. Boltzmann Generators address this by pairing a generative model with importance sampling to obtain consistent samples from the target distribution. We introduce Normalizing Flow F...

Louis Grenioux, Rui-Kang Ouyang, Lu-Huan Wu · 0 citations
#machine learning Preprint Sep 2026

Quenched Ensemble Sampling

Some of the sharpest challenges in sampling from the energy functions of physical systems arise at phase transitions, where the density of states changes abruptly and many sampling algorithms stall. Nested sampling is a particle method that traverses the density of states under a hard energy constraint and is known to...

D. Yallup · 0 citations
Preprint Aug 2026

Parameter estimation in Conditional Sequential Monte Carlo algorithms through Particle Learning

The p(parameter)-CSMC algorithm is proposed, which incorporates both parameter learning and ancestor sampling, leading to much better mixing properties compared to (particle) Gibbs sampling in settings where strong internal correlations may challenge effective exploration.

A. D. Palomares, G. Storvik · 0 citations
Open access Sep 2026

Nii-MALA: A Fast Metropolis-Adjusted Langevin Sampler with Radial Velocity Benchmarks

Nii-MALA is introduced, a high-performance C implementation of the Metropolis-Adjusted Langevin Algorithm, which leverages Message Passing Interface for parallelization and incorporates automatic differentiation backends for gradient evaluation and benchmark it against several other codes using radial velocity data fro...

Jia-Men Jiao, Sheng Jin, Wen-Xin Jiang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.