Research map / Adversarial robustness and security / Certified and empirical robustness
Fast Provably Robust Decision Trees and Boosting
Jun-Qi Guo, Ming-Zhuo Teng, Wei Gao, Zhi-Hua Zhou
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Robust split optimization on adversarial 0/1 loss with leaf-aware trade-off (FPRDT) vs. local-only robust splitting (RIGDT-h, GROOT) | robust decision trees · 18 datasets | adversarial accuracy (win/tie/loss): FPRDT wins 18/0/0 vs RIGDT-h and GROOT, average .7802 vs .2922 and .7233 (decision tree/GROOT) | Improved |
| Robust boosting via PRAdaBoost (upper bound on adversarial exponential loss, FPRDT base learners) vs. standard AdaBoost | tree ensembles · 18 datasets | adversarial accuracy: .7918 vs .0943 average | Improved |
| PRAdaBoost vs PRBoosting (same upper bound, different base learners) | tree ensembles · 18 datasets | adversarial accuracy | No clear effect |
| FPRDT vs ROCT (global optimization) on the 18 datasets | robust decision trees · 18 datasets | adversarial accuracy (win/tie/loss): 16/1/1; average .7802 vs .7342 | Improved |
| FPRDT running time vs provably robust methods | robust decision trees · 18 datasets | running time: smallest running time among provably robust methods | Improved |
| PRAdaBoost vs PRBoosting running time | tree ensembles · 18 datasets | running time: about 10 times faster | Improved |
Closest papers by meaning
- Coevolutionary Algorithm for Building Robust Decision Trees under Minimax Regret (AAAI 2024 · similarity 0.86)
- Probably Approximately Global Robustness Certification (ICML 2025 · similarity 0.86)
- Robust Loss Functions for Training Decision Trees with Noisy Labels (AAAI 2024 · similarity 0.85)
- TTTS: Tree Test Time Simulation for Enhancing Decision Tree Robustness against Adversarial Examples (AAAI 2024 · similarity 0.85)
- Robust Minimax Boosting with Performance Guarantees (NeurIPS 2025 · similarity 0.85)
- Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees (ICML 2024 · similarity 0.85)
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.
