Policy Gradients for Optimal Parallel Tempering MCMC
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 1 of its 16 references that are in the map. First posted on arXiv 3 Sep 2024.
Builds on
1 of 16 references.
References · 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Accelerated Parallel Tempering via Neural Transports
- 2025Progressive Tempering Sampler with Diffusion
- 2026Parallel Tempering for Diffusion-Based Combinatorial Optimization
- 2026Markov Chain Monte Carlo with Diffusion Paths
- 2023Accelerating Markov Chain Monte Carlo sampling with diffusion models
- 2024Diffusion Generative Modelling for Divide-and-Conquer MCMC
- 2025Nonlocal Monte Carlo via Reinforcement Learning
- 2026Accelerating Discrete Diffusion Models with Parallel-In-Time Sampling