arXiv Machine Learning
Scaling Optimal Classification Trees via Adaptive Feature and Sample Reduction
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
3d ago
A Moving-Horizon Approximate Branch-and-Reduce Method for Deep Classification Trees
The paper introduces a moving-horizon approximate branch‑and‑reduce method for training deep classification trees on large datasets with continuous features. It combines a hierarchical root‑subtree optimization framework, branch‑and‑reduce at the root, greedy heuristics for subtrees, and a low‑cost moving‑horizon refinement to improve accuracy. Experiments show the approach surpasses heuristic baselines in test accuracy while scaling better in dataset size and tree depth than existing global optimal solvers.
arXiv Machine Learning
Jul 31
Search Strategies for Optimal Classification and Regression Trees
arXiv:2607. 28170v1 Announce Type: new Abstract: Optimal decision trees (ODTs) are compact, interpretable machine learning models that globally optimize a given objective, but their scalability remains challenging.
arXiv Machine Learning
Jul 3
Conditional Inference Trees and Forests for Feature Selection
arXiv:2607. 01417v1 Announce Type: new Abstract: Conditional inference trees (CIT) and conditional inference forests (CIF) reduce split-selection bias by testing features before choosing split thresholds, but repeated permutation tests and threshold searches can make these methods computationally expensive.
arXiv Machine Learning
Aug 6
ArborEnum: Decision Tree Rashomon Sets over Continuous Features
arXiv:2608. 04310v1 Announce Type: new Abstract: The Rashomon effect describes the phenomenon that many models can achieve nearly equivalent performance on the same learning task, with significant ramifications for robustness, feature importance, and customizability.
arXiv Machine Learning
Sep 22
An Exact Junction-Tree Extended Formulation for Optimal Classification Trees
arXiv:2609.24741v1 Announce Type: new Abstract: We develop an exact linear programming (LP) formulation for bounded-depth classification trees with binary features, using a junction-tree representati...
arXiv AI
Jul 14
Algorithm Selection with Zero Domain Knowledge via Text Embeddings
arXiv:2604. 19753v2 Announce Type: replace Abstract: We propose a feature-free approach to algorithm selection: instead of hand-crafted instance features, we use pretrained text embeddings.