Confidence Intervals for Random Forests: The Jackknife and the Infinitesimal Jackknife

By Stefan Wager, Trevor J. Hastie, Bradley Efron. 2013

434 citations recorded by the source corpus.

We study the variability of predictions made by bagged learners and random forests, and show how to estimate standard errors for these methods. Our work builds on variance estimates for bagging proposed by Efron (1992, 2013) that are based on the jackknife and the infinitesimal jackknife (IJ). In practice, bagged predictors are computed using a finite number B of bootstrap replicates, and working with a large B can be computationally expensive. Direct applications of jackknife and IJ estimators to bagging require B = Θ(n1.5) bootstrap replicates to converge, where n is the size of the training set. We propose improved versions that only require B = Θ(n) replicates. Moreover, we show that the IJ estimator requires 1.7 times less bootstrap replicates than the jackknife to achieve a given accuracy. Finally, we study the sampling distributions of the jackknife and IJ variance estimates themselves. We illustrate our findings with multiple experiments and simulation studies.

Subfields: Artificial Intelligence, Statistics and Probability

How researchers see this paper

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

In Artificial Intelligence

  1. Stefan Wager
  2. Susan Athey
  3. Erwan Scornet
  4. E.J. Candes
  5. Gérard Biau
  6. Julie Tibshirani
  7. Lucas K. Mentch
  8. Timothy C. Au

In Statistics and Probability

  1. Stefan Wager
  2. E.J. Candes
  3. Susan Athey
  4. Lucas K. Mentch
  5. Robert Tibshirani
  6. Julie Tibshirani
  7. Jing Lei
  8. Matteo Sesia

Citations in the corpus