Cargando…

A Novel Hybrid Monte Carlo Algorithm for Sampling Path Space

To sample from complex, high-dimensional distributions, one may choose algorithms based on the Hybrid Monte Carlo (HMC) method. HMC-based algorithms generate nonlocal moves alleviating diffusive behavior. Here, I build on an already defined HMC framework, hybrid Monte Carlo on Hilbert spaces (Beskos...

Descripción completa

Detalles Bibliográficos
Autor principal: Pinski, Francis J.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8143484/
https://www.ncbi.nlm.nih.gov/pubmed/33922040
http://dx.doi.org/10.3390/e23050499
_version_ 1783696764464791552
author Pinski, Francis J.
author_facet Pinski, Francis J.
author_sort Pinski, Francis J.
collection PubMed
description To sample from complex, high-dimensional distributions, one may choose algorithms based on the Hybrid Monte Carlo (HMC) method. HMC-based algorithms generate nonlocal moves alleviating diffusive behavior. Here, I build on an already defined HMC framework, hybrid Monte Carlo on Hilbert spaces (Beskos, et al. Stoch. Proc. Applic. 2011), that provides finite-dimensional approximations of measures [Formula: see text] , which have density with respect to a Gaussian measure on an infinite-dimensional Hilbert (path) space. In all HMC algorithms, one has some freedom to choose the mass operator. The novel feature of the algorithm described in this article lies in the choice of this operator. This new choice defines a Markov Chain Monte Carlo (MCMC) method that is well defined on the Hilbert space itself. As before, the algorithm described herein uses an enlarged phase space [Formula: see text] having the target [Formula: see text] as a marginal, together with a Hamiltonian flow that preserves [Formula: see text]. In the previous work, the authors explored a method where the phase space [Formula: see text] was augmented with Brownian bridges. With this new choice, [Formula: see text] is augmented by Ornstein–Uhlenbeck (OU) bridges. The covariance of Brownian bridges grows with its length, which has negative effects on the acceptance rate in the MCMC method. This contrasts with the covariance of OU bridges, which is independent of the path length. The ingredients of the new algorithm include the definition of the mass operator, the equations for the Hamiltonian flow, the (approximate) numerical integration of the evolution equations, and finally, the Metropolis–Hastings acceptance rule. Taken together, these constitute a robust method for sampling the target distribution in an almost dimension-free manner. The behavior of this novel algorithm is demonstrated by computer experiments for a particle moving in two dimensions, between two free-energy basins separated by an entropic barrier.
format Online
Article
Text
id pubmed-8143484
institution National Center for Biotechnology Information
language English
publishDate 2021
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-81434842021-05-25 A Novel Hybrid Monte Carlo Algorithm for Sampling Path Space Pinski, Francis J. Entropy (Basel) Article To sample from complex, high-dimensional distributions, one may choose algorithms based on the Hybrid Monte Carlo (HMC) method. HMC-based algorithms generate nonlocal moves alleviating diffusive behavior. Here, I build on an already defined HMC framework, hybrid Monte Carlo on Hilbert spaces (Beskos, et al. Stoch. Proc. Applic. 2011), that provides finite-dimensional approximations of measures [Formula: see text] , which have density with respect to a Gaussian measure on an infinite-dimensional Hilbert (path) space. In all HMC algorithms, one has some freedom to choose the mass operator. The novel feature of the algorithm described in this article lies in the choice of this operator. This new choice defines a Markov Chain Monte Carlo (MCMC) method that is well defined on the Hilbert space itself. As before, the algorithm described herein uses an enlarged phase space [Formula: see text] having the target [Formula: see text] as a marginal, together with a Hamiltonian flow that preserves [Formula: see text]. In the previous work, the authors explored a method where the phase space [Formula: see text] was augmented with Brownian bridges. With this new choice, [Formula: see text] is augmented by Ornstein–Uhlenbeck (OU) bridges. The covariance of Brownian bridges grows with its length, which has negative effects on the acceptance rate in the MCMC method. This contrasts with the covariance of OU bridges, which is independent of the path length. The ingredients of the new algorithm include the definition of the mass operator, the equations for the Hamiltonian flow, the (approximate) numerical integration of the evolution equations, and finally, the Metropolis–Hastings acceptance rule. Taken together, these constitute a robust method for sampling the target distribution in an almost dimension-free manner. The behavior of this novel algorithm is demonstrated by computer experiments for a particle moving in two dimensions, between two free-energy basins separated by an entropic barrier. MDPI 2021-04-22 /pmc/articles/PMC8143484/ /pubmed/33922040 http://dx.doi.org/10.3390/e23050499 Text en © 2021 by the author. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Pinski, Francis J.
A Novel Hybrid Monte Carlo Algorithm for Sampling Path Space
title A Novel Hybrid Monte Carlo Algorithm for Sampling Path Space
title_full A Novel Hybrid Monte Carlo Algorithm for Sampling Path Space
title_fullStr A Novel Hybrid Monte Carlo Algorithm for Sampling Path Space
title_full_unstemmed A Novel Hybrid Monte Carlo Algorithm for Sampling Path Space
title_short A Novel Hybrid Monte Carlo Algorithm for Sampling Path Space
title_sort novel hybrid monte carlo algorithm for sampling path space
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8143484/
https://www.ncbi.nlm.nih.gov/pubmed/33922040
http://dx.doi.org/10.3390/e23050499
work_keys_str_mv AT pinskifrancisj anovelhybridmontecarloalgorithmforsamplingpathspace
AT pinskifrancisj novelhybridmontecarloalgorithmforsamplingpathspace