The polar slice sampler
The slice sampler is a specialized type of Markov chain Monte Carlo (MCMC) auxiliary method. This interesting paper focuses closely on the relationship between the dimension of the target density and certain level set conditions. In particular, the authors analyze simple slice sampler factorization on log-concave densities. The investigation leads to the introduction of the \textit{polar slice sampler}, an algorithm that effectively preserves the robust convergence properties of the slice sampler for the log-concave densities and for arbitrary dimensional distributions. Furthermore, a~simple comparison of computing times is presented that shows that the polar slice sampler performs well in comparison with the rejection sampler and the simple slice sampler. A~major limitation of all slice sampler algorithms is the fact that their implementation is often difficult. However, the authors demonstrate that the polar slice sampler has very good convergence properties, provided the \textbf{X}-updating step can be feasibly implemented. Section~2 introduces the slice sampler and describes some of its basic properties. In Section~3, the performance of the \textit{uniform} simple slice sampler in high dimensions is investigated, and it is shown empirically that even for spherically symmetric, log-concave densities, the algorithm's performance deteriorates markedly as dimension increases. The polar slice sampler is motivated and constructed in Section~4, and studied theoretically in Section~5. Section~6 gives empirical study of the performance of the polar slice sampler for a~particular example and gives comparisons with the uniform simple slice sampler and a~corresponding rejection sampling algorithm. Section~7 offers some concluding remarks.
- Adaptive Rejection Sampling for Gibbs Sampling
- Auxiliary Variable Methods for Markov Chain Monte Carlo with Applications
- Bounds on regeneration times and convergence rates for Markov chains
- Convergence control methods for Markov chain Monte Carlo algorithms
- Convergence of Slice Sampler Markov Chains
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Geometric Convergence Rates for Stochastically Ordered Markov Chains
- Gibbs Sampling for Bayesian Non-Conjugate and Hierarchical Models by Using Auxiliary Variables
- scientific article; zbMATH DE number 3014822 (Why is no real title available?)
- Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review
- Markov chains and de-initializing processes
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- On convergence rates of Gibbs samplers for uniform distributions
- Optimal scaling for various Metropolis-Hastings algorithms.
- Perfect slice samplers
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Slice sampling. (With discussions and rejoinder)
- Parallel multivariate slice sampling
- Quantitative spectral gap estimate and Wasserstein contraction of simple slice sampling
- Perfect slice samplers
- Convergence of Slice Sampler Markov Chains
- Frailty modeling via the empirical Bayes-Hastings sampler
- Efficiency and Convergence Properties of Slice Samplers
- Comparison of hit-and-run, slice sampler and random walk Metropolis
- Log-concavity and strong log-concavity: a review
- Perfect Forward Simulation via Simulated Tempering
- A latent slice sampling algorithm
- Wasserstein contraction and spectral gap of slice sampling revisited
- Dimension-independent spectral gap of polar slice sampling
- A dimension-independent bound on the Wasserstein contraction rate of a geodesic random walk on the sphere
- Convergence of hybrid slice sampling via spectral gap
This page was built for publication: The polar slice sampler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147438)