.png){kind=icon}
返回
Sequential quasi Monte Carlo
.png){kind=icon}
OA
AI
DOI：10.1111/rssb.12104.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We derive and study sequential quasi Monte Carlo (SQMC), a class of algorithms obtained by introducing QMC point sets in particle filtering. SQMC is related to, and may be seen as an extension of, the array-RQMC algorithm of L'Ecuyer and his colleagues. The complexity of SQMC is O{Nlog(N)}, where N is the number of simulations at each iteration, and its error rate is smaller than the Monte Carlo rate OP(N-1/2). The only requirement to implement SQMC algorithms is the ability to write the simulation of particle x(t)(n) given xt(-1)(n) as a deterministic function of x(t-1)(n) and a fixed number of uniform variates. We show that SQMC is amenable to the same extensions as standard SMC, such as forward smoothing, backward smoothing and unbiased likelihood evaluation. In particular, SQMC may replace SMC within a particle Markov chain Monte Carlo algorithm. We establish several convergence results. We provide numerical evidence that SQMC may significantly outperform SMC in practical scenarios.
Keyword:
Array-randomized quasi Monte Carlo
Low discrepancy
Particle filtering
Quasi Monte Carlo
Randomized quasi Monte Carlo
Sequential Monte Carlo
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.6
论文数:
1.5K
被引数:
3.2W
机构
引用论文
Central limit theorem for sequential Monte Carlo methods and its application to bayesian inference序贯蒙特卡罗方法的中心极限定理及其在贝叶斯推理中的应用.png)
ANNALS OF STATISTICSOAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏
查看更多内容