pith. sign in

arxiv: 2412.08876 · v3 · pith:FYUUWW34new · submitted 2024-12-12 · 📊 stat.CO · astro-ph.CO

Practical and Scalable Hamiltonian Monte Carlo Without the Metropolis Test

classification 📊 stat.CO astro-ph.CO
keywords biasstepcarlointegrationmontesizeasymptoticgaussian
0
0 comments X
read the original abstract

Hamiltonian Monte Carlo and underdamped Langevin Monte Carlo are leading methods for sampling from high-dimensional distributions with differentiable densities. Both rely on numerical integration, which introduces asymptotic bias in expectation estimates. This bias can be removed by adjusting the numerical integration with a Metropolis Hastings (MH) step, at a cost of slower mixing and larger variance. Alternatively, we can trade bias for lower variance if we avoid the MH step and use an appropriate step size of integration. These unadjusted schemes have strong performance, especially in high-dimensional problems, but are rarely used due to the lack of automated step size selection. We propose an automatic tuning scheme that selects a step size to meet a user-specified asymptotic bias tolerance. The method is based on a relationship between energy error and bias which we establish. We rigorously analyze the method in the Gaussian setting and numerically extend the analysis to several non Gaussian problems. Experiments on Bayesian inference and large scale statistical physics models (with over one million parameters) show that, with our tuning, unadjusted methods consistently and significantly outperform adjusted counterparts.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Towards E-Value Based Stopping Rules for Bayesian Deep Ensembles

    cs.LG 2026-04 unverdicted novelty 6.0

    E-value sequential tests enable early stopping of MCMC sampling in Bayesian deep ensembles, often needing only a fraction of the full budget while improving over standard deep ensembles.

  2. Position: The Time for Sampling Is Now! Charting a New Course for Bayesian Deep Learning

    cs.LG 2026-05 unverdicted novelty 4.0

    Sampling-based inference for Bayesian neural networks has achieved computational parity with optimization-based methods and should be prioritized to deliver better uncertainty quantification and model insights.