Selecting the Metric in Hamiltonian Monte Carlo

05/28/2019
by   Ben Bales, et al.
0

We present a selection criterion for the Euclidean metric adapted during warmup in a Hamiltonian Monte Carlo sampler that makes it possible for a sampler to automatically pick the metric based on the model and the availability of warmup draws. Additionally, we present a new adaptation inspired by the selection criterion that requires significantly fewer warmup draws to be effective. The effectiveness of the selection criterion and adaptation are demonstrated on a number of applied problems. An implementation for the Stan probabilistic programming language is provided.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2019

Maximizing conditional entropy of Hamiltonian Monte Carlo sampler

The performance of Hamiltonian Monte Carlo (HMC) sampler depends critica...
research
08/23/2018

Adaptive Tuning Of Hamiltonian Monte Carlo Within Sequential Monte Carlo

Sequential Monte Carlo (SMC) samplers form an attractive alternative to ...
research
05/26/2021

Lessons Learned and Improvements when Building Screen-Space Samplers with Blue-Noise Error Distribution

Recent work has shown that the error of Monte-Carlo rendering is visuall...
research
02/25/2017

Monte Carlo Action Programming

This paper proposes Monte Carlo Action Programming, a programming langua...
research
06/05/2023

Gibbs Sampling the Posterior of Neural Networks

In this paper, we study sampling from a posterior derived from a neural ...
research
09/21/2021

Flexible and efficient Bayesian pharmacometrics modeling using Stan and Torsten, Part I

Stan is an open-source probabilistic programing language, primarily desi...
research
11/29/2022

Bayesian Experimental Design for Symbolic Discovery

This study concerns the formulation and application of Bayesian optimal ...

Please sign up or login with your details

Forgot password? Click here to reset