.png){kind=icon}
Return
A Subsampled Double Bootstrap for Massive Data
.png){kind=icon}
OA
AI
DOI：10.1080/01621459.2015.1080709.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The bootstrap is a popular and powerful method for assessing precision of estimators and inferential methods. However, for massive datasets that are increasingly prevalent, the bootstrap becomes prohibitively costly in computation and its feasibility is questionable even with modern parallel computing platforms. Recently, Kleiner and co-authors, proposed a method called BLB (bag of little bootstraps) for massive data, which is more computationally scalable with little sacrifice of statistical accuracy. Building on BLB and the idea of fast double bootstrap, we propose a new resampling method, the subsampled double bootstrap, for both independent data and time series data. We establish consistency of the subsampled double bootstrap under mild conditions for both independent and dependent cases. Methodologically, the subsampled double bootstrap is superior to BLB in terms of running time, more sample coverage, and automatic implementation with less tuning parameters for a given time budget. Its advantage relative to BLB and bootstrap is also demonstrated in numerical simulations and a data illustration. Supplementary materials for this article are available online.
Keywords:
Big data
Computational cost
Resampling
Subsampling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3
Papers:
5.2K
Citations:
4.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more