mlsanityData to 7 Oct 2026

Geometric convergence of elliptical slice sampling

arXiv 2105.03308 ↗First posted 7 May 2021stat.ML cs.LG math.STcited by 5

Not on the map. Why?

Abstract (arXiv)

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 sampling of the underlying posterior distribution. Besides of its wide applicability and simplicity its main feature is that no tuning is necessary. Under weak regularity assumptions on the posterior density we show that the corresponding Markov chain is geometrically ergodic and therefore yield qualitative convergence guarantees. We illustrate our result for Gaussian posteriors as they appear in Gaussian process regression, as well as in a setting of a multi-modal distribution. Remarkably, our numerical experiments indicate a dimension-independent performance of elliptical slice sampling even in situations where our ergodicity result does not apply.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 3 of its 26 references that are in the map. First posted on arXiv 7 May 2021.

Builds on

3 of 26 references.

References · 3

  1. 2015Perturbation theory for Markov chains via Wasserstein distancecited by 16
  2. 2020The Boomerang Samplercited by 9
  3. 2018Efficient sampling for Gaussian linear regression with arbitrary priorscited by 4

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 0; 2025: 2.

5 papers.