WildWood: a new Random Forest algorithm
Not on the map. Why?
Abstract (arXiv)
We introduce WildWood (WW), a new ensemble algorithm for supervised learning of Random Forest (RF) type. While standard RF algorithms use bootstrap out-of-bag samples to compute out-of-bag scores, WW uses these samples to produce improved predictions given by an aggregation of the predictions of all possible subtrees of each fully grown tree in the forest. This is achieved by aggregation with exponential weights computed over out-of-bag samples, that are computed exactly and very efficiently thanks to an algorithm called context tree weighting. This improvement, combined with a histogram strategy to accelerate split finding, makes WW fast and competitive compared with other well-established ensemble methods, such as standard RF and extreme gradient boosting algorithms.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 100 references that are in the map. First posted on arXiv 16 Sep 2021.
Builds on
26 of 100 references.
References · 26
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2015Estimation and Inference of Heterogeneous Treatment Effects using Random Forestscited by 597
- 2016Generalized Random Forestscited by 309
- 2015Recursive Partitioning for Heterogeneous Causal Effectscited by 254
- 2018CatBoost: gradient boosting with categorical features supportcited by 208
- 2015A Random Forest Guided Tourcited by 168
- 2014Consistency of random forestscited by 84
- 2018Hyperparameters and Tuning Strategies for Random Forestcited by 83
- 2014Understanding Random Forests: From Theory to Practicecited by 57
- 2019Randomization as Regularization: A Degrees of Freedom Explanation for Random Forest Successcited by 30
- 2014Mondrian Forests: Efficient Online Random Forestscited by 25
- 2021Regularized target encoding outperforms traditional methods in supervised machine learning with high cardinality featurescited by 20
14 more
- 2018Minimax optimal rates for Mondrian trees and forestscited by 18
- 2019AMF: Aggregated Mondrian Forests for Online Learningcited by 17
- 2021Trees, Forests, Chickens, and Eggs: When and Why to Prune Trees in a Random Forestcited by 13
- 2014Analysis of purely random forests biascited by 10
- 2018Approximation Trees: Statistical Stability in Model Distillationcited by 9
- 2021Predicting Intensive Care Unit Length of Stay and Mortality Using Patient Vital Signs: Machine Learning Model Development and Validationcited by 7
- 2016Random Forest for Label Rankingcited by 4
- 2021Forest Guided Smoothingcited by 3
- 2021Dimension Reduction Forests: Local Variable Importance using Structured Random Forestscited by 3
- 2021ADASYN-Random Forest Based Intrusion Detection Modelcited by 3
- 2021Generalised Boosted Forestscited by 2
- 2021Driver State and Behavior Detection Through Smart Wearablescited by 2
- 2020Estimating County-Level COVID-19 Exponential Growth Rates Using Generalized Random Forestscited by 1
- 2021Multi-Output Random Forest Regression to Emulate the Earliest Stages of Planet Formationcited by 1
Built on by
Not cited yet.