Sampling for Bayesian Computation with Large Datasets
Authors:
Preprint
- 27 April 2005
- preprint
- Published by Elsevier in SSRN Electronic Journal
Abstract
Multilevel models are extremely useful in handling large hierarchical datasets. However, computation can be a challenge, both in storage and CPU time per iteration of Gibbs sampler or other Markov chain Monte Carlo algorithms. We propose a computational strategy based on sampling the data, computing separate posterior distributions based on each sample, and then combining these to get a consensus posterior inference. With hierarchical data structures, we perform cluster sampling into subsets with the same structures as the original data. This reduces the number of parameters as well as sample size for each separate model fit. We illustrate with examples from climate modeling and newspaper marketing.Keywords
This publication has 17 references indexed in Scilit:
- Alternating Subspace-Spanning Resampling to Accelerate Markov Chain Monte Carlo SimulationJournal of the American Statistical Association, 2003
- A sequential particle filter method for static modelsBiometrika, 2002
- Following a Moving Target—Monte Carlo Inference for Dynamic Bayesian ModelsJournal of the Royal Statistical Society Series B: Statistical Methodology, 2001
- Bayes and Empirical Bayes Methods for Data Analysis, Second Edition2000
- Bayesian Data Analysis1995
- Bayesian Computation and Stochastic SystemsStatistical Science, 1995
- Inference from Iterative Simulation Using Multiple SequencesStatistical Science, 1992
- Sampling-Based Approaches to Calculating Marginal DensitiesJournal of the American Statistical Association, 1990
- Asymptotics in Statistics1990
- Bayes Estimates for the Linear ModelJournal of the Royal Statistical Society Series B: Statistical Methodology, 1972