SearcharxivSearch

arXiv · 2412.08876

Practical and Scalable Hamiltonian Monte Carlo Without the Metropolis Test

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Jakob Robnik, Reuben Cohn-Gordon, Uroš Seljak. 2024-12-12. Practical and Scalable Hamiltonian Monte Carlo Without the Metropolis Test. https://arxiv.org/abs/2412.08876

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO