Robust decision trees against adversarial examples
Name
1902.10660.pdf
Description
Accepted version
Size
1.34 MB
Format
Unknown
Checksum (MD5)
bb1f3169cefdd5215247a74c5fec71ba
Author(s)
Chen, Hongge
Xhange, Huan
Boning, Duane S
Hsieh, Cho-Jui
Date Issued
2019
Journal
36th International Conference on Machine Learning, ICML 2019
Version
Author's final manuscript
Abstract
© 2019 by the Author(S). Although adversarial examples and model robustness have been extensively studied in the context of linear models and neural networks, research on this issue in tree-based models and how to make tree-bascd models robust against adversarial examples is still limited. In this paper, we show that tree based models are also vulnerable to adversarial examples and develop a novel algorithm to learn robust trees. At its core, our method aims to optimize the performance under the worst-case perturbation of input features, which leads to a max-min saddle point problem. Incorporating this saddle point objective into the decision tree building procedure is non-trivial due to the discrete nature of trees - a naive approach to finding the best split according to this saddle point objective will take exponential time. To make our approach practical and scalable, we propose efficient tree building algorithms by approximating the inner minimizer in this saddle point problem, and present efficient implementations for classical information gain based trees as well as state-of-the-art tree boosting models such as XG-Boost. Experimental results on real world datasets demonstrate that the proposed algorithms can substantially improve the robustness of tree-based models against adversarial examples.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
http://proceedings.mlr.press/v97/
