Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 124 of the 124 references it cites were found in a registry or an index; 4 of the 112 sources its claims cite were checked for support.

A random forest guided tour

Open access
Biau, Gérard, Scornet, Erwan · 2016 · Test

Abstract

The random forest algorithm, proposed by L. Breiman in 2001, has been extremely successful as a general-purpose classification and regression method. The approach, which combines several randomized decision trees and aggregates their predictions by averaging, has shown excellent performance in settings where the number of variables is much larger than the number of observations. Moreover, it is versatile enough to be applied to large-scale problems, is easily adapted to various ad hoc learning tasks, and returns measures of variable importance. The present article reviews the most recent theoretical and methodological developments for random forests. Emphasis is placed on the mathematical forces driving the algorithm, with special attention given to the selection of parameters, the resampling mechanism, and variable importance measures. This review is intended to provide non-experts easy access to the main ideas.

Overview

CoChat Summary

## TL;DR

This paper is a survey of random forests that reviews the algorithm’s construction, theoretical analyses, variable importance measures, and several extensions. It emphasizes that random forests are highly successful in practice, but that much of their behavior still lacks complete mathematical explanation.

## Key findings

  • Breiman’s original random forest builds M randomized trees, each from aₙ sampled observations, using mtry randomly chosen split directions at each node and stopping when a node has fewer than nodesize points; the default implementation cited is M = 500, mtry = ⌈p/3⌉ for regression, aₙ = n, and nodesize = 5 for regression.
  • The paper states that the variance of the forest decreases as M grows, and that choosing a large number of trees does not lead to overfitting; it also notes that the error of the finite forest can be made arbitrarily close to that of the infinite forest.
  • For simplified forest models, the review reports consistency results such as centered forests being consistent when k → ∞ and n / 2^k → ∞, and states that for sparse regression the convergence rate depends on the number of active variables |S| rather than the ambient dimension p.
  • For variable importance, the paper describes two measures: MDI and MDA; it reports that correlated variables can harm MDA performance, and in a Gaussian setting the variable importance decreases as the inverse of the square of p when the number of correlated variables increases.

## Methods

  • This is a narrative theoretical review, not an empirical study; it surveys the random forest literature and focuses on the mathematical structure of the method, parameter tuning, resampling, split selection, variable importance, and extensions.
  • The paper’s “data” are the cited results from prior theoretical and methodological work on random forests, including Breiman’s original algorithm, simplified forest models, bootstrap/subsampling analyses, and variable-importance theory.
  • The main analysis is synthesis and comparison of existing results, including descriptions of algorithmic steps, consistency and asymptotic normality results, kernel/nearest-neighbor connections, and known behavior of importance measures.

## Limitations

  • The authors state that little has been proven mathematically for the original Breiman procedure, and that the role of the bootstrap in random forests is still poorly understood.
  • They explicitly note that the consistency of the unpruned procedure comes at the price of a conjecture regarding CART behavior that is difficult to verify.
  • Evident from the text: this is a review article, so it does not present a new dataset or new experimental evaluation of random forests itself.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1007/s11749-016-0481-7

Cites

124 of 124 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

4 Valid · 4 Not valid · 83 Not checked · 47 Own results and interpretations

51 more claims

Create a free account to see all 138 claims and to verify the 108 references still open.

See all claims — free account
  • Probably not a substantial claim. 63
  • It may state two separate claims as one. 40
  • The quote only partly states this claim. 1

Create a free account to see these claims.

Citations

Cites

Show all 124 references

Research works printed but not linked: 3

  1. Cutler A, Zhao G (2001) PERT—perfect random tree ensembles. Comput Sci Stat 33:490–497
  2. Howard J, Bowles M (2012) The two most important algorithms in predictive modeling today. In: Strata Conference: Santa Clara. http://strataconf.com/strata2012/public/schedule/detail/22658
  3. Wager S, Hastie T, Efron B (2014) Confidence intervals for random forests: the jackknife and the infinitesimal jackknife. J Mach Learn Res 15:1625–1651

Cited by

See all 4,149

Metadata

Authors
Biau, G., & Scornet, E.
Affiliations
Centre National de la Recherche Scientifique (FR)
Venue
Test
Published
2016-04-19
Volume
25
Issue
2
Pages
197-227
ISSN
  • 1133-0686 (ISSN-L)
  • 1863-8260
OpenAlex
W2216946510
Cited by
4,149
References
124
Citations by year
2026: 570 · 2025: 934 · 2024: 829 · 2023: 701 · 2022: 463 · 2021: 317 · 2020: 170 · 2019: 100 · 2018: 43 · 2017: 15 · 2016: 6
FWCI
55.39
Type
journal article
Language
en
Open access
Licence
www.springer.com/tdm (tdm)
Locations
  • Test (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • HAL (submittedVersion, other-oa)
  • HAL (submittedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Applications
Keywords
random forest, ensemble learning, decision tree, variable importance measures, resampling, parameter selection, classification, regression analysis, high-dimensional data

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A random forest guided tour. https://app.cochat.ai/papers/10.1007/s11749-016-0481-7
The paper
Biau, G., & Scornet, E. (2016). A random forest guided tour. Test. https://doi.org/10.1007/s11749-016-0481-7

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.