Catalin Brita, Jacobus Van Der Linden
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Computing an optimal classification tree that provably maximizes training performance within a given size limit, is NPhard, and in practice, most state-of-the-art methods do not scale beyond computing optimal trees of depth three. Therefore, most methods rely on a coarse binarization of continuous features to maintain scalability. We propose a novel algorithm that optimizes trees directly on the continuous feature data using dynamic programming with branch-and-bound. We develop new pruning techniques that eliminate many suboptimal splits in the search when similar to previously computed splits and we provide an efficient subroutine for computing optimal depth-two trees. Our experiments demonstrate that these techniques improve runtime by one or more orders of magnitude over state-of-the-art optimal methods and improve test accuracy by 5% over greedy heuristics.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2501.07903")
get_code_for_paper("2501.07903")
have("2501.07903")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2501.07903.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2501.07903)
Connect an agent — have() is free.