A Splitting Hamiltonian Monte Carlo Method for Efficient Sampling
نویسندگان
چکیده
منابع مشابه
Markov Chain Monte Carlo posterior sampling with the Hamiltonian method
The Markov Chain Monte Carlo technique provides a means for drawing random samples from a target probability density function (pdf). MCMC allows one to assess the uncertainties in a Bayesian analysis described by a numerically calculated posterior distribution. This paper describes the Hamiltonian MCMC technique in which a momentum variable is introduced for each parameter of the target pdf. In...
متن کاملStratified Splitting for Efficient Monte Carlo Integration
The efficient evaluation of high-dimensional integrals is of importance in both theoretical and practical fields of science, such as Bayesian inference, statistical physics, and machine learning. However, due to the curse of dimensionality, deterministic numerical methods are inefficient in high-dimensional settings. Consequentially, for many practical problems one must resort to Monte Carlo es...
متن کاملEfficient Sampling Method for Monte Carlo Tree Search Problem
We consider Monte Carlo tree search problem, a variant of Min-Max tree search problem where the score of each leaf is the expectation of some Bernoulli variables and not explicitly given but can be estimated through (random) playouts. The goal of this problem is, given a game tree and an oracle that returns an outcome of a playout, to find a child node of the root which attains an approximate m...
متن کاملEfficient Monte Carlo simulation via the generalized splitting method
We describe a new Monte Carlo algorithm for the consistent and unbiased estimation of multidimensional integrals and the efficient sampling from multidimensional densities. The algorithm is inspired by the classical splitting method and can be applied to general static simulation models. We provide examples from rare-event probability estimation, counting, and sampling, demonstrating that the p...
متن کاملIrreversible Monte Carlo Algorithms for Efficient Sampling
Equilibrium systems evolve according to Detailed Balance (DB). This principe guided development of the Monte-Carlo sampling techniques, of which Metropolis-Hastings (MH) algorithm is the famous representative. It is also known that DB is sufficient but not necessary. We construct irreversible deformation of a given reversible algorithm capable of dramatic improvement of sampling from known dist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: CSIAM transaction on applied mathematics
سال: 2023
ISSN: ['2708-0560', '2708-0579']
DOI: https://doi.org/10.4208/csiam-am.so-2021-0031