NeurIPS 2019
Sun Dec 8th through Sat the 14th, 2019 at Vancouver Convention Center
Paper ID:6665
Title:Robustness Verification of Tree-based Models

This paper studies the problem of robustness verification for an ensemble of K trees. The authors reduce this problem to maximum clique on a k-partite graph which is interesting. They also show that the proposed algorithm is faster compared to a generic integer programming approach (which was proposed previously for robustness).