mlsanityData to 7 Oct 2026

RoBART: Bayesian Additive Regression Trees with Tree-Specific Rotations

arXiv 2610.10214 ↗First posted 7 Oct 2026stat.ML cs.LG math.STcited by 0

Not on the map. Why?

Abstract (arXiv)

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"older smoothness, we prove posterior contraction in empirical L2 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.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 1 of its 15 references that are in the map. First posted on arXiv 7 Oct 2026.

Builds on

1 of 15 references.

References · 1

  1. 2024Scalable piecewise smoothing with BARTcited by 2

Built on by

Not cited yet.