pith. sign in

arxiv: 1407.3939 · v1 · pith:4CNHYYP6new · submitted 2014-07-15 · 🧮 math.ST · cs.LG· stat.ME· stat.TH

Analysis of purely random forests bias

classification 🧮 math.ST cs.LGstat.MEstat.TH
keywords forestsrandombiasforestpurelyanalysisinfiniterate
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Consistency of Honest Decision Trees and Random Forests

    stat.ME 2026-01 unverdicted novelty 4.0

    Honest decision trees and random forests achieve weak, almost sure, and uniform consistency for regression under mild conditions via elementary proofs.