Walker, Stephen G.
(2003)
*
Invited comment on the paper "Slice Sampling" by Radford Neal.
*
Annals of Statistics,
31
(3).
pp. 755-758.
ISSN 0090-5364.
(doi:10.1214/aos/1056562461)
(The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)
(KAR id:10574)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |

Official URL: http://dx.doi.org/10.1214/aos/1056562461 |

## Abstract

Markov chain sampling methods that adapt to characteristics of the distribution being sampled can be constructed using the principle that one can ample from a distribution by sampling uniformly from the region under the plot of its density function. A Markov chain that converges to this uniform distribution can be constructed by alternating uniform sampling in the vertical direction with uniform sampling from the horizontal "slice" defined by the current vertical position, or more generally, with some update that leaves the uniform distribution over this slice invariant. Such "slice sampling" methods are easily implemented for univariate distributions, and can be used to sample from a multivariate distribution by updating each variable in turn. This approach is often easier to implement than Gibbs sampling and more efficient than simple Metropolis updates, due to the ability of slice sampling to adaptively choose the magnitude of changes made. It is therefore attractive for routine and automated use. Slice sampling methods that update all variables simultaneously are also possible. These methods can adaptively choose the magnitudes of changes made to each variable, based on the local properties of the density function. More ambitiously, such methods could potentially adapt to the dependencies between variables by constructing local quadratic approximations. Another approach is to improve sampling efficiency by suppressing random walks. This can be done for univariate slice sampling by "overrelaxation," and for multivariate slice sampling by "reflection" from the edges of the slice.

Item Type: | Article |
---|---|

DOI/Identification number: | 10.1214/aos/1056562461 |

Uncontrolled keywords: | Markov chain Monte Carlo; auxiliary variables; adaptive methods; Gibbs sampling; Metropolis algorithm; overrelaxation; dynamical methods |

Subjects: | Q Science > QA Mathematics (inc Computing science) |

Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Mathematics, Statistics and Actuarial Science |

Depositing User: | Judith Broom |

Date Deposited: | 14 Mar 2009 07:48 UTC |

Last Modified: | 16 Nov 2021 09:49 UTC |

Resource URI: | https://kar.kent.ac.uk/id/eprint/10574 (The current URI for this page, for reference purposes) |

- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV

- Depositors only (login required):