On the Gaussian process limit of Bayesian Additive Regression Trees

Giacomo Petrillo
10/26/2024
stat.MLcs.LG

No official code found. Best implementation: Gattocrucco/bart-gp-article (0 stars, last commit 2025-07-26).

Abstract

Bayesian Additive Regression Trees (BART) is a nonparametric Bayesian regression technique of rising fame. It is a sum-of-decision-trees model, and is in some sense the Bayesian version of boosting. In the limit of infinite trees, it becomes equivalent to Gaussian process (GP) regression. This limit is known but has not yet led to any useful analysis or application. For the first time, I derive and compute the exact BART prior covariance function. With it I implement the infinite trees limit of BART as GP regression. Through empirical tests, I show that this limit is worse than standard BART in a fixed configuration, but also that tuning its hyperparameters in the natural GP way makes it competitive with BART. The advantage of using a GP surrogate of BART is the analytical likelihood, which simplifies model building and sidesteps the complex BART MCMC algorithm. More generally, this study opens new ways to understand and develop BART and GP regression. The implementation of BART as GP is available in the Python package lsqfitgp.

View on arXivView PDF

Code Implementations(1)

Code for Petrillo (2024) "On the Gaussian process limit of Bayesian Additive Regression Trees"

00R, TeXOct 26, 20241 years ago

Cite this paper

@article{petrillo2024gaussian,
  title  = {On the Gaussian process limit of Bayesian Additive Regression Trees},
  author = {Giacomo Petrillo},
  year   = {2024},
  eprint = {2410.20289},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.20289v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.20289.svg)](https://codeofpaper.com/paper/2410.20289)

Discussion