Skip to content

Latest commit

 

History

History
50 lines (50 loc) · 1.97 KB

2022-06-28-biswas22a.md

File metadata and controls

50 lines (50 loc) · 1.97 KB
title booktitle abstract layout series publisher issn id month tex_title firstpage lastpage page order cycles bibtex_author author date address container-title volume genre issued pdf extras
Scalable Spike-and-Slab
Proceedings of the 39th International Conference on Machine Learning
Spike-and-slab priors are commonly used for Bayesian variable selection, due to their interpretability and favorable statistical properties. However, existing samplers for spike-and-slab posteriors incur prohibitive computational costs when the number of variables is large. In this article, we propose Scalable Spike-and-Slab (S^3), a scalable Gibbs sampling implementation for high-dimensional Bayesian regression with the continuous spike-and-slab prior of George & McCulloch (1993). For a dataset with n observations and p covariates, S^3 has order max{n^2 p_t, np} computational cost at iteration t where p_t never exceeds the number of covariates switching spike-and-slab states between iterations t and t-1 of the Markov chain. This improves upon the order n^2 p per-iteration cost of state-of-the-art implementations as, typically, p_t is substantially smaller than p. We apply S^3 on synthetic and real-world datasets, demonstrating orders of magnitude speed-ups over existing exact samplers and significant gains in inferential quality over approximate samplers with comparable cost.
inproceedings
Proceedings of Machine Learning Research
PMLR
2640-3498
biswas22a
0
Scalable Spike-and-Slab
2021
2040
2021-2040
2021
false
Biswas, Niloy and Mackey, Lester and Meng, Xiao-Li
given family
Niloy
Biswas
given family
Lester
Mackey
given family
Xiao-Li
Meng
2022-06-28
Proceedings of the 39th International Conference on Machine Learning
162
inproceedings
date-parts
2022
6
28