Elliptical Slice Sampling with Expectation Propagation
Abstract
Markov Chain Monte Carlo techniques remain the gold standard for approximate Bayesian inference, but their practical issues -- including onerous runtime and sensitivity to tuning parameters -- often lead researchers to use faster but typically less accurate deterministic approximations. Here we couple the fast but biased deterministic approximation offered by expectation propagation with elliptical slice sampling, a state-of-the-art MCMC method. We extend our hybrid deterministic-MCMC method to include recycled samples and analytical slices, and we rigorously prove the validity of each enhancement. Taken together, we show that these advances provide an order of magnitude gain in efficiency beyond existing state-of-the-art sampling techniques in Bayesian classification and multivariate gaussian quadrature problems.
Cite
Text
Fagan et al. "Elliptical Slice Sampling with Expectation Propagation." Conference on Uncertainty in Artificial Intelligence, 2016.Markdown
[Fagan et al. "Elliptical Slice Sampling with Expectation Propagation." Conference on Uncertainty in Artificial Intelligence, 2016.](https://mlanthology.org/uai/2016/fagan2016uai-elliptical/)BibTeX
@inproceedings{fagan2016uai-elliptical,
title = {{Elliptical Slice Sampling with Expectation Propagation}},
author = {Fagan, Francois and Bhandari, Jalaj and Cunningham, John P.},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2016},
url = {https://mlanthology.org/uai/2016/fagan2016uai-elliptical/}
}