The Infinitesimal Jackknife and Combinations of Models
Not on the map. Why?
Abstract (arXiv)
The Infinitesimal Jackknife is a general method for estimating variances of parametric models, and more recently also for some ensemble methods. In this paper we extend the Infinitesimal Jackknife to estimate the covariance between any two models. This can be used to quantify uncertainty for combinations of models, or to construct test statistics for comparing different models or ensembles of models fitted using the same training dataset. Specific examples in this paper use boosted combinations of models like random forests and M-estimators. We also investigate its application on neural networks and ensembles of XGBoost models. We illustrate the efficacy of variance estimates through extensive simulations and its application to the Beijing Housing data, and demonstrate the theoretical consistency of the Infinitesimal Jackknife covariance estimate.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 12 of its 35 references that are in the map. First posted on arXiv 31 Aug 2022.
Builds on
12 of 35 references.
References · 12
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2015Estimation and Inference of Heterogeneous Treatment Effects using Random Forestscited by 600
- 2016Generalized Random Forestscited by 312
- 2015ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and Rcited by 172
- 2013Confidence Intervals for Random Forests: The Jackknife and the Infinitesimal Jackknifecited by 44
- 2019Asymptotic Distributions and Rates of Convergence for Random Forests via Generalized U-statisticscited by 18
- 2021Quantifying Epistemic Uncertainty in Deep Learningcited by 10
- 2018Boosting Random Forests to Reduce Bias; One-Step Boosted Forest and its Variance Estimatecited by 8
- 2019A Unified Framework for Random Forest Prediction Error Estimationcited by 8
- 2018Boulevard: Regularized Stochastic Gradient Boosted Trees and Their Limiting Distributioncited by 7
- 2021Generalised Boosted Forestscited by 2
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 1; 2025: 1; 2026: 1.
5 papers.
- 2024Post-hoc Probabilistic Vision-Language Modelscited by 13
- 2022A Generic Approach for Reproducible Model Distillationcited by 3
- 2022Policy learning for many outcomes of interest: Combining optimal policy trees with multi-objective Bayesian optimisationcited by 0
- 2025Empirical Likelihood for Random Forests and Ensemblescited by 0
- 2026Statistical Inference for Explainable Boosting Machinescited by 0
- 2026Statistical Inference for Explainable Boosting Machines26 Jan 2026
- 2025Empirical Likelihood for Random Forests and Ensembles17 Nov 2025
- 2024Post-hoc Probabilistic Vision-Language Models8 Dec 2024
- 2022Policy learning for many outcomes of interest: Combining optimal policy trees with multi-objective Bayesian optimisation13 Dec 2022
- 2022A Generic Approach for Reproducible Model Distillation22 Nov 2022