AI Paper Atlas

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

Convex Polytope Trees

Mohammadreza Armandpour, Ali Sadeghian, Mingyuan Zhou

NeurIPS 2021 · Learning theory and algorithms › Prediction and decision losses · approach: Optimal decision tree learning · 0 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
allow multiple polytope facets instead of restricting each node to K=1 hyperplane cuts (ablation)CPT · MNISTACC: 95.74 -> 97.01Improved
allow multiple polytope facets instead of restricting each node to K=1 hyperplane cuts (ablation)CPT · SensITACC: 84.87 -> 85.77Improved
allow multiple polytope facets instead of restricting each node to K=1 hyperplane cuts (ablation)CPT · Connect4ACC: 78.89 -> 81.16Improved
allow multiple polytope facets instead of restricting each node to K=1 hyperplane cuts (ablation)CPT · LetterACC: 84.13 -> 90.51Improved
allow multiple polytope facets instead of restricting each node to K=1 hyperplane cuts (ablation)CPT · PDBbindRMSE: 1.453 -> 1.413Improved
allow multiple polytope facets instead of restricting each node to K=1 hyperplane cuts (ablation)CPT · BaceAUC: 82.06 -> 84.7Improved
allow multiple polytope facets instead of restricting each node to K=1 hyperplane cuts (ablation)CPT · HIVAUC: 71.12 -> 73.1Improved

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