Bayesian Additive Regression Trees, Computational Approaches
- 15 February 2022
- book chapter
- Published by Wiley
- p. 1-23
Abstract
Methods based on binary trees play a fundamental role in modern data science. In this article, we give a very focused review of basic Bayesian approaches to tree modeling. Bayesian approaches have some fundamental advantages. Complex models are enhanced with meaningful prior specifications, and Markov chain Monte Carlo provides a framework for useful stochastic search of the model space along with some sense of uncertainty. Bayesian approaches require a specification of a prior in tree space and computation of a high and variable dimension posterior. We provide some computational details that are not readily available in the literature. We also review a few more recent extensions of the basic approaches to illustrate the power and potential of the overall approach.Keywords
This publication has 14 references indexed in Scilit:
- Efficient Metropolis–Hastings Proposal Mechanisms for Bayesian Regression Tree ModelsBayesian Analysis, 2016
- Decoupling Shrinkage and Selection in Bayesian Linear Models: A Posterior Summary PerspectiveJournal of the American Statistical Association, 2015
- Variable selection for BART: An application to gene regulationThe Annals of Applied Statistics, 2014
- Bayesian regression structure discovery2013
- BART: Bayesian additive regression treesThe Annals of Applied Statistics, 2010
- Random ForestsMachine Learning, 2001
- Greedy function approximation: A gradient boosting machine.The Annals of Statistics, 2001
- Bayesian CART Model SearchJournal of the American Statistical Association, 1998
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- Hedonic housing prices and the demand for clean airJournal of Environmental Economics and Management, 1978