Minimising MCMC variance via diffusion limits, with an application to simulated tempering
classification
🧮 math.PR
keywords
varianceasymptoticlimitsmcmcresultssimulatedtemperingalgorithm
read the original abstract
We derive new results comparing the asymptotic variance of diffusions by writing them as appropriate limits of discrete-time birth-death chains which themselves satisfy Peskun orderings. We then apply our results to simulated tempering algorithms to establish which choice of inverse temperatures minimises the asymptotic variance of all functionals and thus leads to the most efficient MCMC algorithm.
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.