Adversarial Training of Gradient-Boosted Decision Trees
Accepted as Short Paper at CIKM ’19: ACM International Conference on Information and Knowledge Management .
Abstract. Adversarial training is a prominent approach to make machine learning (ML) models resilient to adversarial examples. Unfortunately, such approach assumes the use of diﬀerentiable learning models, hence it cannot be applied to relevant ML techniques, such as ensembles of decision trees. In this paper, we generalize adversarial training to gradient-boosted decision trees (GBDTs). Our experiments show that the performance of classiﬁers based on existing learning techniques either sharply decreases upon attack or is unsatisfactory in absence of attacks, while adversarial training provides a very good trade-oﬀ between resiliency to attacks and accuracy in the unattacked setting.