Bayesian Additive Regression Trees using Bayesian Model Averaging
Belinda Hern\'andez, Adrian E. Raftery, Stephen R. Pennington, Andrew, C. Parnell

TL;DR
BART-BMA is a new, efficient Bayesian model averaging algorithm for high-dimensional data that combines elements of BART and random forests, enabling probabilistic predictions in large p scenarios.
Contribution
It introduces BART-BMA, an efficient Bayesian model averaging method that handles high-dimensional datasets better than traditional BART and random forests.
Findings
BART-BMA runs efficiently on standard laptops for small n, large p datasets.
It performs well on simulated and real proteomic data.
Compared to competitors, BART-BMA offers competitive or superior predictive performance.
Abstract
Bayesian Additive Regression Trees (BART) is a statistical sum of trees model. It can be considered a Bayesian version of machine learning tree ensemble methods where the individual trees are the base learners. However for data sets where the number of variables is large (e.g. ) the algorithm can become prohibitively expensive, computationally. Another method which is popular for high dimensional data is random forests, a machine learning algorithm which grows trees using a greedy search for the best split points. However, as it is not a statistical model, it cannot produce probabilistic estimates or predictions. We propose an alternative algorithm for BART called BART-BMA, which uses Bayesian Model Averaging and a greedy search algorithm to produce a model which is much more efficient than BART for datasets with large . BART-BMA incorporates elements of both BART…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
