A contrastive-divergence-based reward stabilizes reinforcement learning of position-dependent step sizes for gradient-based MCMC, beating constant-step tuning on most of 44 benchmark posteriors.
AutoStep: Locally adaptive involutive MCMC
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Many common Markov chain Monte Carlo (MCMC) kernels can be formulated using a deterministic involutive proposal with a step size parameter. Selecting an appropriate step size is often a challenging task in practice; and for complex multiscale targets, there may not be one choice of step size that works well globally. In this work, we address this problem with a novel class of involutive MCMC methods -- AutoStep MCMC -- that selects an appropriate step size at each iteration adapted to the local geometry of the target distribution. We prove that under mild conditions AutoStep MCMC is $\pi$-invariant, irreducible, and aperiodic, and obtain bounds on expected energy jump distance and cost per iteration. Empirical results examine the robustness and efficacy of our proposed step size selection procedure, and show that AutoStep MCMC is competitive with state-of-the-art methods in terms of effective sample size per unit cost on a range of challenging target distributions.
fields
stat.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Harnessing the Power of Reinforcement Learning for Adaptive MCMC
A contrastive-divergence-based reward stabilizes reinforcement learning of position-dependent step sizes for gradient-based MCMC, beating constant-step tuning on most of 44 benchmark posteriors.