Adaptive Tuning Of Hamiltonian Monte Carlo Within Sequential Monte Carlo

08/23/2018
by   Alexander Buchholz, et al.
0

Sequential Monte Carlo (SMC) samplers form an attractive alternative to MCMC for Bayesian computation. However, their performance depends strongly on the Markov kernels used to re- juvenate particles. We discuss how to calibrate automatically (using the current particles) Hamiltonian Monte Carlo kernels within SMC. To do so, we build upon the adaptive SMC ap- proach of Fearnhead and Taylor (2013), and we also suggest alternative methods. We illustrate the advantages of using HMC kernels within an SMC sampler via an extensive numerical study.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/19/2018

Inference with Hamiltonian Sequential Monte Carlo Simulators

The paper proposes a new Monte-Carlo simulator combining the advantages ...
research
06/30/2020

Simple conditions for convergence of sequential Monte Carlo genealogies with applications

Sequential Monte Carlo algorithms are popular methods for approximating ...
research
09/16/2020

Bayesian phase estimation with adaptive grid refinement

We introduce a novel Bayesian phase estimation technique based on adapti...
research
06/08/2015

Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Families

We propose Kernel Hamiltonian Monte Carlo (KMC), a gradient-free adaptiv...
research
05/28/2019

Selecting the Metric in Hamiltonian Monte Carlo

We present a selection criterion for the Euclidean metric adapted during...
research
09/10/2023

Variance Reduction of Resampling for Sequential Monte Carlo

A resampling scheme provides a way to switch low-weight particles for se...
research
10/10/2018

Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale

Hamiltonian Monte Carlo samplers have become standard algorithms for MCM...

Please sign up or login with your details

Forgot password? Click here to reset