Treant: Training Evasion-Aware Decision Trees
Not on the map. Why?
Abstract (arXiv)
Despite its success and popularity, machine learning is now recognized as vulnerable to evasion attacks, i.e., carefully crafted perturbations of test inputs designed to force prediction errors. In this paper we focus on evasion attacks against decision tree ensembles, which are among the most successful predictive models for dealing with non-perceptual problems. Even though they are powerful and interpretable, decision tree ensembles have received only limited attention by the security and machine learning communities so far, leading to a sub-optimal state of the art for adversarial learning techniques. We thus propose Treant, a novel decision tree learning algorithm that, on the basis of a formal threat model, minimizes an evasion-aware loss function at each step of the tree construction. Treant is based on two key technical ingredients: robust splitting and attack invariance, which jointly guarantee the soundness of the learning process. Experimental results on three publicly available datasets show that Treant is able to generate decision tree ensembles that are at the same time accurate and nearly insensitive to evasion attacks, outperforming state-of-the-art adversarial learning techniques.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 3; 2024: 2; 2025: 1.
12 papers.
- 2022SoK: Explainable Machine Learning for Computer Security Applicationscited by 20
- 2022Adversarial Robustness for Tabular Data through Cost and Utility Awarenesscited by 14
- 2021Robust Optimal Classification Trees Against Adversarial Examplescited by 11
- 2021Fair Training of Decision Tree Classifierscited by 4
- 2021Beyond Robustness: Resilience Verification of Tree-Based Classifierscited by 4
- 2023Prediction without Preclusion: Recourse Verification with Reachable Setscited by 4
- 2023Verifiable Learning for Robust Tree Ensemblescited by 3
- 2024Faster Repeated Evasion Attacks in Tree Ensemblescited by 1
- 2022AdIoTack: Quantifying and Refining Resilience of Decision Tree Ensemble Inference Models against Adversarial Volumetric Attacks on IoT Networkscited by 0
- 2023Symmetry Defense Against XGBoost Adversarial Perturbation Attackscited by 0
- 2024Verifiable Boosted Tree Ensemblescited by 0
- 2025On the Efficiency of Training Robust Decision Treescited by 0
- 2025On the Efficiency of Training Robust Decision Trees14 Jul 2025
- 2024Verifiable Boosted Tree Ensembles22 Feb 2024
- 2024Faster Repeated Evasion Attacks in Tree Ensembles13 Feb 2024
- 2023Prediction without Preclusion: Recourse Verification with Reachable Sets24 Aug 2023
- 2023Symmetry Defense Against XGBoost Adversarial Perturbation Attacks10 Aug 2023
- 2023Verifiable Learning for Robust Tree Ensembles5 May 2023
- 2022Adversarial Robustness for Tabular Data through Cost and Utility Awareness27 Aug 2022
- 2022SoK: Explainable Machine Learning for Computer Security Applications22 Aug 2022
- 2022AdIoTack: Quantifying and Refining Resilience of Decision Tree Ensemble Inference Models against Adversarial Volumetric Attacks on IoT Networks18 Mar 2022
- 2021Beyond Robustness: Resilience Verification of Tree-Based Classifiers5 Dec 2021
- 2021Robust Optimal Classification Trees Against Adversarial Examples8 Sep 2021
- 2021Fair Training of Decision Tree Classifiers4 Jan 2021