Bootstrap in High Dimension with Low Computation
Abstract
The bootstrap is a popular data-driven method to quantify statistical uncertainty, but for modern high-dimensional problems, it could suffer from huge computational costs due to the need to repeatedly generate resamples and refit models. We study the use of bootstraps in high-dimensional environments with a small number of resamples. In particular, we show that with a recent "cheap" bootstrap perspective, using a number of resamples as small as one could attain valid coverage even when the dimension grows closely with the sample size, thus strongly supporting the implementability of the bootstrap for large-scale problems. We validate our theoretical results and compare the performance of our approach with other benchmarks via a range of experiments.
Cite
@article{arxiv.2210.10974,
title = {Bootstrap in High Dimension with Low Computation},
author = {Henry Lam and Zhenyuan Liu},
journal= {arXiv preprint arXiv:2210.10974},
year = {2023}
}
Comments
Accepted to Proceedings of the 40th International Conference on Machine Learning (ICML)