Elliptical slice sampling
Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS), in Journal of Machine Learning Research: W&CP vol. 9
dc.contributor.author | Murray, Iain | |
dc.contributor.author | Prescott Adams, Ryan | |
dc.contributor.author | MacKay, David J. C. | |
dc.date.accessioned | 2011-01-13T10:56:54Z | |
dc.date.available | 2011-01-13T10:56:54Z | |
dc.date.issued | 2010 | en |
dc.identifier.issn | 1532-4435 | en |
dc.identifier.uri | http://jmlr.csail.mit.edu/proceedings/papers/v9/murray10a.html | en |
dc.identifier.uri | http://hdl.handle.net/1842/4581 | |
dc.description.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. | en |
dc.language.iso | en | en |
dc.title | Elliptical slice sampling | en |
dc.type | Conference Paper | en |
rps.volume | 9 | en |
rps.title | Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS), in Journal of Machine Learning Research: W&CP vol. 9 | en |
dc.extent.noOfPages | 541-548 | en |
dc.extent.pageNumbers | 541--548 | en |
dc.date.updated | 2011-01-13T10:56:55Z | |
dc.identifier.eIssn | 1938-7228 | en |
dc.date.openingDate | 2010-05-13 | |
dc.date.closingDate | 2010-05-15 |