Uniform Convergence of Random Forests via Adaptive Concentration

By Stefan Wager, Guenther Walther. 2015

24 citations recorded by the source corpus.

We study the convergence of the predictive surface of regression trees and forests. To support our analysis we introduce a notion of adaptive concentration for regression trees. This approach breaks tree training into a model selection phase in which we pick the tree splits, followed by a model fitting phase where we find the best regression model consistent with these splits. We then show that the fitted regression tree concentrates around the optimal predictor with the same splits: as d and n get large, the discrepancy is with high probability bounded on the order of sqrt(log(d)log(n)/k) uniformly over the whole regression surface, where d is the dimension of the feature space, n is the number of training examples, and k is the minimum leaf size for each tree. We also provide rate-matching lower bounds for this adaptive concentration statement. From a practical perspective, our result enables us to prove consistency results for adaptively grown forests in high dimensions, and to derive generalization bounds for a large class of regression forests.

Subfields: Artificial Intelligence, Statistics and Probability, Statistical Learning Theory

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. Susan Athey
  2. Stefan Wager
  3. Guido W. Imbens
  4. Velibor V. Misic
  5. Mihaela van der Schaar
  6. Ahmed M. Alaa
  7. Nathan Kallus
  8. Victor Chernozhukov

In Statistics and Probability

  1. Susan Athey
  2. Stefan Wager
  3. Guido W. Imbens
  4. Mihaela van der Schaar
  5. Victor Chernozhukov
  6. Ahmed M. Alaa
  7. Nathan Kallus
  8. Velibor V. Misic

In Statistical Learning Theory

  1. Susan Athey
  2. Stefan Wager
  3. Guido W. Imbens
  4. Velibor V. Misic

Citations in the corpus