Research map / Learning theory and algorithms / Prediction and decision losses
Efficient Inference of Optimal Decision Trees
Florent Avellaneda
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| incremental SAT formula generation vs encoding all examples (DT1/DT2) | optimal decision tree inference · Mouse dataset | runtime (s): 12.9 -> 0.02 | Improved |
| incremental generation with depth-based encoding vs DT1 on 10% subsample | optimal decision tree inference · Car dataset | 10-fold CV accuracy: 55% -> 98.8% | Improved |
| consistent deeper optimal trees vs depth-limited BinOCT* | decision tree learners · balance-scale | 5-fold CV accuracy: 78.9% -> 93.0% | Improved |
| consistent optimal trees vs depth-limited baselines on Monks-3 | decision tree learners · Monks-probl-3 | accuracy: 94.2% -> 78.1% | Hurt |
| minimize node count after minimal depth (DT size vs DT depth) (ablation) | DT depth · 6 benchmark datasets | accuracy: 85.6% -> 88.3% average | Improved |
| minimize node count after minimal depth (DT size vs DT depth) (ablation) | DT depth · Car dataset | runtime (s): 127 -> 217 | Hurt |
| exact optimal trees vs J48 heuristic | artificial generator trees · 1000 random depth-5 trees | examples needed to recover generator | Improved |
Closest papers by meaning
- Near-Optimal Decision Trees in a SPLIT Second (ICML 2025 · similarity 0.91)
- Optimal Decision Tree Pruning Revisited: Algorithms and Complexity (ICML 2025 · similarity 0.91)
- Branches: Efficiently Seeking Optimal Sparse Decision Trees via AO* (ICML 2025 · similarity 0.89)
- Learning Small Decision Trees with Few Outliers: A Parameterized Perspective (AAAI 2024 · similarity 0.89)
- Witty: An Efficient Solver for Computing Minimum-Size Decision Trees (AAAI 2025 · similarity 0.89)
- Improving Decision Trees through the Lens of Parameterized Local Search (NeurIPS 2025 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
