SOURCE-LINKED INTELLIGENCE

Learned Look-Ahead Splitting Rule for CART

arXiv · AI, language, vision and robotics · article · Sep 14, 2026 · UTC

Classification and regression trees are typically constructed using a greedy splitting rule that maximizes the immediate reduction in prediction error at each node. Although this strategy is computationally efficient, it can miss splits that yield small short-term gains but create substantial downstream improvements after further partitioning. We propose a look-ahead tree-building method that evaluates each candidate split by the prediction error reduction achieved after growing a conventional CART subtree below that split. Because the full look-ahead procedure can be computationally expensive

Read original source ↗ Open in workspace

recordType

paper

region

Global