Unbounded Slice Sampling

10/05/2020
by   Daichi Mochihashi, et al.
0

Slice sampling is an efficient Markov Chain Monte Carlo algorithm to sample from an unnormalized density with acceptance ratio always 1. However, when the variable to sample is unbounded, its "stepping-out" heuristic works only locally, making it difficult to uniformly explore possible candidates. This paper proposes a simple change-of-variable method to slice sample an unbounded variable equivalently from [0,1).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2023

Reversibility of elliptical slice sampling revisited

We discuss the well-definedness of elliptical slice sampling, a Markov c...
research
02/14/2020

Ensemble Slice Sampling

Slice Sampling has emerged as a powerful Markov Chain Monte Carlo algori...
research
10/19/2022

Transport Elliptical Slice Sampling

We introduce a new framework for efficient sampling from complex probabi...
research
03/09/2015

Structured Prediction of Sequences and Trees using Infinite Contexts

Linguistic structures exhibit a rich array of global phenomena, however ...
research
02/08/2023

Gibbsian polar slice sampling

Polar slice sampling (Roberts Rosenthal, 2002) is a Markov chain app...
research
02/09/2018

Slice Sampling Particle Belief Propagation

Inference in continuous label Markov random fields is a challenging task...
research
02/28/2022

Elliptical Slice Sampling for Probabilistic Verification of Stochastic Systems with Signal Temporal Logic Specifications

Autonomous robots typically incorporate complex sensors in their decisio...

Please sign up or login with your details

Forgot password? Click here to reset