A Fast Bootstrap Algorithm for Causal Inference with Large Data
Matthew Kosko, Lin Wang, Michele Santacatterina

TL;DR
This paper introduces a new bootstrap algorithm tailored for large-scale causal inference, significantly reducing computational costs while maintaining accuracy and reliable confidence intervals.
Contribution
The paper presents the causal bag of little bootstraps, a novel method that enhances bootstrap efficiency for causal effect estimation in large datasets.
Findings
The new algorithm achieves substantial computational speedups.
It maintains consistent estimates and accurate confidence interval coverage.
Performance is validated through simulation and real data application.
Abstract
Estimating causal effects from large experimental and observational data has become increasingly prevalent in both industry and research. The bootstrap is an intuitive and powerful technique used to construct standard errors and confidence intervals of estimators. Its application however can be prohibitively demanding in settings involving large data. In addition, modern causal inference estimators based on machine learning and optimization techniques exacerbate the computational burden of the bootstrap. The bag of little bootstraps has been proposed in non-causal settings for large data but has not yet been applied to evaluate the properties of estimators of causal effects. In this paper, we introduce a new bootstrap algorithm called causal bag of little bootstraps for causal inference with large data. The new algorithm significantly improves the computational efficiency of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Causal Inference Techniques · Bayesian Modeling and Causal Inference · Statistical Methods and Inference
