BART: Bayesian Additive Regression Trees

By Hugh A. Chipman, Edward I. George, Robert E. McCulloch. 2008

2,052 citations recorded by the source corpus.

We develop a Bayesian "sum-of-trees" model where each tree is constrained by a regularization prior to be a weak learner, and fitting and inference are accomplished via an iterative Bayesian backfitting MCMC algorithm that generates samples from a posterior. Effectively, BART is a nonparametric Bayesian regression approach which uses dimensionally adaptive random basis elements. Motivated by ensemble methods in general, and boosting algorithms in particular, BART is defined by a statistical model: a prior and a likelihood. This approach enables full posterior inference including point and interval estimates of the unknown regression function as well as the marginal effects of potential predictors. By keeping track of predictor inclusion frequencies, BART can also be used for model-free variable selection. BART's many features are illustrated with a bake-off against competing methods on 42 different data sets, with a simulation experiment and on a drug discovery classification problem.

Subfields: Artificial Intelligence, Statistics and Probability, Probabilistic & Bayesian Methods

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. Cynthia Rudin
  2. Mihaela van der Schaar
  3. Ahmed M. Alaa
  4. Stefan Wager
  5. Yoav Goldberg
  6. Susan Athey
  7. Ioana Bica
  8. Matt Taddy

In Statistics and Probability

  1. Mihaela van der Schaar
  2. Stefan Wager
  3. Cynthia Rudin
  4. Susan Athey
  5. Ahmed M. Alaa
  6. Guido W. Imbens
  7. Ioana Bica
  8. Bin Yu

In Probabilistic & Bayesian Methods

  1. Mihaela van der Schaar
  2. Christian P. Robert
  3. Susan Athey
  4. Stefan Wager
  5. David A. Sontag
  6. Cynthia Rudin
  7. Uri Shalit
  8. Suchi Saria

Citations in the corpus