Double-Parallel Monte Carlo for Bayesian analysis of big data

被引:0
|
作者
Jingnan Xue
Faming Liang
机构
[1] Texas A&M University,Department of Statistics
[2] Purdue University,Department of Statistics
来源
Statistics and Computing | 2019年 / 29卷
关键词
Embarrassingly parallel; Divide-and-combine; MCMC; Pop-SAMC; Subset posterior aggregation;
D O I
暂无
中图分类号
学科分类号
摘要
This paper proposes a simple, practical, and efficient MCMC algorithm for Bayesian analysis of big data. The proposed algorithm suggests to divide the big dataset into some smaller subsets and provides a simple method to aggregate the subset posteriors to approximate the full data posterior. To further speed up computation, the proposed algorithm employs the population stochastic approximation Monte Carlo algorithm, a parallel MCMC algorithm, to simulate from each subset posterior. Since this algorithm consists of two levels of parallel, data parallel and simulation parallel, it is coined as “Double-Parallel Monte Carlo.” The validity of the proposed algorithm is justified mathematically and numerically.
引用
收藏
页码:23 / 32
页数:9
相关论文
共 50 条