Adaptive Hamiltonian and Riemann Manifold Monte Carlo Samplers

In this paper we address the widely-experienced difficulty in tuning Hamiltonian-based Monte Carlo samplers. We develop an algorithm that allows for the adaptation of Hamiltonian and Riemann manifold Hamiltonian Monte Carlo samplers using Bayesian optimization that allows for infinite adaptation of...

Full description

Bibliographic Details
Main Authors: Wang, Z, Mohamed, S, de Freitas, N
Format: Conference item
Published: 2013
_version_ 1797052820272185344
author Wang, Z
Mohamed, S
de Freitas, N
author_facet Wang, Z
Mohamed, S
de Freitas, N
author_sort Wang, Z
collection OXFORD
description In this paper we address the widely-experienced difficulty in tuning Hamiltonian-based Monte Carlo samplers. We develop an algorithm that allows for the adaptation of Hamiltonian and Riemann manifold Hamiltonian Monte Carlo samplers using Bayesian optimization that allows for infinite adaptation of the parameters of these samplers. We show that the resulting sampling algorithms are ergodic, and demonstrate on several models and data sets that the use of our adaptive algorithms makes it is easy to obtain more efficient samplers, in some precluding the need for more complex models. Hamiltonian-based Monte Carlo samplers are widely known to be an excellent choice of MCMC method, and we aim with this paper to remove a key obstacle towards the more widespread use of these samplers in practice.
first_indexed 2024-03-06T18:36:02Z
format Conference item
id oxford-uuid:0b441faa-a239-4eb6-a9e1-d3acdd420807
institution University of Oxford
last_indexed 2024-03-06T18:36:02Z
publishDate 2013
record_format dspace
spelling oxford-uuid:0b441faa-a239-4eb6-a9e1-d3acdd4208072022-03-26T09:28:27ZAdaptive Hamiltonian and Riemann Manifold Monte Carlo SamplersConference itemhttp://purl.org/coar/resource_type/c_5794uuid:0b441faa-a239-4eb6-a9e1-d3acdd420807Department of Computer Science2013Wang, ZMohamed, Sde Freitas, NIn this paper we address the widely-experienced difficulty in tuning Hamiltonian-based Monte Carlo samplers. We develop an algorithm that allows for the adaptation of Hamiltonian and Riemann manifold Hamiltonian Monte Carlo samplers using Bayesian optimization that allows for infinite adaptation of the parameters of these samplers. We show that the resulting sampling algorithms are ergodic, and demonstrate on several models and data sets that the use of our adaptive algorithms makes it is easy to obtain more efficient samplers, in some precluding the need for more complex models. Hamiltonian-based Monte Carlo samplers are widely known to be an excellent choice of MCMC method, and we aim with this paper to remove a key obstacle towards the more widespread use of these samplers in practice.
spellingShingle Wang, Z
Mohamed, S
de Freitas, N
Adaptive Hamiltonian and Riemann Manifold Monte Carlo Samplers
title Adaptive Hamiltonian and Riemann Manifold Monte Carlo Samplers
title_full Adaptive Hamiltonian and Riemann Manifold Monte Carlo Samplers
title_fullStr Adaptive Hamiltonian and Riemann Manifold Monte Carlo Samplers
title_full_unstemmed Adaptive Hamiltonian and Riemann Manifold Monte Carlo Samplers
title_short Adaptive Hamiltonian and Riemann Manifold Monte Carlo Samplers
title_sort adaptive hamiltonian and riemann manifold monte carlo samplers
work_keys_str_mv AT wangz adaptivehamiltonianandriemannmanifoldmontecarlosamplers
AT mohameds adaptivehamiltonianandriemannmanifoldmontecarlosamplers
AT defreitasn adaptivehamiltonianandriemannmanifoldmontecarlosamplers