AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Learning Optimal Classification Trees Using a Binary Linear Program Formulation

AAAI 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: Predict-then-optimize learning · 141 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
binary-search encoding of thresholds with aggregated big-M constraints (BinOCT) vs OCTMIP decision tree learning · UCI datasets depth 2-3test accuracy: Monks-1 depth 2: 67.7 -> 80.0Helped
BinOCT vs CARTdecision tree learning · UCI datasets depth 4test accuracy: Statlog-sat 79.9 -> 65.9Hurt
warm start from CART solution (ablation)BinOCT · Statlog-sat depth 4test accuracy: 65.9 -> 79.9Helped
warm start from CART solution (ablation)BinOCT · UCI datasets depth 2-3training accuracyNo clear effect
BinOCT vs DTIPsMIP decision tree learning · Balance-scale, Bank marketing, PI-diabetestraining accuracy: PI-diabetes depth 2: 77.7 -> 79.3Helped
BinOCT vs OCTMIP decision tree learning · Winetest accuracy: 94.2 -> 88.0 (depth 3)Hurt

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