2025
A faster training algorithm for regression trees with linear leaves, and an analysis of its complexity
NeurIPS 2025poster
We consider the Tree Alternating Optimization (TAO) algorithm to train regression trees with linear predictors in the leaves. Unlike the traditional, greedy recursive partitioning algorithms such as CART, TAO guarantees a monotonic decrease of the objective function and results in smaller trees of m…