paper-with-me

Papers

Accelerating Markov Chain Monte Carlo sampling with diffusion models

2023-09-04 · N. T. Hunt-Smith, W. Melnitchouk, F. Ringer, N. Sato, A. W Thomas, M. J. White

Global fits of physics models require efficient methods for exploring high-dimensional and/or multimodal posterior functions. We introduce a novel method for accelerating Markov Chain Monte Carlo (MCMC) sampling by pairing a Metropolis-Hastings algorithm with a diffusion model that can draw global samples with the aim of approximating the posterior. We briefly review diffusion models in the context of image synthesis before providing a streamlined diffusion model tailored towards low-dimensional data arrays. We then present our adapted Metropolis-Hastings algorithm which combines local proposals with global proposals taken from a diffusion model that is regularly trained on the samples produced during the MCMC run. Our approach leads to a significant reduction in the number of likelihood evaluations required to obtain an accurate representation of the Bayesian posterior across several analytic functions, as well as for a physical example based on a global analysis of parton distribution functions. Our method is extensible to other MCMC techniques, and we briefly compare our method to similar approaches based on normalizing flows. A code implementation can be found at https://github.com/NickHunt-Smith/MCMC-diffusion.

📄 PDF Abstract BibTeX arXiv:2309.01454

Code (1)

nickhunt-smith/mcmc-diffusion 공식 구현

Tasks

Image Generation

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Accelerating Langevin Monte Carlo Sampling: A Large Deviations Analysis

2025-03-24 · Nian Yao, Pervez Ali, Xihua Tao, Lingjiong Zhu

Langevin algorithms are popular Markov chain Monte Carlo methods that are often used to solve high-dimensional large-scale sampling problems in machine learning. The most classical Langevin Monte Carlo algorithm is based…

A Parallel Evolutionary Multiple-Try Metropolis Markov Chain Monte Carlo Algorithm for Sampling Spatial Partitions

2020-07-22 · Wendy K. Tam Cho, Yan Y. Liu

We develop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampling spatial partitions that lie within a large and complex spatial state space. Our algorithm combines the advantages of evolutionary algorit…

Evolutionary Algorithms

Flow-based generative models for Markov chain Monte Carlo in lattice field theory

2019-04-26 · M. S. Albergo, G. Kanwar, P. E. Shanahan

A Markov chain update scheme using a machine-learned flow-based generative model is proposed for Monte Carlo sampling in lattice field theories. The generative model may be optimized (trained) to produce samples from a d…

Curved Markov Chain Monte Carlo for Network Learning

2021-10-07 · John Sigbeku, Emil Saucan, Anthea Monod

We present a geometrically enhanced Markov chain Monte Carlo sampler for networks based on a discrete curvature measure defined on graphs. Specifically, we incorporate the concept of graph Forman curvature into sampling …

On Gibbs Sampling Architecture for Labeled Random Finite Sets Multi-Object Tracking

2023-06-27 · Anthony Trezza, Donald J. Bucci Jr., Pramod K. Varshney

Gibbs sampling is one of the most popular Markov chain Monte Carlo algorithms because of its simplicity, scalability, and wide applicability within many fields of statistics, science, and engineering. In the labeled rand…

Multi-Object TrackingObject Tracking