LGJan 30

Uncertainty-Aware Extrapolation in Bayesian Oblique Trees

arXiv:2601.22899v1h-index: 65
Originality Incremental advance
AI Analysis

This addresses the problem of unreliable extrapolation and uncertainty estimation in decision trees for regression tasks, which is an incremental improvement over existing Bayesian tree methods.

The paper tackles the problem of decision trees struggling with reliable extrapolation and uncertainty calibration in regression tasks by proposing a Bayesian oblique tree model with Gaussian Process leaves. The result shows improvements in predictive performance compared to standard variational oblique trees and substantial gains in extrapolation scenarios.

Decision trees are widely used due to their interpretability and efficiency, but they struggle in regression tasks that require reliable extrapolation and well-calibrated uncertainty. Piecewise-constant leaf predictions are bounded by the training targets and often become overconfident under distribution shift. We propose a single-tree Bayesian model that extends VSPYCT by equipping each leaf with a GP predictor. Bayesian oblique splits provide uncertainty-aware partitioning of the input space, while GP leaves model local functional behaviour and enable principled extrapolation beyond the observed target range. We present an efficient inference and prediction scheme that combines posterior sampling of split parameters with \gls{gp} posterior predictions, and a gating mechanism that activates GP-based extrapolation when inputs fall outside the training support of a leaf. Experiments on benchmark regression tasks show improvements in the predictive performance compared to standard variational oblique trees, and substantial performance gains in extrapolation scenarios.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes