Research map / Learning theory and algorithms / Prediction and decision losses
Connecting Interpretability and Robustness in Decision Trees through Separation
Michal Moshkovitz, Yao-Yuan Yang, Kamalika Chaudhuri
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 |
|---|---|---|---|
| Use BBM-RS rather than the competing interpretable methods | BBM-RS · 13 real-world datasets | interpretation complexity | Improved |
| Use BBM-RS rather than the competing interpretable methods | BBM-RS · 13 real-world datasets | empirical robustness | Improved |
| Use BBM-RS rather than the competing interpretable methods | BBM-RS · 13 real-world datasets | test accuracy | Mixed |
| Increase the noise level τ (ablation) | BBM-RS on spambase · spambase | interpretation complexity: 22.5 -> 2.3 | Improved |
| Increase the noise level τ (ablation) | BBM-RS on spambase · spambase | empirical robustness: 0.006 -> 0.33 | Improved |
Closest papers by meaning
- Leveraging Predictive Equivalence in Decision Trees (ICML 2025 · similarity 0.88)
- Robust Loss Functions for Training Decision Trees with Noisy Labels (AAAI 2024 · similarity 0.87)
- Multistage Defer Trees for Hybrid Interpretability: If at First You Can't Succeed, Tree Again (NeurIPS 2026 · similarity 0.87)
- Learning Small Decision Trees with Few Outliers: A Parameterized Perspective (AAAI 2024 · similarity 0.85)
- Near-Optimal Decision Trees in a SPLIT Second (ICML 2025 · similarity 0.85)
- Optimal Decision Tree Pruning Revisited: Algorithms and Complexity (ICML 2025 · similarity 0.84)
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.
