English

Diffusion Generative Modelling for Divide-and-Conquer MCMC

Machine Learning 2024-06-18 v1 Machine Learning Computation

Abstract

Divide-and-conquer MCMC is a strategy for parallelising Markov Chain Monte Carlo sampling by running independent samplers on disjoint subsets of a dataset and merging their output. An ongoing challenge in the literature is to efficiently perform this merging without imposing distributional assumptions on the posteriors. We propose using diffusion generative modelling to fit density approximations to the subposterior distributions. This approach outperforms existing methods on challenging merging problems, while its computational cost scales more efficiently to high dimensional problems than existing density estimation approaches.

Keywords

Cite

@article{arxiv.2406.11664,
  title  = {Diffusion Generative Modelling for Divide-and-Conquer MCMC},
  author = {C. Trojan and P. Fearnhead and C. Nemeth},
  journal= {arXiv preprint arXiv:2406.11664},
  year   = {2024}
}

Comments

16 pages, 5 figures

R2 v1 2026-06-28T17:08:50.490Z