GPU-accelerated Gibbs sampling: a case study of the Horseshoe Probit model
Not on the map. Why?
Abstract (arXiv)
Gibbs sampling is a widely used Markov chain Monte Carlo (MCMC) method for numerically approximating integrals of interest in Bayesian statistics and other mathematical sciences. Many implementations of MCMC methods do not extend easily to parallel computing environments, as their inherently sequential nature incurs a large synchronization cost. In the case study illustrated by this paper, we show how to do Gibbs sampling in a fully data-parallel manner on a graphics processing unit, for a large class of exchangeable models that admit latent variable representations. Our approach takes a systems perspective, with emphasis placed on efficient use of compute hardware. We demonstrate our method on a Horseshoe Probit regression model and find that our implementation scales effectively to thousands of predictors and millions of data points simultaneously.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Aug 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 0; 2025: 1.
4 papers.
- 2021A Survey of Monte Carlo Methods for Parameter Estimationcited by 23
- 2022Sparse Bayesian Lasso via a Variable-Coefficient ℓ1 Penaltycited by 2
- 2021Accelerating Markov Random Field Inference with Uncertainty Quantificationcited by 1
- 2025Sampling on Metric Graphscited by 0
- 2025Sampling on Metric Graphs1 Dec 2025
- 2022Sparse Bayesian Lasso via a Variable-Coefficient ℓ1 Penalty9 Nov 2022
- 2021Accelerating Markov Random Field Inference with Uncertainty Quantification2 Aug 2021
- 2021A Survey of Monte Carlo Methods for Parameter Estimation25 Jul 2021