arxiv
PublishedOctober 1, 2026 at 4:00 AM
A Moving-Horizon Approximate Branch-and-Reduce Method for Deep Classification Trees
Publisher summary· verbatim
arXiv:2609.38194v1 Announce Type: cross Abstract: 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
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivReasoning Externalization for Faithful Large Language Model Narratives of Stock Return Predictions5harxivConsistent Plan-Act for Long-Horizon Agentic Tasks5harxivPredictive Self-Supervised Learning Provably Identifies Stochastic Signals under Nuisance5harxivBoosting Adversarial Robustness and Generalization with Dictionary Structure5hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗