AI Paper Atlas

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

Efficient Inference of Optimal Decision Trees

Florent Avellaneda

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

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 changedWhereMeasuredEffect
incremental SAT formula generation vs encoding all examples (DT1/DT2)optimal decision tree inference · Mouse datasetruntime (s): 12.9 -> 0.02Improved
incremental generation with depth-based encoding vs DT1 on 10% subsampleoptimal decision tree inference · Car dataset10-fold CV accuracy: 55% -> 98.8%Improved
consistent deeper optimal trees vs depth-limited BinOCT*decision tree learners · balance-scale5-fold CV accuracy: 78.9% -> 93.0%Improved
consistent optimal trees vs depth-limited baselines on Monks-3decision tree learners · Monks-probl-3accuracy: 94.2% -> 78.1%Hurt
minimize node count after minimal depth (DT size vs DT depth) (ablation)DT depth · 6 benchmark datasetsaccuracy: 85.6% -> 88.3% averageImproved
minimize node count after minimal depth (DT size vs DT depth) (ablation)DT depth · Car datasetruntime (s): 127 -> 217Hurt
exact optimal trees vs J48 heuristicartificial generator trees · 1000 random depth-5 treesexamples needed to recover generatorImproved

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