TTTS: Tree Test Time Simulation for Enhancing Decision Tree Robustness against Adversarial Examples

Seffi Cohen, Ofir Arbili, Yisroel Mirsky, Lior Rokach

Research output: Contribution to journalConference articlepeer-review

Abstract

Decision trees are widely used for addressing learning tasks involving tabular data. Yet, they are susceptible to adversarial attacks. In this paper, we present Tree Test Time Simulation (TTTS), a novel inference-time methodology that incorporates Monte Carlo simulations into decision trees to enhance their robustness. TTTS introduces a probabilistic modification to the decision path, without altering the underlying tree structure. Our comprehensive empirical analysis of 50 datasets yields promising results. Without the presence of any attacks, TTTS has successfully improved model performance from an AUC of 0.714 to 0.773. Under the challenging conditions of white-box attacks, TTTS demonstrated its robustness by boosting performance from an AUC of 0.337 to 0.680. Even when subjected to black-box attacks, TTTS maintains high accuracy and enhances the model's performance from an AUC of 0.628 to 0.719. Compared to defenses such as Feature Squeezing, TTTS proves to be much more effective. We also found that TTTS exhibits similar robustness in decision forest settings across different attacks.

Original languageEnglish
Pages (from-to)20993-21000
Number of pages8
JournalProceedings of the AAAI Conference on Artificial Intelligence
Volume38
Issue number19
DOIs
StatePublished - 25 Mar 2024
Event38th AAAI Conference on Artificial Intelligence, AAAI 2024 - Vancouver, Canada
Duration: 20 Feb 202427 Feb 2024

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'TTTS: Tree Test Time Simulation for Enhancing Decision Tree Robustness against Adversarial Examples'. Together they form a unique fingerprint.

Cite this