AI & ML
Fast Uncertainty Quantification for Kernel-Based Estimators in Large-Scale Causal Inference
arXiv stat.ML0 views
arXiv:2603.13662v2 Announce Type: replace-cross Abstract: Kernel methods are widely used in causal inference for tasks such as treatment effect estimation, policy evaluation, and policy learning. The bootstrap is a standard tool for uncertainty quantification because of its broad applicability. As increasingly large datasets become available, such as the 2023 U.S. Natality data from the National Vital Statistics System (NVSS), which includes 3,605,081 registered births (of which 2,980,739 form our analytic sample after cohort restrictions), the computational demands of these methods increase substantially. Kernel methods are known to scale poorly with sample size, and this limitation is further exacerbated by the repeated re-fitting required by the bootstrap. As a result, bootstrap-based inference for kernel-based estimators can become computationally infeasible in large-scale settings. In this paper, we address these challenges by extending the causal Bag of Little Bootstraps (cBLB) algorithm of Kosko et al. (2023) to kernel methods. Our approach achieves computational scalability by combining subsampling and resampling while preserving first-order uncertainty quantification and asymptotically correct coverage. We evaluate the method across three representative implementations: kernelized augmented outcome-weighted learning, kernel-based minimax weighting, and double machine learning with kernel support vector machines. We show in simulations that our method yields confidence intervals with nominal coverage at a fraction of the computational cost. We further demonstrate its utility in a real-world application by estimating the effect of any amount of smoking on birth weight, as well as the optimal treatment regime, using the NVSS dataset, where the standard bootstrap is prohibitively expensive computationally and effectively infeasible at this scale.
Source:https://arxiv.org/abs/2603.13662PreviousFlow Matching from Viewpoint of Proximal OperatorsNextMinimizing classical resources in variational measurement-based quantum computation for generative modeling
Related posts
Software jobs are back, but not for juniors. What I'd build if I were starting in 2026.
0dev.to Discuss
How to Calculate Real Throughput in an Automated Filling Line
0dev.to Productivity
WeightBench Tests Language Models as Weight-Space Programmers
0dev.to Machine Learning
Data Cleaning for messy dates dd-mm-yyyy
0dev.to Machine Learning

How Much GPU Memory Do I Need?
0dev.to Machine Learning
The Hugging Face Ecosystem in 2026: Transformers, Datasets, Trainer, LoRA/PEFT, Gradio & Spaces (Real Code)
0dev.to Machine Learning