Riemannian Manifold Hamiltonian Monte Carlo
Mark Girolami, Ben Calderhead, Siu A. Chin

TL;DR
This paper introduces a Riemannian Manifold Hamiltonian Monte Carlo method that automatically adapts to local geometry, enabling efficient sampling from complex, high-dimensional distributions without extensive tuning.
Contribution
The paper presents a novel Riemannian manifold-based HMC sampler with automatic adaptation, improving efficiency and scalability over existing Monte Carlo algorithms.
Findings
Significant increase in effective sample size compared to other methods.
Automated adaptation reduces the need for costly pilot tuning.
Effective in high-dimensional and strongly correlated models.
Abstract
The paper proposes a Riemannian Manifold Hamiltonian Monte Carlo sampler to resolve the shortcomings of existing Monte Carlo algorithms when sampling from target densities that may be high dimensional and exhibit strong correlations. The method provides a fully automated adaptation mechanism that circumvents the costly pilot runs required to tune proposal densities for Metropolis-Hastings or indeed Hybrid Monte Carlo and Metropolis Adjusted Langevin Algorithms. This allows for highly efficient sampling even in very high dimensions where different scalings may be required for the transient and stationary phases of the Markov chain. The proposed method exploits the Riemannian structure of the parameter space of statistical models and thus automatically adapts to the local manifold structure at each step based on the metric tensor. A semi-explicit second order symplectic integrator for…
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
Riemannian Manifold Hamiltonian Monte Carlo· youtube
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Gaussian Processes and Bayesian Inference · Model Reduction and Neural Networks
