Stochastic Combinatorial Ensembles for Defending Against Adversarial Examples

Abstract

Many deep learning algorithms can be easily fooled with simple adversarial examples. To address the limitations of existing defenses, we devised a probabilistic framework that can generate an exponentially large ensemble of models from a single model with just a linear cost. This framework takes advantage of neural network depth and stochastically decides whether or not to insert noise removal operators such as VAEs between layers. We show empirically the important role that model gradients have when it comes to determining transferability of adversarial examples, and take advantage of this result to demonstrate that it is possible to train models with limited adversarial attack transferability. Additionally, we propose a detection method based on metric learning in order to detect adversarial examples that have no hope of being cleaned of maliciously engineered noise.

References in corpus (10)

• Sequence to Sequence Learning with Neural Networks
• Explaining and Harnessing Adversarial Examples
• Intriguing properties of neural networks
• Transferability in Machine Learning: from Phenomena to Black-Box Attacks using Adversarial Samples
• Delving into Transferable Adversarial Examples and Black-box Attacks
• The Space of Transferable Adversarial Examples
• Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methods
• Adversarial Perturbations Against Deep Neural Networks for Malware Classification
• MagNet: a Two-Pronged Defense against Adversarial Examples
• A Boundary Tilting Persepective on the Phenomenon of Adversarial Examples