Defending Against Adversarial Attacks Using Random Forest

Citations Over TimeTop 22% of 2019 papers

Abstract

As deep neural networks (DNNs) have become increasingly important and popular, the robustness of DNNs is the key to the safety of both the Internet and physical world. Unfortunately, some recent studies show that adversarial examples, which are hard to be distinguished from real examples, can easily fool DNNs and manipulate their predictions. Upon observing that adversarial examples are mostly generated by gradient-based methods, in this paper, we first propose to use a simple yet very effective non-differentiable hybrid model that combines DNNs and random forests, rather than hide gradients from attackers, to defend against the attacks. Our experiments show that our model can successfully and completely defend the white-box attacks, has a lower transferability, and is quite resistant to three representative types of black-box attacks; while at the same time, our model achieves similar classification accuracy as the original DNNs. Finally, we investigate and suggest a criterion to define where to grow random forests in DNNs.

Related Papers

• → A Unified Approach to Interpreting and Boosting Adversarial\n Transferability(2020)34 cited
• → A Unified Approach to Interpreting and Boosting Adversarial Transferability(2020)15 cited
• → Proving Common Mechanisms Shared by Twelve Methods of Boosting Adversarial Transferability(2022)2 cited
• → Attack-Centric Approach for Evaluating Transferability of Adversarial Samples in Machine Learning Models(2021)1 cited