.png){kind=icon}
返回
The fast iterated bootstrap
.png){kind=icon}
OA
AI
DOI：10.1016/j.jeconom.2020.04.025.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The standard forms of bootstrap iteration are very computationally demanding. As a result, there have been several attempts to alleviate the computational burden by use of approximations. In this paper, we extend the fast double bootstrap of Davidson and MacKinnon (2007) to higher orders of iteration, and provide algorithms for their implementation. The new methods make computational demands that increase only linearly with the level of iteration, unlike standard procedures, whose demands increase exponentially. In a series of simulation experiments, we show that the fast triple bootstrap improves on both the standard and fast double bootstraps, in the sense that it suffers from less size distortion under the null with no accompanying loss of power. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Bootstrap iteration
Fast iterated bootstrap
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
5.3K
被引数:
3.0W
机构
引用论文
Iterated smoothed bootstrap confidence intervals for population quantiles.png)
ANNALS OF STATISTICSOAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏分享收藏
查看更多内容