ForestPrune: Compact Depth-Controlled Tree Ensembles
Not on the map. Why?
Abstract (arXiv)
Tree ensembles are powerful models that achieve excellent predictive performances, but can grow to unwieldy sizes. These ensembles are often post-processed (pruned) to reduce memory footprint and improve interpretability. We present ForestPrune, a novel optimization framework to post-process tree ensembles by pruning depth layers from individual trees. Since the number of nodes in a decision tree increases exponentially with tree depth, pruning deep trees drastically compactifies ensembles. We develop a specialized optimization algorithm to efficiently obtain high-quality solutions to problems under ForestPrune. Our algorithm typically reaches good solutions in seconds for medium-size datasets and ensembles, with 10000s of rows and 100s of trees, resulting in significant speedups over existing approaches. Our experiments demonstrate that ForestPrune produces parsimonious models that outperform models extracted by existing post-processing algorithms.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 7 of its 32 references that are in the map. First posted on arXiv 31 May 2022.
Builds on
7 of 32 references.
References · 7
- 2014OpenML: networked science in machine learningcited by 526
- 2015Coordinate Descent Algorithmscited by 219
- 2015Best Subset Selection via a Modern Optimization Lenscited by 100
- 2018Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithmscited by 53
- 2020Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimizationcited by 45
- 2017Sparse High-Dimensional Regression: Exact Scalable Algorithms and Phase Transitionscited by 43
- 2017Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergencecited by 17
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 1; 2026: 3.
7 papers.
- 2024Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensemblescited by 4
- 2024Alpha-Trimming: Locally Adaptive Tree Pruning for Random Forestscited by 2
- 2025Boosted Trees on a Diet: Compact Models for Resource-Constrained Devicescited by 1
- 2026PACE: Prune-And-Compress Ensemble Modelscited by 1
- 2023Bayesian post-hoc regularization of random forestscited by 0
- 2026Minimax Rates and Spectral Distillation for Tree Ensemblescited by 0
- 2026PINE: Pruning Boosted Tree Ensembles with Conformal In-Distribution Prediction Equivalencecited by 0
- 2026PINE: Pruning Boosted Tree Ensembles with Conformal In-Distribution Prediction Equivalence27 May 2026
- 2026Minimax Rates and Spectral Distillation for Tree Ensembles12 May 2026
- 2026PACE: Prune-And-Compress Ensemble Models7 May 2026
- 2025Boosted Trees on a Diet: Compact Models for Resource-Constrained Devices30 Oct 2025
- 2024Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles28 Aug 2024
- 2024Alpha-Trimming: Locally Adaptive Tree Pruning for Random Forests13 Aug 2024
- 2023Bayesian post-hoc regularization of random forests6 Jun 2023