Research map / Learning theory and algorithms / Combinatorial and search optimization
Scalable Optimal Multiway-Split Decision Trees with Constraints
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 |
|---|---|---|---|
| Use path-based MIP with column generation for tree construction instead of the arc-based FlowOCT formulation | Optimal decision trees · Small/medium datasets, d=4 | median runtime (seconds): 177.0 -> 15.6 | Helped |
| Use path-based MIP with column generation for tree construction instead of the arc-based FlowOCT formulation | Optimal decision trees · Small/medium datasets, d=5 | median runtime (seconds): 561.4 -> 21.9 | Helped |
| Use path-based MIP with column generation for tree construction instead of the arc-based FlowOCT formulation | Optimal decision trees · Small/medium datasets, d=2 | median runtime (seconds): 1.9 -> 3.9 | Hurt |
| Use multiway-split OMT rather than CART | Decision trees · Large datasets | test accuracy: 6 of the 8 instances | Mixed |
| Use multiway-split OMT rather than FlowOCT | Decision trees · Large datasets | misclassification error: 8.4% | Helped |
| Use multiway-split OMT rather than binary-split ODT methods | Small/medium classification datasets · 48 dataset-depth combinations | out-of-sample accuracy wins: 56.3% | Helped |
Closest papers by meaning
- A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees (NeurIPS 2020 · similarity 0.92)
- A Scalable Deterministic Global Optimization Algorithm for Training Optimal Decision Tree (NeurIPS 2022 · similarity 0.91)
- Witty: An Efficient Solver for Computing Minimum-Size Decision Trees (AAAI 2025 · similarity 0.88)
- Near-Optimal Decision Trees in a SPLIT Second (ICML 2025 · similarity 0.87)
- Optimal Decision Tree Pruning Revisited: Algorithms and Complexity (ICML 2025 · similarity 0.86)
- Branches: Efficiently Seeking Optimal Sparse Decision Trees via AO* (ICML 2025 · similarity 0.86)
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.