Generalised Boosted Forests
Not on the map. Why?
Abstract (arXiv)
This paper extends recent work on boosting random forests to model non-Gaussian responses. Given an exponential family mathbbE[Y|X] = g-1(f(X)) our goal is to obtain an estimate for f. We start with an MLE-type estimate in the link space and then define generalised residuals from it. We use these residuals and some corresponding weights to fit a base random forest and then repeat the same to obtain a boost random forest. We call the sum of these three estimators a textitgeneralised boosted forest. We show with simulated and real data that both the random forest steps reduces test-set log-likelihood, which we treat as our primary metric. We also provide a variance estimator, which we can obtain with the same computational cost as the original estimate itself. Empirical experiments on real-world data and simulations demonstrate that the methods can effectively reduce bias, and that confidence interval coverage is conservative in the bulk of the covariate distribution.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 4 of its 18 references that are in the map. First posted on arXiv 24 Feb 2021.
Builds on
4 of 18 references.
References · 4
- 2015Estimation and Inference of Heterogeneous Treatment Effects using Random Forestscited by 597
- 2015ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and Rcited by 171
- 2013Confidence Intervals for Random Forests: The Jackknife and the Infinitesimal Jackknifecited by 43
- 2018Boosting Random Forests to Reduce Bias; One-Step Boosted Forest and its Variance Estimatecited by 8
Built on by
Citing papers per year: 2021: 1; 2022: 1.
2 papers.
- 2022The Infinitesimal Jackknife and Combinations of Modelscited by 5
- 2021WildWood: a new Random Forest algorithmcited by 0
- 2022The Infinitesimal Jackknife and Combinations of Models31 Aug 2022
- 2021WildWood: a new Random Forest algorithm16 Sep 2021