Maximum conditional entropy Hamiltonian Monte Carlo sampler
Tengchao Yu, Hongqiao Wang, Jinglai Li

TL;DR
This paper introduces a KSE-based criterion for optimizing HMC parameters, providing a theoretical foundation for mass matrix adaptation and demonstrating improved performance through an adaptive algorithm.
Contribution
It proposes a novel KSE-based design criterion for HMC parameter tuning and derives optimal parameters analytically for near-Gaussian distributions.
Findings
KSE criterion effectively guides parameter optimization
Analytical solutions for near-Gaussian distributions
Adaptive HMC improves sampling efficiency
Abstract
The performance of Hamiltonian Monte Carlo (HMC) sampler depends critically on some algorithm parameters such as the total integration time and the numerical integration stepsize. The parameter tuning is particularly challenging when the mass matrix of the HMC sampler is adapted. We propose in this work a Kolmogorov-Sinai entropy (KSE) based design criterion to optimize these algorithm parameters, which can avoid some potential issues in the often used jumping-distance based measures. For near-Gaussian distributions, we are able to derive the optimal algorithm parameters with respect to the KSE criterion analytically. As a byproduct the KSE criterion also provides a theoretical justification for the need to adapt the mass matrix in HMC sampler. Based on the results, we propose an adaptive HMC algorithm, and we then demonstrate the performance of the proposed algorithm with numerical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Gaussian Processes and Bayesian Inference · Statistical Mechanics and Entropy
