Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale
Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale
复制标题
通过学习蛙跳量表加快哈密顿蒙特卡罗
DOI:
--
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
C. Robert
中科院分区:
文献类型:
--
作者:
Changye Wu;Julien Stoehr;C. Robert
Hamiltonian Monte Carlo samplers have become standard algorithms for MCMC implementations, as opposed to more basic versions, but they still require some amount of tuning and calibration. Exploiting the U-turn criterion of the NUTS algorithm (Hoffman and Gelman, 2014), we propose a version of HMC that relies on the distribution of the integration time of the associated leapfrog integrator. Using in addition the primal-dual averaging method for tuning the step size of the integrator, we achieve an essentially calibration free version of HMC. When compared with the original NUTS on several benchmarks, this algorithm exhibits a significantly improved efficiency.
影响因子:
1.5
作者:
Beskos, Alexandros;Pillai, Natesh;Stuart, Andrew
通讯作者:
Stuart, Andrew
影响因子:
1.4
作者:
Tang, Xiaoyu;Xie, Xiang;Zhou, Hongliang
通讯作者:
Zhou, Hongliang
DOI:
10.48550/arxiv.1411.6669
发表时间:
2014
期刊:
arXiv e-prints
影响因子:
--
作者:
Betancourt M. J.
通讯作者:
Betancourt M. J.