Multiproposal Elliptical Slice Sampling
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912927562334208 |
|---|---|
| author | Senn, Guillermina Glatt-Holtz, Nathan Carigi, Giulia Holbrook, Andrew Tjelmeland, Håkon |
| author_facet | Senn, Guillermina Glatt-Holtz, Nathan Carigi, Giulia Holbrook, Andrew Tjelmeland, Håkon |
| contents | We introduce Multiproposal Elliptical Slice Sampling, a self-tuning multiproposal Markov chain Monte Carlo method for Bayesian inference with Gaussian priors. Our method generalizes the Elliptical Slice Sampling algorithm by 1) allowing multiple candidate proposals to be sampled in parallel at each self-tuning step, and 2) basing the acceptance step on a distance-informed transition matrix that can favor proposals far from the current state. This allows larger moves in state space and faster self-tuning, at essentially no additional wall clock time for expensive likelihoods, and results in improved mixing. We additionally provide theoretical arguments and experimental results suggesting dimension-robust mixing behavior, making the algorithm particularly well suited for Bayesian PDE inverse problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_22358 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Multiproposal Elliptical Slice Sampling Senn, Guillermina Glatt-Holtz, Nathan Carigi, Giulia Holbrook, Andrew Tjelmeland, Håkon Computation We introduce Multiproposal Elliptical Slice Sampling, a self-tuning multiproposal Markov chain Monte Carlo method for Bayesian inference with Gaussian priors. Our method generalizes the Elliptical Slice Sampling algorithm by 1) allowing multiple candidate proposals to be sampled in parallel at each self-tuning step, and 2) basing the acceptance step on a distance-informed transition matrix that can favor proposals far from the current state. This allows larger moves in state space and faster self-tuning, at essentially no additional wall clock time for expensive likelihoods, and results in improved mixing. We additionally provide theoretical arguments and experimental results suggesting dimension-robust mixing behavior, making the algorithm particularly well suited for Bayesian PDE inverse problems. |
| title | Multiproposal Elliptical Slice Sampling |
| topic | Computation |
| url | https://arxiv.org/abs/2602.22358 |