Elliptical Slice Sampling
Abstract
Many probabilistic models introduce strong dependencies between variables using a latent multivariate Gaussian distribution or a Gaussian process. We present a new Markov chain Monte Carlo algorithm for performing inference in models with multivariate Gaussian priors. Its key properties are: 1) it has simple, generic code applicable to many models, 2) it has no free parameters, 3) it works well for a variety of Gaussian process based models. These properties make our method ideal for use while model building, removing the need to spend time deriving and tuning updates for more complex algorithms.
Cite
Text
Murray et al. "Elliptical Slice Sampling." Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 2010.Markdown
[Murray et al. "Elliptical Slice Sampling." Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 2010.](https://mlanthology.org/aistats/2010/murray2010aistats-elliptical/)BibTeX
@inproceedings{murray2010aistats-elliptical,
title = {{Elliptical Slice Sampling}},
author = {Murray, Iain and Adams, Ryan and MacKay, David},
booktitle = {Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics},
year = {2010},
pages = {541-548},
volume = {9},
url = {https://mlanthology.org/aistats/2010/murray2010aistats-elliptical/}
}