AI Paper Atlas

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

Decision trees as partitioning machines to characterize their generalization properties

Jean-Samuel Leboeuf, Frédéric LeBlanc, Mario Marchand

NeurIPS 2020 · Learning theory and algorithms › Prediction and decision losses · approach: Optimal decision tree learning · 7 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
Use growth-bound-based pruning instead of CART cost-complexity pruningCART-grown decision trees · 19 UCI datasetsmean test accuracy: 2.02%Improved
Use growth-bound-based pruning instead of CART cost-complexity pruningCART-grown decision trees · 19 UCI datasetspruning speed: 19.5 times fasterImproved
Replace leaf-count complexity with the paper-inspired complexity dependence in CART pruningCART cost-complexity pruning · 19 UCI datasetsmean test accuracy: 1.20%Improved
Use growth-bound-based pruning instead of CART cost-complexity pruningCART-grown decision trees · Planning Relaxtest accuracy: 0.725 ± 0.049 -> 0.595 ± 0.075Hurt
Use growth-bound-based pruning instead of CART cost-complexity pruningCART-grown decision trees · Habermans Survivaltest accuracy: 0.746 ± 0.043 -> 0.719 ± 0.043Hurt
Use growth-bound-based pruning instead of CART cost-complexity pruningCART-grown decision trees · 19 UCI datasetstest accuracyMixed

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