TL;DR
This paper introduces a prior-preconditioned conjugate gradient method that significantly accelerates Gibbs sampling for Bayesian sparse regression in large-scale datasets, reducing computation time from weeks to less than a day.
Contribution
A novel algorithm leveraging prior-preconditioning and CG to efficiently sample from high-dimensional Gaussian distributions without explicit matrix factorization.
Findings
Achieved an order of magnitude speed-up in posterior inference.
Successfully applied to a large-scale healthcare dataset with 72,489 patients and 22,175 covariates.
Reduced computation time from two weeks to less than a day.
Abstract
In a modern observational study based on healthcare databases, the number of observations and of predictors typically range in the order of ~ and of ~ . Despite the large sample size, data rarely provide sufficient information to reliably estimate such a large number of parameters. Sparse regression techniques provide potential solutions, one notable approach being the Bayesian methods based on shrinkage priors. In the "large n & large p" setting, however, posterior computation encounters a major bottleneck at repeated sampling from a high-dimensional Gaussian distribution, whose precision matrix is expensive to compute and factorize. In this article, we present a novel algorithm to speed up this bottleneck based on the following observation: we can cheaply generate a random vector such that the solution to the linear system has the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
