Subsampling Sequential Monte Carlo for Static Bayesian Models
David Gunawan, Khue-Dung Dang, Matias Quiroz, Robert Kohn, Minh-Ngoc, Tran

TL;DR
This paper introduces a subsampling-based approach to accelerate Sequential Monte Carlo methods for Bayesian inference in large datasets, combining efficient likelihood estimation with advanced Markov kernels.
Contribution
It proposes a novel subsampling-based SMC framework using unbiased likelihood estimators and a Metropolis within Gibbs kernel with Hamiltonian Monte Carlo updates.
Findings
Effective acceleration of SMC for large datasets
Memory-efficient subsampling approach
Successful application to generalized linear and additive models
Abstract
We show how to speed up Sequential Monte Carlo (SMC) for Bayesian inference in large data problems by data subsampling. SMC sequentially updates a cloud of particles through a sequence of distributions, beginning with a distribution that is easy to sample from such as the prior and ending with the posterior distribution. Each update of the particle cloud consists of three steps: reweighting, resampling, and moving. In the move step, each particle is moved using a Markov kernel; this is typically the most computationally expensive part, particularly when the dataset is large. It is crucial to have an efficient move step to ensure particle diversity. Our article makes two important contributions. First, in order to speed up the SMC computation, we use an approximately unbiased and efficient annealed likelihood estimator based on data subsampling. The subsampling approach is more memory…
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.
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
