Backend
RoBART: Bayesian Additive Regression Trees with Tree-Specific Rotations
arXiv stat.ML0 views
arXiv:2610.10214v1 Announce Type: new Abstract: 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 $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.
Source:https://arxiv.org/abs/2610.10214PreviousBroadly Applicable Approximate MCMC for Switching Stochastic Differential Equations Using Uniformization and Time-Conditioned Factorized Neural Likelihood EstimationNextData Reuse in Non-Stationary Learning
Related posts

I Put My Country's Entire Legal Code in Git: 300,000+ Documents Since 1810
0HackerNoon

Gemini CLI's mkdir Failed, the Agent Kept Going, and Each move Overwrote the Last File
0dev.to

I built a gesture app for macOS 26. Here's how it works and how launch week went
0dev.to

When Scripting Saves the Day... After Almost Deleting System32🥲
0dev.to
Goldman Sachs restricts Claude Code and GitHub Copilot to engineers
0dev.to
Convert PNG to JPEG or WebP in the Browser: What Happens to Transparency
0dev.to