paper-with-me

Papers

Elliptical slice sampling

2009-12-31 · Iain Murray, Ryan Prescott Adams, David J. C. MacKay

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.

📄 PDF Abstract BibTeX arXiv:1001.0175

Code (1)

coxxxxx/poisson_process_inference

Methods 이 논문이 사용한 방법론

Gaussian Process Gaussian Processes are non-parametric models for approximating functions. They rely upon a measure of similarity between points (the kernel function) to predict the value for…

Similar Papers 제목 키워드 기반

Geometric convergence of elliptical slice sampling

2021-05-07 · Viacheslav Natarovskii, Daniel Rudolf, Björn Sprungk

For Bayesian learning, given likelihood function and Gaussian prior, the elliptical slice sampler, introduced by Murray, Adams and MacKay 2010, provides a tool for the construction of a Markov chain for approximate sampl…

Reversibility of elliptical slice sampling revisited

2023-01-06 · Mareike Hasenpflug, Viacheslav Telezhnikov, Daniel Rudolf

We extend elliptical slice sampling, a Markov chain transition kernel suggested in Murray, Adams and MacKay 2010, to infinite-dimensional separable Hilbert spaces and discuss its well-definedness. We point to a regularit…

A Fast, Robust Elliptical Slice Sampling Implementation for Linearly Truncated Multivariate Normal Distributions

2024-07-15 · Kaiwen Wu, Jacob R. Gardner

Elliptical slice sampling, when adapted to linearly truncated multivariate normal distributions, is a rejection-free Markov chain Monte Carlo method. At its core, it requires analytically constructing an ellipse-polytope…

Gibbsian polar slice sampling

2023-02-08 · Philip Schär, Michael Habeck, Daniel Rudolf

Polar slice sampling (Roberts & Rosenthal, 2002) is a Markov chain approach for approximate sampling of distributions that is difficult, if not impossible, to implement efficiently, but behaves provably well with respect…

A Gibbs Sampler for Efficient Bayesian Inference in Sign-Identified SVARs

2025-05-29 · Jonas E. Arias, Juan F. Rubio-Ramírez, Minchul Shin

We develop a new algorithm for inference based on structural vector autoregressions (SVARs) identified with sign restrictions. The key insight of our algorithm is to break apart from the accept-reject tradition associate…

Bayesian Inference