AI Paper Atlas

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

Optimal Sparse Decision Trees

Xiyang Hu, Cynthia Rudin, Margo Seltzer

NeurIPS 2019 · Learning theory and algorithms › Prediction and decision losses · approach: Optimal decision tree learning · 10 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
search over trees of any shape with a leaf penalty instead of complete binary trees of fixed depth (OSDT vs BinOCT)optimal decision trees · Tic-Tac-Toe 8 leavesaccuracy: 76.722% -> 82.881%Improved
search over trees of any shape with a leaf penalty instead of complete binary trees (OSDT vs BinOCT)optimal decision trees · Monk1accuracy: 91.129% -> 100%Improved
add lookahead and equivalent-points bounds (ablation)OSDT · runtime and memorytime to optimumImproved
schedule with curiosity instead of lower bound (ablation)OSDT · COMPAStime to find optimumImproved
add extra irrelevant features (4 to 12)OSDT · COMPAS scalabilityfraction of runtime to reach optimum: about 75% -> about 5%Improved
incremental computation, data structures and worklist orderingOSDT · execution timerun time saved: >97%Improved

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