Genetic Adversarial Training of Decision Trees
Not on the map. Why?
Abstract (arXiv)
We put forward a novel learning methodology for ensembles of decision trees based on a genetic algorithm which is able to train a decision tree for maximizing both its accuracy and its robustness to adversarial perturbations. This learning algorithm internally leverages a complete formal verification technique for robustness properties of decision trees based on abstract interpretation, a well known static program analysis technique. We implemented this genetic adversarial training algorithm in a tool called Meta-Silvae (MS) and we experimentally evaluated it on some reference datasets used in adversarial training. The experimental results show that MS is able to train robust models that compete with and often improve on the current state-of-the-art of adversarial training of decision trees while being much more compact and therefore interpretable and efficient tree models.
Key facts. Cited by 6 papers in the map (data through 13 Oct 2026). First posted on arXiv 21 Dec 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 1.
6 papers.
- 2021Fair Training of Decision Tree Classifierscited by 4
- 2021Beyond Robustness: Resilience Verification of Tree-Based Classifierscited by 4
- 2023Verifiable Learning for Robust Tree Ensemblescited by 3
- 2023Coevolutionary Algorithm for Building Robust Decision Trees under Minimax Regretcited by 2
- 2022Adversarial Example Detection in Deployed Tree Ensemblescited by 0
- 2024Verifiable Boosted Tree Ensemblescited by 0
- 2024Verifiable Boosted Tree Ensembles22 Feb 2024
- 2023Coevolutionary Algorithm for Building Robust Decision Trees under Minimax Regret14 Dec 2023
- 2023Verifiable Learning for Robust Tree Ensembles5 May 2023
- 2022Adversarial Example Detection in Deployed Tree Ensembles27 Jun 2022
- 2021Beyond Robustness: Resilience Verification of Tree-Based Classifiers5 Dec 2021
- 2021Fair Training of Decision Tree Classifiers4 Jan 2021