Simultaneous Inference for Massive Data: Distributed Bootstrap
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a bootstrap method applied to massive data processed distributedly in a large number of machines. This new method is computationally efficient in that we bootstrap on the master machine without over-resampling, typically required by existing methods citekleiner2014scalable,sengupta2016subsampled, while provably achieving optimal statistical efficiency with minimal communication. Our method does not require repeatedly re-fitting the model but only applies multiplier bootstrap in the master machine on the gradients received from the worker machines. Simulations validate our theory.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1.
4 papers.
- 2021Communication-Constrained Distributed Quantile Regression with Optimal Statistical Guaranteescited by 8
- 2021Distributed Bootstrap for Simultaneous Inference Under High Dimensionalitycited by 4
- 2021Centroid Approximation for Bootstrap: Improving Particle Quality at Inferencecited by 0
- 2022Distributed Estimation and Inference for Semi-parametric Binary Response Modelscited by 0
- 2022Distributed Estimation and Inference for Semi-parametric Binary Response Models15 Oct 2022
- 2021Communication-Constrained Distributed Quantile Regression with Optimal Statistical Guarantees25 Oct 2021
- 2021Centroid Approximation for Bootstrap: Improving Particle Quality at Inference17 Oct 2021
- 2021Distributed Bootstrap for Simultaneous Inference Under High Dimensionality19 Feb 2021