Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/215449
Authors: 
Gunawan, David
Dang, Khue-Dung
Quiroz, Matias
Kohn, Robert
Tran, Minh-Ngoc
Year of Publication: 
2019
Series/Report no.: 
Sveriges Riksbank Working Paper Series No. 371
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 and this is typically the most computationally expensive part, particularly when the dataset is large. It is crucial to have an effcient 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 effcient annealed likelihood estimator based on data subsampling. The subsampling approach is more memory efficient than the corresponding full data SMC, which is an advantage for parallel computation. Second, we use a Metropolis within Gibbs kernel with two conditional updates. A Hamiltonian Monte Carlo update makes distant moves for the model parameters, and a block pseudo-marginal proposal is used for the particles corresponding to the auxiliary variables for the data subsampling. We demonstrate the usefulness of the methodology for estimating three generalized linear models and a generalized additive model with large datasets.
Subjects: 
Hamiltonian Monte Carlo
Large datasets
Likelihood annealing
JEL: 
C11
C15
C55
Document Type: 
Working Paper

Files in This Item:
File
Size
744.54 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.