English

Policy Gradients for Optimal Parallel Tempering MCMC

Computation 2024-12-30 v2 Machine Learning Machine Learning

Abstract

Parallel tempering is a meta-algorithm for Markov Chain Monte Carlo that uses multiple chains to sample from tempered versions of the target distribution, enhancing mixing in multi-modal distributions that are challenging for traditional methods. The effectiveness of parallel tempering is heavily influenced by the selection of chain temperatures. Here, we present an adaptive temperature selection algorithm that dynamically adjusts temperatures during sampling using a policy gradient approach. Experiments demonstrate that our method can achieve lower integrated autocorrelation times compared to traditional geometrically spaced temperatures and uniform acceptance rate schemes on benchmark distributions.

Keywords

Cite

@article{arxiv.2409.01574,
  title  = {Policy Gradients for Optimal Parallel Tempering MCMC},
  author = {Daniel Zhao and Natesh S. Pillai},
  journal= {arXiv preprint arXiv:2409.01574},
  year   = {2024}
}

Comments

12 pages, 5 figures, accepted to ICML 2024 Workshop on Structured Probabilistic Inference & Generative Modeling

R2 v1 2026-06-28T18:32:08.781Z