English

Alpha-Trimming: Locally Adaptive Tree Pruning for Random Forests

Machine Learning 2024-08-15 v1 Machine Learning Computation

Abstract

We demonstrate that adaptively controlling the size of individual regression trees in a random forest can improve predictive performance, contrary to the conventional wisdom that trees should be fully grown. A fast pruning algorithm, alpha-trimming, is proposed as an effective approach to pruning trees within a random forest, where more aggressive pruning is performed in regions with a low signal-to-noise ratio. The amount of overall pruning is controlled by adjusting the weight on an information criterion penalty as a tuning parameter, with the standard random forest being a special case of our alpha-trimmed random forest. A remarkable feature of alpha-trimming is that its tuning parameter can be adjusted without refitting the trees in the random forest once the trees have been fully grown once. In a benchmark suite of 46 example data sets, mean squared prediction error is often substantially lowered by using our pruning algorithm and is never substantially increased compared to a random forest with fully-grown trees at default parameter settings.

Keywords

Cite

@article{arxiv.2408.07151,
  title  = {Alpha-Trimming: Locally Adaptive Tree Pruning for Random Forests},
  author = {Nikola Surjanovic and Andrew Henrey and Thomas M. Loughin},
  journal= {arXiv preprint arXiv:2408.07151},
  year   = {2024}
}
R2 v1 2026-06-28T18:12:12.996Z