SOURCE-LINKED INTELLIGENCE

Scaling Optimal Classification Trees via Adaptive Feature and Sample Reduction

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

Dynamic programming for optimal classification trees becomes computationally expensive as the numbers of features and training samples increase. We develop a joint feature- and sample-space reduction framework based on STreeD. Weighted STreeD merges duplicate records created after projection onto a fixed candidate set into weighted representatives. This reduces sample-dependent computation without changing the fixed-candidate optimization problem. Adaptive STreeD repeatedly refines a bounded candidate set, retains features used by the incumbent tree, rebuilds the weighted representation, and s

Read original source ↗ Open in workspace

recordType

paper

region

Global