Skip to content
OtherLow

RoBART: Bayesian Additive Regression Trees with Tree-Specific Rotations

Occurred
Oct 7, 2026
Published
Oct 7, 2026
Source
arXiv

Summary

Bayesian additive regression trees (BART) can require many splits to approximate boundaries misaligned with the predictor axes. RoBART assigns each tree a rotation shared by all internal nodes, retaining axis-aligned splits in rotated coordinates and constant leaves. We jointly propose a Givens rotation sequence and cutpoints on the resulting grid by Metropolis-Hastings and establish reversibility with respect to the conditional posterior with leaf means integrated out. For additive functions with component-specific rotations and anisotropic Hölder smoothness, we prove posterior contraction in empirical $L_2$ distance and for the noise standard deviation. Under the stated prior, design, and grid conditions, with fixed numbers of predictors, trees, and components and no more components than trees, the rate is a sum of componentwise rates determined by smoothness and the number of rotated coordinates used. We also establish a posterior contraction lower bound showing that there exist functions for which RoBART adapts to the intrinsic dimension but axis-aligned BART does not.

Classification

Category confidence: 95%
Severity confidence: 95%

Rationale: This is a theoretical research paper on machine learning methodology, not an AI safety incident.

Classifier: Qwen/Qwen3.5-35B-A3B-FP8

Visit source