Analysis of purely random forests bias
Not on the map. Why?
Abstract (arXiv)
Random forests are a very effective and commonly used statistical method, but their full theoretical analysis is still an open problem. As a first step, simplified models such as purely random forests have been introduced, in order to shed light on the good performance of random forests. In this paper, we study the approximation error (the bias) of some purely random forest models in a regression framework, focusing in particular on the influence of the number of trees in the forest. Under some regularity assumptions on the regression function, we show that the bias of an infinite forest decreases at a faster rate (with respect to the size of each tree) than a single tree. As a consequence, infinite forests attain a strictly better risk rate (with respect to the sample size) than single trees. Furthermore, our results allow to derive a minimum number of trees sufficient to reach the same rate as an infinite forest. As a by-product of our analysis, we also show a link between the bias of purely random forests and the bias of some kernel estimators.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Jul 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 1; 2024: 3; 2025: 0; 2026: 2.
10 papers.
- 2022Random Forest Weighted Local Fr'echet Regression with Random Objectscited by 12
- 2021Scaffolding Setscited by 8
- 2023On the Convergence of CART under Sufficient Impurity Decrease Conditioncited by 5
- 2024Do we need rebalancing strategies? A theoretical and empirical study around SMOTE and its variantscited by 5
- 2021Minimax Rates for High-Dimensional Random Tessellation Forestscited by 4
- 2024Statistical Advantages of Oblique Randomized Decision Trees and Forestscited by 1
- 2024Minimax-optimal and Locally-adaptive Online Nonparametric Regressioncited by 1
- 2026How Many Trees in a Random Forest? A Revisited Approach with Plateau Search and Optuna Integrationcited by 1
- 2021WildWood: a new Random Forest algorithmcited by 0
- 2026Consistency of Honest Decision Trees and Random Forestscited by 0
- 2026How Many Trees in a Random Forest? A Revisited Approach with Plateau Search and Optuna Integration2 Jun 2026
- 2026Consistency of Honest Decision Trees and Random Forests21 Jan 2026
- 2024Minimax-optimal and Locally-adaptive Online Nonparametric Regression4 Oct 2024
- 2024Statistical Advantages of Oblique Randomized Decision Trees and Forests2 Jul 2024
- 2024Do we need rebalancing strategies? A theoretical and empirical study around SMOTE and its variants6 Feb 2024
- 2023On the Convergence of CART under Sufficient Impurity Decrease Condition26 Oct 2023
- 2022Random Forest Weighted Local Fr'echet Regression with Random Objects10 Feb 2022
- 2021Scaffolding Sets4 Nov 2021
- 2021Minimax Rates for High-Dimensional Random Tessellation Forests22 Sep 2021
- 2021WildWood: a new Random Forest algorithm16 Sep 2021