Asymptotic Theory for Random Forests

By Stefan Wager. 2014

67 citations recorded by the source corpus.

Random forests have proven to be reliable predictive algorithms in many application areas. Not much is known, however, about the statistical properties of random forests. Several authors have established conditions under which their predictions are consistent, but these results do not provide practical estimates of random forest errors. In this paper, we analyze a random forest model based on subsampling, and show that random forest predictions are asymptotically normal provided that the subsample size s scales as s(n)/n = o(log(n)^{-d}), where n is the number of training examples and d is the number of features. Moreover, we show that the asymptotic variance can consistently be estimated using an infinitesimal jackknife for bagged ensembles recently proposed by Efron (2014). In other words, our results let us both characterize and estimate the error-distribution of random forest predictions, thus taking a step towards making random forests tools for statistical inference instead of just black-box predictive algorithms.

Subfields: Environmental Engineering, Management, Monitoring, Policy and Law, Nature and Landscape Conservation

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Environmental Engineering

  1. Erwan Scornet
  2. Susan Athey
  3. Giles Hooker
  4. Lucas K. Mentch
  5. Gérard Biau
  6. Guenther Walther
  7. Jean-Philippe Vert
  8. Stefan Wager

In Management, Monitoring, Policy and Law

  1. Erwan Scornet
  2. Susan Athey
  3. Giles Hooker
  4. Lucas K. Mentch
  5. Gérard Biau
  6. Guenther Walther
  7. Stefan Wager

In Nature and Landscape Conservation

  1. Erwan Scornet
  2. Susan Athey
  3. Giles Hooker
  4. Lucas K. Mentch
  5. Gérard Biau
  6. Guenther Walther
  7. Stefan Wager

Citations in the corpus