SearcharxivSearch

arXiv · 2311.14492

Numerical Generalized Randomized HMC processes for restricted domains

Abstract

We propose a generic approach for numerically efficient simulation from analytically intractable distributions with constrained support. Our approach relies upon Generalized Randomized Hamiltonian Monte Carlo (GRHMC) processes and combines these with a randomized transition kernel that appropriately adjusts the Hamiltonian flow at the boundary of the constrained domain, ensuring that it remains within the domain. The numerical implementation of this constrained GRHMC process exploits the sparsity of the randomized transition kernel and the specific structure of the constraints so that the proposed approach is numerically accurate, computationally fast and operational even in high-dimensional applications. We illustrate this approach with posterior distributions of several Bayesian models with challenging parameter domain constraints in applications to real-word data sets. Building on the capability of GRHMC processes to efficiently explore otherwise challenging and high-dimensional posteriors, the proposed method expands the set of Bayesian models that can be analyzed by using the standard Markov-Chain Monte-Carlo (MCMC) methodology, As such, it can advance the development and use of Bayesian models with useful constrained priors, which are difficult to handle with existing methods. The article is accompanied by an R-package (\url{https://github.com/torekleppe/pdmphmc}), which allows for automatically implementing GRHMC processes for arbitrary target distributions and domain constraints.

Explore related subjects

Keep this discovery

BibTeXRIS

Tore Selland Kleppe, Roman Liesenfeld. 2023-11-24. Numerical Generalized Randomized HMC processes for restricted domains. https://arxiv.org/abs/2311.14492

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