Pith

open record

sign in

arxiv: 2410.18929 · v3 · pith:6W2Z47BT · submitted 2024-10-24 · stat.CO · cs.LG· stat.ML

AutoStep: Locally adaptive involutive MCMC

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:6W2Z47BTrecord.jsonopen to challenge →

classification stat.CO cs.LGstat.ML
keywords mcmcsizestepautostepinvolutiveappropriatechallengingcost
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.