English

Generalised Boosted Forests

Methodology 2021-03-04 v2 Machine Learning

Abstract

This paper extends recent work on boosting random forests to model non-Gaussian responses. Given an exponential family E[YX]=g1(f(X))\mathbb{E}[Y|X] = g^{-1}(f(X)) our goal is to obtain an estimate for ff. 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 \textit{generalised 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.

Keywords

Cite

@article{arxiv.2102.12561,
  title  = {Generalised Boosted Forests},
  author = {Indrayudh Ghosal and Giles Hooker},
  journal= {arXiv preprint arXiv:2102.12561},
  year   = {2021}
}

Comments

Paper: 14 pages, 4 figures, 3 tables; Appendix: 34 pages, 28 figures, 1 table

R2 v1 2026-06-23T23:29:21.092Z