2016
Evasion and Hardening of Tree Ensemble Classifiers
ICML 2016poster
Classifier evasion consists in finding for a given instance x the “nearest” instance x’ such that the classifier predictions of x and x’ are different. We present two novel algorithms for systematically computing evasions for tree ensembles such as boosted trees and random forests. Our first algorit…