summaries: This paper proposed a new defense method for capsule networks. For both white-box and black-box settings, the proposed CapNets has shown superior performance than two variants of CNNs. The visualizations of adversarial examples generated by the CapNets are more aligned with the human perception which is very insightful. On the corrupted MNIST dataset, the results show the proposed defense method can also be used well as an out-of-distribution detector. Overall the paper is clearly written and easy to follow. This paper studies the problem of detecting and generating adversarial images using class-conditional capsule networks. Specifically, this paper first introduced a novel method that detects adversarial examples by class-conditional image reconstruction. Motivated by this defense method, this paper further proposed a novel reconstructive attack that minimizes both classification and reconstruction loss. Experimental evaluations are conducted on MNIST, FashionMNIST, SVHN, and CIFAR-10 dataset. Results demonstrate the effectiveness of the proposed defense and the novel reconstructive attack method.
abstractText: Adversarial examples raise questions about whether neural network models are sensitive to the same visual features as humans. In this paper, we first detect adversarial examples or otherwise corrupted images based on a class-conditional reconstruction of the input. To specifically attack our detection mechanism, we propose the Reconstructive Attack which seeks both to cause a misclassification and a low reconstruction error. This reconstructive attack produces undetected adversarial examples but with much smaller success rate. Among all these attacks, we find that CapsNets always perform better than convolutional networks. Then, we diagnose the adversarial examples for CapsNets and find that the success of the reconstructive attack is highly related to the visual similarity between the source and target class. Additionally, the resulting perturbations can cause the input image to appear visually more like the target class and hence become non-adversarial. This suggests that CapsNets use features that are more aligned with human perception and have the potential to address the central issue raised by adversarial examples.
authors.name: Yao Qin
authors.name: Nicholas Frosst
authors.name: Sara Sabour
authors.name: Garrison Cottrell
references.authors: Anish Athalye Nicholas Carlini David A. Wagner
references.title: Obfuscated gradients give a false sense of security: Circumventing defenses to adversarial examples
references.venue: In International Conference on Machine Learning,
references.authors: Battista Biggio Igino Corona Davide Maiorca Blaine Nelson Nedim Šrndić Pavel Laskov Giorgio Giacinto Fabio Roli
references.title: Evasion attacks against machine learning at test time
references.venue: In Joint European conference on machine learning and knowledge discovery in databases,
references.authors: Nicholas Carlini David Wagner
references.title: Adversarial examples are not easily detected: Bypassing ten detection methods
references.venue: In Proceedings of the 10th ACM Workshop on Artificial Intelligence and Security,
references.authors: Nicholas Carlini David Wagner
references.title: Towards evaluating the robustness of neural networks
references.venue: IEEE Symposium on Security and Privacy (SP),
references.authors: Jia Deng Wei Dong Richard Socher Li-Jia Li Kai Li Li Fei-Fei
references.title: ImageNet: A large-scale hierarchical image database
references.venue: In IEEE Conference on Computer Vision and Pattern Recognition,
references.authors: Reuben Feinman Ryan R. Curtin Saurabh Shintre Andrew B. Gardner
references.title: Detecting adversarial samples from artifacts
references.venue: arXiv preprint arXiv:1703.00410,
references.authors: Justin Gilmer Ryan P. Adams Ian Goodfellow David Andersen George E. Dahl
references.title: Motivating the rules of the game for adversarial example research
references.venue: arXiv preprint arXiv:1807.06732,
references.authors: Justin Gilmer Luke Metz Fartash Faghri Samuel S. Schoenholz Maithra Raghu Martin Wattenberg Ian Goodfellow
references.title: Adversarial spheres
references.venue: In International Conference on Learning Representations,
references.authors: Zhitao Gong Wenlu Wang Wei-Shinn Ku
references.title: Adversarial and clean data are not twins
references.venue: arXiv preprint arXiv:1704.04960,
references.authors: Ian Goodfellow Jonathon Shlens Christian Szegedy
references.title: Explaining and harnessing adversarial examples
references.venue: In International Conference on Learning Representations,
references.authors: Ian Goodfellow Yao Qin David Berthelot
references.title: Evaluation methodology for attacks against confidence thresholding models
references.authors: Kathrin Grosse Praveen Manoharan Nicolas Papernot Michael Backes Patrick McDaniel
references.title: On the (statistical) detection of adversarial examples
references.venue: arXiv preprint arXiv:1702.06280,
references.authors: Dan Hendrycks Kevin Gimpel
references.title: Early methods for detecting adversarial images
references.venue: In International Conference on Learning Representations,
references.authors: Geoffrey E. Hinton Sara Sabour Nicholas Frosst
references.title: Matrix capsules with em routing
references.venue: In International Conference on Learning Representations,
references.authors: Hossein Hosseini Sreeram Kannan Radha Poovendran
references.title: Are odds really odd? bypassing statistical detection of adversarial examples
references.venue: arXiv preprint arXiv:1907.12138,
references.authors: Saumya Jetley Nicholas A. Lord Philip H.S. Torr
references.title: With friends like these, who needs adversaries
references.venue: In Advances in Neural Information Processing Systems,
references.authors: Diederik P. Kingma Jimmy Ba
references.title: Adam: A method for stochastic optimization
references.venue: In International Conference on Learning Representations,
references.authors: Alex Krizhevsky
references.title: Learning multiple layers of features from tiny images
references.venue: Technical report, University of Toronto,
references.authors: Alexey Kurakin Ian Goodfellow Samy Bengio
references.title: Adversarial examples in the physical world
references.venue: In International Conference on Learning Representations,
references.authors: Alexey Kurakin Ian Goodfellow Samy Bengio Yinpeng Dong Fangzhou Liao Ming Liang Tianyu Pang Jun Zhu Xiaolin Hu Cihang Xie
references.title: Adversarial attacks and defences competition
references.venue: arXiv preprint arXiv:1804.00097,
references.authors: Yann LeCun Léon Bottou Yoshua Bengio Patrick Haffner
references.title: Gradient-based learning applied to document recognition
references.venue: Proceedings of the IEEE,
references.authors: Xin Li Fuxin Li
references.title: Adversarial examples detection in deep networks with convolutional filter statistics
references.venue: In Proceedings of the IEEE International Conference on Computer Vision,
references.authors: Aleksander Madry Aleksandar Makelov Ludwig Schmidt Dimitris Tsipras Adrian Vladu
references.title: Towards deep learning models resistant to adversarial attacks
references.venue: In International Conference on Learning Representations,
references.authors: Jan Hendrik Metzen Tim Genewein Volker Fischer Bastian Bischoff
references.title: On detecting adversarial perturbations
references.venue: In International Conference on Learning Representations,
references.authors: Felix Michels Tobias Uelwer Eric Upschulte Stefan Harmeling
references.title: On the vulnerability of capsule networks to adversarial attacks
references.authors: Norman Mu Justin Gilmer
references.title: Mnist-c: A robustness benchmark for computer vision
references.venue: In ICML 2019 Workshop on Uncertainty and Robustness in Deep Learning,
references.authors: Yuval Netzer Tao Wang Adam Coates Alessandro Bissacco Bo Wu Andrew Y. Ng
references.title: Reading digits in natural images with unsupervised feature learning
references.venue: In NIPS workshop on deep learning and unsupervised feature learning,
references.authors: Jathushan Rajasegaran Vinoj Jayasundara Sandaru Jayasekara Hirunima Jayasekara Suranga Seneviratne Ranga Rodrigo
references.title: Deepcaps: Going deeper with capsule networks
references.venue: In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition,
references.authors: Kevin Roth Yannic Kilcher Thomas Hofmann
references.title: The odds are odd: A statistical test for detecting adversarial examples
references.venue: In International Conference on Machine Learning,
references.authors: Sara Sabour Nicholas Frosst Geoffrey E. Hinton
references.title: Dynamic routing between capsules
references.venue: In Advances in Neural Information Processing Systems,
references.authors: Lukas Schott Jonas Rauber Wieland Brendel Matthias Bethge
references.title: Robust perception through analysis by synthesis
references.venue: arXiv preprint arXiv:1805.09190,
references.authors: Yang Song Taesup Kim Sebastian Nowozin Stefano Ermon Nate Kushman
references.title: Pixeldefend: Leveraging generative models to understand and defend against adversarial examples
references.venue: In International Conference on Learning Representations,
references.authors: Christian Szegedy Wojciech Zaremba Ilya Sutskever Joan Bruna Dumitru Erhan Ian Goodfellow Rob Fergus
references.title: Intriguing properties of neural networks
references.venue: In International Conference on Learning Representations,
references.authors: Lucas Theis Aäron van den Oord Matthias Bethge
references.title: A note on the evaluation of generative models
references.venue: In International Conference on Learning Representations,
references.authors: Han Xiao Kashif Rasul Roland Vollgraf
references.title: Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms
references.venue: arXiv preprint arXiv:1708.07747,
references.authors: Jianxiong Xiao James Hays Krista A Ehinger Aude Oliva Antonio Torralba
references.title: Sun database: Large-scale scene recognition from abbey to zoo
references.venue: In 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition,
references.authors: Richard Zhang Phillip Isola Alexei A Efros Eli Shechtman Oliver Wang
references.title: The unreasonable effectiveness of deep features as a perceptual metric
references.venue: In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition,
sections.heading: 1 INTRODUCTION
sections.text: Adversarial examples (Szegedy et al., 2013) are inputs that are designed by an adversary to cause a machine learning system to make a misclassification. A series of studies on adversarial attacks have shown that it is easy to cause misclassifications using visually imperceptible changes to an image under `p-norm based similarity metrics (Goodfellow et al., 2014; Kurakin et al., 2016; Madry et al., 2017; Carlini & Wagner, 2017b; Goodfellow et al., 2018). Since the discovery of adversarial examples, there has been a constant “arms race” between better attacks and better defenses. Many new defenses have been proposed (Song et al., 2017; Gong et al., 2017; Grosse et al., 2017; Metzen et al., 2017), only to be broken shortly thereafter (Carlini & Wagner, 2017a; Athalye et al., 2018). Hinton et al. (2018) showed that capsule models are more robust to simple adversarial attacks than CNNs but Michels et al. (2019) showed that this is not the case for all attacks.
  The cycle of attacks and defenses motivates us to rethink both how we can improve the general robustness of neural networks as well as the high-level motivation for this pursuit. One potential path forward is to detect adversarial inputs, instead of attempting to accurately classify them (Schott et al., 2018; Roth et al., 2019). Recent work (Jetley et al., 2018; Gilmer et al., 2018b) argue that adversarial examples can exist within the data distribution, which implies that detecting adversarial examples based on an estimate of the data distribution alone might be insufficient. Instead, in this paper we develop methods for detecting adversarial examples by making use of class-conditional reconstruction networks. These sub-networks, first proposed by Sabour et al. (2017) as part of a Capsule Network (CapsNet), allow a model to produce a reconstruction of its input based on the identity and instantiation parameters of the winning capsule. Interestingly, we find that reconstructing
  ∗Equal Contributions.
  an input from the capsule corresponding to the correct class results in a much lower reconstruction error than reconstructing the input from capsules corresponding to incorrect classes, as shown in Figure 1(a). Motivated by this, we propose using the reconstruction sub-network in a CapsNet as an attack-independent detection mechanism. Specifically, we reconstruct a given input from the pose parameters of the winning capsule and then detect adversarial examples by comparing the difference between the reconstruction distributions for natural and adversarial (or otherwise corrupted) images.
  We extend this detection mechanism to standard convolutional neural networks (CNNs) and show its effectiveness against black box and white box attacks on three image datasets; MNIST, FashionMNIST and SVHN. We show that capsule models achieve the strongest attack detection rates and accuracy on these attacks. We then test our method against a stronger attack, the Reconstructive Attack, specifically designed to attack our detection mechanism by generating adversarial examples with a small reconstruction error. With this attack we are able to create undetected adversarial examples, but we show that this attack is less successful in fooling the classifier than a non-reconstructive attack.
  Among all these attacks, we find CapsNets perform the best in detecting adversarial examples. To explain the success of CapsNets over CNNs, we further diagnose the adversarial examples for CapsNets and find that 1) the success of the targeted reconstructive attack is highly dependent on the visual similarity between the source image and the target class. 2) many of the resultant attacks resemble members of the target class and so cease to be “adversarial” – i.e., they may also be misclassified by humans. These findings suggest that CapsNets with class conditional reconstructions have the potential to address the real issue with adversarial examples – networks should make predictions based on the same properties of the image that people use rather than using features that can be manipulated by an imperceptible adversarial attack.
  In summary, our main contributions are:
  • We propose a class-conditional capsule reconstruction based detection method to detect standard white-box/black-box adversarial examples on three datasets. This detection mechanism is attack-agnostic and is successfully extended to standard convolutional neural networks. • We test our detection mechanism on the corrupted MNIST dataset and show that it can work
  as a general out-of-distribution detector. • A stronger reconstructive attack is specifically designed to attack our detection mechanism
  but becomes less successful in fooling the classifier. • We perform extensive qualitative studies to explain the superior performance of CapsNets
  in detecting adversarial examples compared to CNNs. The results suggest that the features captured by CapsNets are more aligned with human perception.
sections.heading: 2 RELATED WORK
sections.text: Adversarial examples were first introduced in (Biggio et al., 2013; Szegedy et al., 2013), where a given image was modified by following the gradient of a classifier’s output with respect to the
  image’s pixels. Goodfellow et al. (2014) then developed the more efficient Fast Gradient Sign method (FGSM), which can change the label of the input image X with a similarly imperceptible perturbation that is constructed by taking an step in the direction of the gradient. Later, the Basic Iterative Method (BIM) (Kurakin et al., 2016) and Projected Gradient Descent (Madry et al., 2017) can generate stronger attacks improved on FGSM by taking multiple steps in the direction of the gradient. In addition, Carlini & Wagner (2017b) proposed another iterative optimization-based method to construct strong adversarial examples with small perturbations.
  An early approach to reducing vulnerability to adversarial examples was proposed by (Goodfellow et al., 2014), where a network was trained on both clean images and adversarially perturbed ones. Since then, there has been a constant “arms race” between better attacks and better defenses; Kurakin et al. (2018) provide an overview of this field. However, many defenses against adversarial examples have been demonstrated to be an effect of “obfuscated gradients” and can be further circumvented under the white-box setting (Athalye et al., 2018).
  Another line of work attempts to circumvent adversarial examples by detecting them with a separatelytrained classifier (Gong et al., 2017; Grosse et al., 2017; Metzen et al., 2017) or using statistical properties (Hendrycks & Gimpel, 2016; Li & Li, 2017; Feinman et al., 2017; Grosse et al., 2017). However, many of these approaches were subsequently shown to be flawed (Carlini & Wagner, 2017a; Athalye et al., 2018). The most recent work in detecting adversarial examples (Roth et al., 2019) that has a 99% true positive rate on CIFAR-10 dataset (Krizhevsky, 2009) has also been fully bypassed by later work (Hosseini et al., 2019) which decreased the true positive rate to less than 2%.
  Similar to our work, Schott et al. (2018) also investigated the effectiveness of a class-conditional generative model as a defense mechanism for MNIST digits. However, we differ in some important ways. Their model is in some ways the opposite of ours - they first attempt to generate the input, and then make a classification on the resulting generated images, whereas our method attempts to first classify the input, making use of an otherwise unchanged capsule classification model, and then generates the input from a high level representation. As such, our method does not increase the computational overhead of classifying the input, compared to the approach of Schott et al. (2018). In addition, the work of Schott et al. (2018) is only applied to MNIST, so our results on the more complex datasets represent an improvement.
sections.heading: 3 PRELIMINARIES
sections.text: Adversarial Examples Given a clean test image x, its corresponding label y, and a classifier f(·) which predicts a class label given an input, we refer to x′ = x+ δ as an adversarial example if it is able to fool the classifier into making a wrong prediction f(x′) 6= f(x) = y. The small adversarial perturbation δ (where “small” is measured under some norm) causes the adversarial example x′ to appear visually similar to the clean image x but to be classified differently. In the unrestricted case where we only require that f(x′) 6= y, we refer to x′ as an “untargeted adversarial example”. A more powerful attack is to generate a “targeted adversarial example”: instead of simply fooling the classifier to make a wrong prediction, we force the classifier to predict some targeted label f(x′) = t 6= y. In this paper, the target label t is selected uniformly at random as any label which is not the ground-truth correct label. As is standard practice in the literature, in this paper we test our detection mechanism on three `∞ norm based attacks (fast gradient sign method (FGSM) (Goodfellow et al., 2014), the basic iterative method (BIM) (Kurakin et al., 2016), projected gradient descent (PGD) (Madry et al., 2017)) and one `2 norm based attack (Carlini-Wagner (CW) (Carlini & Wagner, 2017b)).
  Capsule Networks Capsule Networks (CapsNets) are an alternative architecture for neural networks (Sabour et al., 2017; Hinton et al., 2018). In this work we make use of the CapsNet architecture detailed by (Sabour et al., 2017). Unlike a standard neural network which is made up of layers of scalar-valued units, CapsNets are made up of layers of capsules, that output a vector or matrix. Intuitively, just as one can think of the activation of a unit in a normal neural network as the presence of a feature in the input, the activation of a capsule can be thought of as both the presence of a feature and the pose parameters that represent attributes of that feature. A top-level capsule in a classification network therefore outputs both a classification and pose parameters that represent the instance of that class in the input. This high level representation allows us to train a reconstruction network.
  Threat Model In this paper, we test our detection mechanism against both white-box and black-box attacks. For white-box attacks, the adversary has full access to the model as well as its parameters. In particular, the adversary is allowed to compute the gradient through the model to generate adversarial examples. To perform black-box attacks, the adversary is allowed to know the network architecture but not its parameters. Therefore, we retrain a substitute model that has the same architecture as the target model and generate adversarial examples by attacking the substitute model. Then we transfer these attacks to the target model. For `∞ based attacks, we always control the `∞ norm of the adversarial perturbation to be within a relatively small bound ∞, specific to each dataset.
sections.heading: 4 DETECTING ADVERSARIAL IMAGES BY RECONSTRUCTION
sections.text: To detect adversarial images, we make use of the reconstruction network proposed in (Sabour et al., 2017), which takes pose parameters v as input and outputs the reconstructed image r(v). The reconstruction network is simply a fully connected neural network with two ReLU hidden layers with 512 and 1024 units respectively, with a sigmoid output with the same dimensionality as the dataset. The reconstruction network is trained to minimize the `2 distance between the input image and the reconstructed image. This same network architecture is used for all the models and datasets we explore. The only difference is what is given to the reconstruction network as input.
sections.heading: 4.1 MODELS
sections.text: CapsNet The reconstruction network of the CapsNet is class-conditional: It takes in the pose parameters of all the class capsules and masks all values to 0 except for the pose parameters of the predicted class. We use this reconstruction network for detecting adversarial attacks by measuring the Euclidean distance between the input and a class conditional reconstruction. Specifically, for any given input x, the CapsNet outputs a prediction f(x) as well as the pose parameters v for all classes. The reconstruction network takes in the pose parameters and then selects the pose parameter corresponding to the predicted class, denoted as vf(x), to generate a reconstruction r(vf(x)). Then we compute the `2 reconstruction distance d(x) = ‖r(vf(x)), x‖2 between the reconstructed image and the input image, and compare it with a pre-defined detection threshold θ (described below in Section 4.2). If the reconstruction distance d(x) is higher than the detection threshold θ, we flag the input as an adversarial example. Figure 1 (b) shows an example of histograms of reconstruction distances for natural images and typical adversarial examples.
  CNN+CR Although our strategy is inspired by the reconstruction networks used in CapsNets, the strategy can be extended to standard convolutional neural networks (CNNs). We create a similar architecture, CNN with conditional reconstruction (CNN+CR), by dividing the penultimate hidden layer of a CNN into groups corresponding to each class. The sum of each neuron group serves as the logit for that particular class and the group itself serves the same purpose as the pose parameters in the CapsNet. We use the same masking mechanism as Sabour et al. (2017) to select the pose parameter corresponding to the predicted label vf(x) and generate the reconstruction based on the selected pose parameters. In this way we extend the class-conditional reconstruction network to standard CNNs.
  CNN+R We can also create a more naı̈ve implementation of our strategy by simply computing the reconstruction from the activations in the entire penultimate layer without any masking mechanism. We call this model the ”CNN+R” model. In this way we are able to study the effect of conditioning on the predicted class.
sections.heading: 4.2 DETECTION THRESHOLD
sections.text: We find the threshold θ for detecting adversarial inputs by measuring the reconstruction error between a validation input image and its reconstruction. If the distance between the input and the reconstruction is above the chosen threshold θ, we classify the data as adversarial. Choosing the detection threshold θ involves a trade-off between false positive and false negative detection rates. The optimal threshold depends on the probability of the system being attacked. Such a trade-off is discussed by Gilmer et al. (2018a). In our experiments we don’t tune this parameter and simply set it as the 95th percentile of validation distances. This means our false positive rate on real validation data is 5%.
sections.heading: 4.3 EVALUATION METRICS
sections.text: We use Success Rate to measure the success of attacks. For targeted attacks, the success rate St is defined as the proportion of inputs which are classified as the target class, St = 1N ∑N i (f(x ′ i) = ti), while the success rate for untargeted attacks is defined as the proportion of inputs which are misclassified, Su = 1N ∑N i (f(x ′ i) 6= yi). Previous work (Carlini & Wagner, 2017a; Hosseini et al., 2019) used the True Positive Rate to measure the proportion of adversarial examples that are detected, which alone is insufficient to measure the ability of different detection mechanism because the unsuccessful adversarial examples do not have to be detected. Therefore, in this paper, we propose to use the Undetected Rate: the proportion of attacks that are successful and undetected to evaluate the detection mechanism. For targeted attacks, the undetected rate is defined as Rt = 1N ∑N i (f(x ′ i) = ti) ∩ (d(x′i) ≤ θ), where d(·) computes the reconstruction distance of the input and θ denotes the detection threshold introduced in Section 4.2. Similarly, the undetected rate for untargeted attacks Ru can be defined as Ru = 1N ∑N i (f(x ′ i) 6= yi) ∩ (d(x′i) ≤ θ). The smaller the undetected rate Rt or Ru is, the stronger the model is in detecting adversarial examples. The undetected rate can also be used to evaluate the attacks (higher is better). We also plot the Undetected Rate vs. False Positive Rate curve to compare the detection performance between different models, where False Positive Rate is defined as the proportion of clean examples that are misclassified as the adversarial example by the detection method.
sections.heading: 4.4 TEST MODELS AND DATASETS
sections.text: In all experiments, all three models (CapsNet, CNN+R, and CNN+CR) have the same number of parameters and were trained with Adam (Kingma & Ba, 2014) for the same number of epochs. In general, all models achieved similar test accuracy. We did not do an exhaustive hyperparameter search on these models, instead we chose hyperparameters that allowed each model to perform roughly equivalently on the test sets. We run experiments on three datasets: MNIST (LeCun et al., 1998), FashionMNIST (Xiao et al., 2017), and SVHN (Netzer et al., 2011). The test error rate for each model on these three datasets, as well as details of the model architectures, can be seen in Section A and Section B in the Appendix.
sections.heading: 5 EXPERIMENTS
sections.text: We first demonstrate how reconstruction networks can detect standard white and black-box attacks in addition to naturally corrupted images. Then, we introduce the “reconstructive attack”, which is specifically designed to circumvent our defense and show that it is a more powerful attack in this setting. Based on this finding, we qualitatively study the kind of misclassifications caused by the reconstructive attack and argue that they suggest that CapsNets learn features that are better aligned with human perception.
sections.heading: 5.1 STANDARD ATTACKS
sections.text: White Box We present the success and undetected rates for several targeted and untargeted attacks on MNIST (Table 1), FashionMNIST, and SVHN (Table 5 presented in the Appendix). Our method
  is able to accurately detect many attacks with very low undetected rates. Capsule models almost always have the lowest undetected rates out of our three models. It is worth noting that this method performs best with the simplest dataset, MNIST, and that the highest undetected rates are found with the Carlini-Wagner attack on the SVHN dataset. This illustrates both the strength of this attack and a shortcoming of our defense, namely that our detection mechanism relies on `2 image distance as a proxy for visual similarity, and in the case of higher dimensional color datasets such as SVHN, this proxy is less meaningful.
  Black Box We also tested our detection mechanism results on black box attacks. Given the low undetected rates in the white-box settings, it is not surprising that our detection method is able to detect black box attacks as well. In fact, on the MNIST dataset the capsule model is able to detect all targeted and untargeted PGD attacks. Both the CNN-R and the CNN-CR models are able to detect the black box attacks as well, but with a relatively higher undetected rate. A table of these results can be seen in Table 7 in the Appendix.
sections.heading: 5.2 CORRUPTION ATTACKS
sections.text: Recent work has argued that improving the robustness of neural networks to `p norm bounded adversarial attacks should not come at the expense of increasing error rates under distributional shifts that do not affect human classification rates and are likely to be encountered in the “realworld” (Gilmer et al., 2018a). For example, if an image is corrupted due to adverse weather, lighting, or occlusion, we might hope that our model can continue to provide reliable predictions or detect the distributional shift. We can test our detection method on its ability to detect these distributional shifts by making use of the Corrupted MNIST dataset (Mu & Gilmer, 2019). This data set contains many visual transformations of MNIST that do not seem to affect human performance, but nevertheless are strongly misclassified by state-of-the-art MNIST models. Our three models can almost always detect these distributional shifts (in all corruptions CapsNets have either a small undetected rate or an undetected rate of 0). The error rate (the proportion of misclassified input) and undetected rate of three test models on the Corrupted MNIST dataset is shown in Table 2. Please refer to Figure 7 and Figure 8 in the Appendix for visualization of Corrupted MNIST.
sections.heading: 5.3 RECONSTRUCTIVE ATTACKS
sections.text: Thus far we have only evaluated previously-defined attacks. Following the suggestion in (Carlini & Wagner, 2017a) that detection methods need to show effectiveness towards defense-aware attacks, we introduce an attack specifically designed to take into account our defense mechanism. In order to construct adversarial examples that cannot be detected by the network, we propose a two-stage optimization method to generate a “reconstructive attack”.
  Untargeted Reconstructive Attacks To construct untargeted reconstructive attacks, we first update the perturbation based on the gradient of the cross-entropy loss function following a standard FGSM attack (Goodfellow et al., 2014), that is:
  δ ← clip (δ + c · β · sign(∇δ`net(f(x+ δ), y))), (1)
  where `net(f(·), y) is the cross-entropy loss function, is the `∞ bound for our attacks, c is a hyperparameter controlling the step size in each iteration and β is a hyperparameter which balances the importance of the cross-entropy loss and the reconstruction loss (explained further below). In the second stage, we focus on constraining the reconstructed image from the newly predicted label to have a small reconstruction distance by updating δ according to
  δ ← clip (δ − c · (1− β) · sign(∇δ(‖r(vf(x+δ))− (x+ δ)‖2))), (2)
  where r(vf(x+δ)) is the class-conditional reconstruction based on the predicted label f(x+ δ) in a CapsNet or CNN+CR network. The δ used here is the optimized δ from the first stage. ‖r(vf(x+δ))− (x + δ)‖2 is the `2 reconstruction distance between the reconstructed image and the input image. Since the CNN+R network does not use the class conditional reconstruction, we simply use the reconstructed image without the masking mechanism. According to Eqn 1 and Eqn 2, we can see that β balances the importance between the success rate of attacks and the reconstruction distance. This hyperparameter was tuned for each model and each dataset in order to create the strongest attacks. The success rate and undetected rate change as this parameter, which is shown in Figure 9 in Appendix.
  Targeted Reconstructive Attacks We perform a similar two-stage optimization to construct targeted reconstructive attacks, by defining a target label and attempting to maximize the classification probability of this label, and minimize the reconstruction error from corresponding capsule. Because the targeted label is given, another way to construct targeted reconstructive attacks is to combine these two stages into one stage via minimizing the loss function ` = β · `net(f(x+δ), y)+(1−β) · ‖r(vf(x+δ))− (x+δ)‖2. We implemented both of these targeted reconstructive attacks and found that the two-stage version is a stronger attack. Therefore, all the Reconstructive Attack experiments performed in this paper are based on two-stage optimization.
  We build our reconstructive attack based on the standard PGD attack, denoted as R-PGD, and test the performance of our detection models against this reconstructive attack in a white-box setting (white-box Reconstructive FGSM and BIM are reported in Table 6 in the Appendix). Comparing Table 1 and Table 3, we can see that the Reconstructive Attack is significantly less successful at changing the models prediction (lower success rates than the standard attack). However, this attack is more successful at fooling our detection method. For all attacks and datasets the capsule model has the lowest attack success rate and the lowest undetected rate. We report results for black-box R-PGD attacks in Table 7 in the Appendix, which suggest similar conclusions.
  In addition, we report the undetected rate of the white-box targeted defense-aware R-PGD attack versus the False Positive Rate on the MNIST, Fashion-MNIST and SVHN datasets in Figure 2. We can clearly see that the undetected rate of the defense-aware attack against CapsNet is significantly smaller than the CNN-based networks, which suggests that CapsNets are more robust against adversarial attacks. Furthermore, CNN with class-conditional reconstruction (CNN+CR) has smaller undetected rate at the same False Positive Rate compared to the CNN without class-conditional reconstruction (CNN+R), which suggests the class-conditional information is helpful in our models to improve the robustness against adversarial attacks.
sections.heading: 5.4 CIFAR-10 DATASET
sections.text: In order to show that our method based on CapsNet is capable to scale up to more complex datasets, we test our detection method with a deeper reconstruction network on CIFAR-10 (Krizhevsky, 2009). The classification accuracy on the clean test dataset is 92.2%. In addition, we display the undetected rate of the white-box/black-box defense-aware R-PGD attack against CapsNets versus the False Positive Rate in Figure 3 (Left), where we can see a significant drop of the undetected rate of black-box R-PGD compared to the white-box setting. This indicates the CapsNets greatly reduce the attack transferability and the threat of black-box attacks.
  Class-conditional Information To investigate the effectiveness of the class-conditional information in the reconstruction network, we compare our CapsNet based on (Sabour et al., 2017) with the other two variants of CapsNets: “CapsNet All” and “DeepCaps” (Rajasegaran et al., 2019). In “CapsNet All”, we remove the masking mechanism in the CapsNet and use all the capsules to do the reconstruction. In “DeepCaps”, we extract the winning-capsule information as a single vector and used it as the input for the reconstruction network instead of using a masking mechanism to mask out the losing capsules information. In this way, the class information in DeepCaps is more explicitly fed into the reconstruction network. As shown in Figure 3 (right), our CapsNet has the best detection performance (the lowest undetected rate at the same False Positive Rate) compared to the other two
  Capsule models. “DeepCaps” performs slightly worse than our “CapsNet” and “CapsNet All” has the worst detection performance. Therefore, we conclude that the class-conditional information used in the reconstruction network increases the model’s robustness to adversarial attack. This also holds true to CNN-based networks because CNN+CR has a better detection performance than CNN+R, shown in Figure 2.
sections.heading: 6 VISUAL COHERENCE OF THE RECONSTRUCTIVE ATTACK
sections.text: The great success of CapsNet over CNN-based models motivates us to further diagnose the generated adversarial examples for CapsNets. If our true aim in adversarial robustness research is to create models that make predictions based on reasonable and human-observable features, then we would prefer models that are more likely to misclassify a “shirt” as a “t-shirt” (in the case of FashionMNIST) than to misclassify a “bag” as a “sweater”. For a model to behave ideally, the success of an adversarial perturbation would be related to the visual similarity between the source and the target class. By visualizing a matrix of adversarial success rates between each pair of classes (shown in Figure 4), we can see that for the capsule model there is a great variance between the source and target class pairs and that the success rate of attacks is highly related to the visual similarity of the classes. However, this is not the case for either of the other two CNN-based models.
  Thus far we have treated all attacks as equal. However, a key component of an adversarial example is that it is visually similar to the source image, and that it does not resemble the adversarial target class. The adversarial research community makes use of a small epsilon bound as a mechanism for ensuring that the resultant adversarial attacks are visually unchanged from the source image. For standard attacks against CNN-based models this heuristic is sufficient, because taking gradient steps in the image space in order to have a network misclassify an image normally results in something
  visually similar to the source image. But this is not the case for adversarial attacks against CapsNets. As shown in Figure 5, when we use R-PGD to attack the CapsNet, many of the resultant attacks resemble members of the target class. In this way, they stop being “adversarial”. As such, an attack detection method which does not detect them as adversarial is arguably behaving correctly. This puts the previously undetected rates presented earlier in a new light, and illustrates a difficulty in the evaluation of adversarial attacks and defenses. In addition, it should be noted that this phenomenon rarely occurs in a standard convolutional neural network, which suggests that the features captured by CapsNet are more aligned with human perception.
sections.heading: 7 DISCUSSION
sections.text: Our detection mechanism relies on a similarity metric (i.e. a measure of reconstruction error) between the reconstruction and the input. This metric is required both during training in order to train the reconstruction network and during test time in order to flag adversarial examples. In the four datasets we have evaluated, the distance between examples roughly correlates with semantic similarity. However, this may not be the case for images in more complex datasets such as the SUN dataset (Xiao et al., 2010) and ImageNet (Deng et al., 2009), in which two images may be similar in terms of semantic content but nevertheless have significant `2 distance. A better similarity metric (Theis et al., 2015; Zhang et al., 2018) can be further explored to extend our methods to more complex problems. Furthermore our reconstruction network is trained on a hidden representation of one class but is trained to reconstruct the entire input. In datasets without distractors or backgrounds, this is not a problem. But in the case of ImageNet, in which the object responsible for the classification is not the only object in the image, attempting to reconstruct the entire input from a class encoding seems misguided.
sections.heading: 8 CONCLUSION
sections.text: We have presented a class-conditional reconstruction-based detection method that does not rely on a specific predefined adversarial attack. We have shown that by reconstructing the input from the internal class-conditional representation, our system is able to accurately detect black-box and white-box FGSM, BIM, PGD, and CW attacks. We then proposed a new attack to beat our defense - the Reconstructive Attack - in which the adversary optimizes not only the classification loss but also minimizes the reconstruction loss. We showed that this attack was able to fool our detection mechanism but with a much smaller success rate than a standard attack.
  Compared to CNN-based models, we showed that the CapsNet was able to detect adversarial examples with greater accuracy on all the datasets we explored. To further explain the success of CapsNet, we qualitatively showed that the success of the reconstructive attack was highly related to the visual similarity between the target class and the source class for the CapsNet. In addition, we showed that images generated by this reconstructive attack to attack the CapsNet are not typically adversarial, i.e. many of the resultant attacks resemble members of the target class even with a small `∞ norm bound. These are not the case for the CNN-based models. The extensive qualitative studies indicate that the capsule model relies on visual features similar to those used by humans. We believe this is a step towards solving the true problem posed by adversarial examples.
sections.heading: A NETWORK ARCHITECTURES
sections.text: Figure 6 shows the architecute of the capsule network, the CNN reconstruction model and the CNN conditional reconstruction model used for experiments on MNIST, FashionMNIST and SVHN dataset. MNIST and Fashion MNIST have exactly the same architectures while we use larger models for SVHN. Note that the only difference between the CNN reconstruction (CNN+R) and the CNN conditional reconstruction (CNN+CR) is the masking procedure on the input to the reconstruction network based on the predicted class. All three models have the same number of parameters.
sections.heading: B TEST MODELS
sections.text: The error rate of each test model used in the paper are presented in Table 4. We ensure that they have similar performance.
  C IMPLEMENTATION DETAILS
  For all the `∞ based adversarial examples, the `∞ norm of the perturbations is bound by , which is set to 0.3, 0.1, 0.1 for MNIST, Fashion MNIST and SVHN dataset respectively following previous work (Madry et al., 2017; Song et al., 2017). In FGSM based attacks, the step size c is 0.05. In BIM-based (Kurakin et al., 2016) and PGD-based (Madry et al., 2017) attacks, the step size c is 0.01 for all the datasets and the number of iterations are 1000, 500 and 200 for MNIST, Fashion MNIST and SVHN dataset respectively. We choose a sufficiently large number of iterations to ensure the attacks has converged.
  We use the publicly released code from the authors of (Carlini & Wagner, 2017b) to perform the CW attack for our models. The number of iterations are set to 1000 for all three datasets.
sections.heading: D WHITE BOX STANDARD ATTACKS
sections.text: The results of four white box standard attacks on the three datasets are shown in Table 5.
  E VISUALIZATION OF CORRUPTED MNIST DATASET
  Visualization of examples from Corrupted MNIST dataset (Mu & Gilmer, 2019) and the corresponding reconstructed images for each model are shown in Figure 7 and Figure 8.
sections.heading: F RECONSTRUCTIVE ATTACKS
sections.text: The results of Reconstructive FGSM, BIM and PGD on the three datasets are reported in Table 6.
  F.1 HYPERPARAMETER β
  Figure 9 shows the plot of success rate and undetected rate versus the hyperparameter β which balances the importance between attacking the classifier and fooling the detection mechanism in the targeted reconstructive PGD attacks on the MNIST dataset.
sections.heading: G BLACK BOX ATTACKS
sections.text: H VISUALIZATION OF ADVERSARIAL EXAMPLES AND RECONSTRUCTIONS
title: CLASS-CONDITIONAL CAPSULE RECONSTRUCTIONS