arrow
返回

Speeding Up MCMC by Efficient Data Subsampling

delete2018-07-16
delete94
delete
OA
AI
M
Matias Quiroz *
R
Robert Kohn
M
Mattias Villani
M
Minh‐Ngoc Tran
DOI:10.1080/01621459.2018.1448827delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
We propose subsampling Markov chain Monte Carlo (MCMC), an MCMC framework where the likelihood function for n observations is estimated from a random subset of m observations. We introduce a highly efficient unbiased estimator of the log-likelihood based on control variates, such that the computing cost is much smaller than that of the full log-likelihood in standard MCMC. The likelihood estimate is bias-corrected and used in two dependent pseudo-marginal algorithms to sample from a perturbed posterior, for which we derive the asymptotic error with respect to n and m, respectively. We propose a practical estimator of the error and show that the error is negligible even for a very small m in our applications. We demonstrate that subsampling MCMC is substantially more efficient than standard MCMC in terms of sampling efficiency for a given computational budget, and that it outperforms other subsampling methods for MCMC proposed in the literature. Supplementary materials for this article are available online.
Keyword:
Bayesian inference
Big Data
Block pseudo-marginal
Correlated pseudo-marginal
Estimated likelihood
Survey sampling
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

J
Journal of the American Statistical Association
IF:
3
论文数:
5.2K
被引数:
4.8W

机构

L
Linkoping University
学者数:
1.6W
论文数: 1.5W
被引数: 184
U
University of Sydney
学者数:
6.5W
论文数: 6.2W
被引数: 90
引用论文

引用论文

Plasma‐based liquefaction of methane: The road from hydrogen production to direct methane liquefaction
err2016-10-28
err0
PREAI
errRamses Snoeckx; Alexander Rabinovich; Danil Dobrynin; Annemie Bogaerts; Alexander Fridman
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容