On Semi-parametric Inference for BART
Veronika Rocková
Abstract
There has been a growing realization of the potential of Bayesian machine learning as a platform that can provide both flexible modeling, accurate predictions as well as coherent uncertainty statements. In particular, Bayesian Additive Regression Trees (BART) have emerged as one of today's most effective general approaches to predictive modeling under minimal assumptions. Statistical theoretical developments for machine learning have been mostly concerned with approximability or rates of estimation when recovering infinite dimensional objects (curves or densities). Despite the impressive array of available theoretical results, the literature has been largely silent about uncertainty quantification. In this work, we continue the theoretical investigation of BART initiated recently by (Ročková and van der Pas, 2017). We focus on statistical inference questions. In particular, we study the Bernstein-von Mises (BvM) phenomenon (i.e. asymptotic normality) for smooth linear functionals of the regression surface within the framework of nonparametric regression with fixed covariates. Our semi-parametric BvM results show that, beyond rate-optimal estimation, BART can be also used for valid statistical inference.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 30f84927-3cb7-4ffb-be21-9f382aeeab13Cited by top-tier papers1
Ask how each one uses itRelated papers
- BARK: A Fully Bayesian Tree Kernel for Black-box OptimizationToby Boyne, Jose Pablo Folch, Robert M. Lee, Behrang Shafei et al.ICML 2025
- BAMDT: Bayesian Additive Semi-Multivariate Decision Trees for Nonparametric RegressionZhao Tang Luo, Huiyan Sang, Bani K. MallickICML 2022 · 5 citations
- Probabilistically-routed Bayesian Additive Spanning Trees for Learning on Constrained DomainsAbhisek Chakraborty, Abhishek Mandal, Anirban ChakrabortyICML 2026
- Bayesian Probabilistic Numerical Integration with Tree-Based ModelsHarrison Zhu, Xing Liu, Ruya Kang, Zhichao Shen et al.NeurIPS 2020 · 9 citations
- Bernstein-von Mises for Adaptively Collected DataKevin Du, Yash Nair, Lucas JansonNeurIPS 2025 · 1 citation
