Metraipolis › archive › dc_85a3cceae364
A Moving-Horizon Approximate Branch-and-Reduce Method for Deep Classification Trees — arXiv:2609.38194
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38194
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T12:43:16.826Z
- SHA-256 of the archived text
e662ad2f3dc39f50a24516c37c7f59cb3ae400885e4db8a85e8b756c0c7eb373- Stable URL of this page
https://metraipolis.com/documento/dc_85a3cceae364
How to cite
A Moving-Horizon Approximate Branch-and-Reduce Method for Deep Classification Trees — arXiv:2609.38194 — arXiv (en), https://arxiv.org/abs/2609.38194 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_85a3cceae364 (Metraipolis archive dc_85a3cceae364, sha256 e662ad2f3dc39f50a24516c37c7f59cb3ae400885e4db8a85e8b756c0c7eb373)
BibTeX
@misc{dc85a3cceae364,
title = {A Moving-Horizon Approximate Branch-and-Reduce Method for Deep Classification Trees — arXiv:2609.38194},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38194},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_85a3cceae364; sha256 e662ad2f3dc39f50a24516c37c7f59cb3ae400885e4db8a85e8b756c0c7eb373},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38194. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Despite the importance for interpretability, decision trees face severe scalability challenges. Existing global optimal methods are often limited by binary feature selection and shallow tree depths, whereas traditional heuristic approaches frequently sacrifice predictive accuracy. To overcome these limitations, this paper proposes a moving-horizon approximate branch-and-reduce method to train near-optimal deep classification trees on large-scale datasets with continuous features. Built on a hierarchical root-subtree optimization framework, the method solves the root-level problem via branch-and-reduce while approximating the induced subtree problem using greedy heuristics. Although the underlying framework is capable of guaranteeing global optimality, the approximation, which functions as a lookahead rollout in a reinforcement learning context, significantly boosts efficiency for deeper structures. A low-cost moving-horizon strategy is then employed to iteratively refine model accuracy. Extensive numerical results demonstrate that our method exceeds the testing accuracy of existing heuristic baselines while offering significantly greater scalability, in terms of both dataset size and tree depth, than global optimal solvers. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-01 in cs.AI). Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.38194 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T12:14:13.829Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).