The Big Data Bootstrap

Abstract

The bootstrap provides a simple and powerful means of assessing the quality of estimators. However, in settings involving large datasets, the computation of bootstrap-based quantities can be prohibitively demanding. As an alternative, we present the Bag of Little Bootstraps (BLB), a new procedure which incorporates features of both the bootstrap and subsampling to obtain a robust, computationally efficient means of assessing estimator quality. BLB is well suited to modern parallel and distributed computing architectures and retains the generic applicability, statistical efficiency, and favorable theoretical properties of the bootstrap. We provide the results of an extensive empirical and theoretical investigation of BLB's behavior, including a study of its statistical correctness, its large-scale implementation and performance, selection of hyperparameters, and performance on real data.

Appears in Proceedings of the 29th International Conference on Machine Learning (ICML 2012). arXiv admin note: text overlap with arXiv:1112.5016

References in corpus (1)

• A Scalable Bootstrap for Massive Data

Cited by in corpus (6)

• Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Rates
• A Statistical Perspective on Algorithmic Leveraging
• Streaming Variational Bayes
• Active Learning for Crowd-Sourced Databases
• Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques
• Efficient Online Bootstrapping for Large Scale Learning