atlas

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

Robustness Verification of Tree-based Models

NeurIPS 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: Semidefinite relaxations for verification · 38 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
Use the multilevel clique verifier instead of MILPGBDT robustness verification · Natural and robust GBDTs across the nine reported datasetsverification time: up to ∼ 3000X speedupHelped
Use the multilevel clique verifier instead of LP relaxationGBDT robustness verification · Natural and robust GBDTslower-bound qualityHelped
Increase the number of clique-enumeration levels (ablation)Multilevel verifier · 20-tree GBDT on diabeteslower-bound tightnessHelped
Use larger cliques at each level (ablation)Multilevel verifier · 20-tree GBDT on diabeteslower-bound tightnessHelped
Add dynamic programming for the final single-layer bound (ablation)Multilevel verifier · Natural and robust GBDTs across datasetslower-bound distortion: .208 -> .209 (breast-cancer natural); .109 -> .111 (diabetes robust); .026 -> .027 (ijcnn1 natural)Helped

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