AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Learning Optimal Decision Trees Using Caching Branch-and-Bound Search

AAAI 2020 · Learning theory and algorithms › Prediction and decision losses · approach: Optimal decision tree learning · 110 citations (OpenAlex)

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 changedWhereMeasuredEffect
DL8.5 (branch-and-bound + partial-result caching) instead of BinOCT MIPoptimal decision tree learning · 24 binary datasets, depth 4instances solved: 1 -> 19Helped
add branch-and-bound and partial caching to DL8DL8 · 24 binary datasets, depth 4instances solved: 7 -> 19Helped
cache incomplete (NO TREE) results (ablation)DL8.5 · 24 binary datasets, depth 4instances solved: 12 -> 19Helped
order attributes by decreasing information gain vs other orders (ablation)DL8.5 · binary datasets, deeper treesruntimeHelped
branching heuristic choice (ablation)DL8.5 · continuous datasets, depth 2runtimeNo clear effect
DL8.5 instead of DL8optimal decision tree learning · banknote, depth 2time (s): 363.01 -> 52.81Helped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy