On the Gaussian process limit of Bayesian Additive Regression Trees
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). First posted on arXiv 26 Oct 2024.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 2.
4 papers.
- 2024Very fast Bayesian Additive Regression Trees on GPUcited by 2
- 2025BARK: A Fully Bayesian Tree Kernel for Black-box Optimizationcited by 2
- 2026Bayesian Additive Distribution Regressioncited by 1
- 2026Seeing the Forest for the Trees: The Gaussian Process Limit of BARTcited by 0
- 2026Seeing the Forest for the Trees: The Gaussian Process Limit of BART30 Jul 2026
- 2026Bayesian Additive Distribution Regression6 Mar 2026
- 2025BARK: A Fully Bayesian Tree Kernel for Black-box Optimization7 Mar 2025
- 2024Very fast Bayesian Additive Regression Trees on GPU30 Oct 2024