L EARNING TO G ENERATE N OISE FOR M ULTI -A TTACK R OBUSTNESS
Anonymous authors
Paper under double-blind review
A BSTRACT
Adversarial learning has emerged as one of the successful techniques to circumvent the susceptibility of existing methods against adversarial perturbations.
However, the majority of existing defense methods are tailored to defend against a single category of adversarial perturbation (e.g. (cid:96) ∞ -attack).
In safety-critical applications, this makes these methods extraneous as the attacker can adopt diverse adversaries to deceive the system.
Moreover, training on multiple perturbations simultaneously signiﬁcantly increases the computational overhead during training.
To address these challenges, we propose a novel meta-learning framework that explicitly learns to generate noise to improve the model’s robustness against multiple types of attacks.
Its key component is Meta Noise Generator (MNG) that outputs optimal noise to stochastically perturb a given sample, such that it helps lower the error on diverse adversarial perturbations.
By utilizing samples generated by MNG, we train a model by enforcing the label consistency across multiple perturbations.
We validate the robustness of models trained by our scheme on various datasets and against a wide variety of perturbations, demonstrating that it signiﬁcantly outperforms the baselines across multiple perturbations with a marginal computational cost.
I NTRODUCTION
Deep neural networks have demonstrated enormous success on multiple benchmark applications (Amodei et al., 2016; Devlin et al., 2018), by achieving super-human performance on certain tasks.
However, to deploy them to safety-critical applications (Shen et al., 2017; Chen et al., 2015;
Mao et al., 2019), we need to ensure that the model is robust as well as accurate , since incorrect predictions may lead to severe consequences.
Notably, it is well-known that the existing neural networks are highly susceptible to carefully crafted image perturbations which are imperceptible to humans but derail the predictions of these otherwise accurate networks.
The emergence of adversarial examples has received signiﬁcant attention in the research community, and several defense mechanisms have been proposed (Madry et al., 2017;
Zhang et al., 2019; Carmon et al., 2019).
However, despite a large literature to improve upon the robustness of neural networks, most of the existing defenses leverage the knowledge of the adversaries and are based on the assumption of only a single type of perturbation.
Consequently, many of the proposed defenses were circumvented by stronger attacks (Athalye et al., 2018; Uesato et al., 2018; Tramer et al., 2020).
Meanwhile, several recent works have (Schott et al., 2018; Tramèr & Boneh, 2019) demonstrated the vulnerability of existing defense methods against multiple perturbations.
For the desired multi-attack robustness, Tramèr & Boneh (2019); Maini et al.
(2020) proposed various strategies to aggregate multiple perturbations during training.
However, training with multiple perturbations comes at an additional cost; it increases the training cost by a factor of four over adversarial training, which is already an order of magnitude more costly than standard training.
This slowdown factor hinders the research progress of robustness against multiple perturbations due to the large computation overhead incurred during training.
Some recent works reduce this cost by reducing the complexity of generating adversarial examples (Shafahi et al., 2019; Wong et al., 2020), however, they are limited to (cid:96) ∞ adversarial training.
To address the drawbacks of existing methods, we propose a novel training scheme, Meta Noise
Generator with Adversarial Consistency (MNG-AC) , which learns instance-dependent noise to
[Figure]
D og C a t B e a r
D og
C a t
D og D og
C a t
D og
D og C a t B e a r D og C a t B e a r
[Figure]
minimize the adversarial loss across multiple perturbations while enforcing label consistency between them, as illustrated in Figure 1 and explained in details below.
First, we tackle the heavy computational overhead incurred by multi-perturbation training by proposing Stochastic Adversarial Training (SAT) , that samples from a distribution of perturbations during training, which signiﬁcantly accelerates training for multiple perturbations 1 .
Then, based on the assumption that the model should output the same predictions for different perturbations of the same image, we introduce Adversarial Consistency (AC) loss that enforces label consistency across multiple perturbations.
Finally, motivated by the noise regularization techniques (Huang et al., 2016;
Srivastava et al., 2014; Noh et al., 2017; Lee et al., 2020) which target generalization, we formulate a
Meta Noise Generator (MNG) that learns to stochastically perturb a given sample in a meta-learning framework to explicitly improve the generalization and label consistency across multiple attacks.
In particular, MNG-AC utilizes our generated samples to enforce label consistency across the generated samples from our model, adversarial samples, and clean samples.
Consequently, it pushes the decision boundary (see Figure 4) and enforces a smooth and robust network across multiple perturbations.
We validate the efﬁcacy and efﬁciency of our proposed method by comparing it against existing, state-of-the-art methods on CIFAR-10, SVHN, and Tiny-ImageNet dataset.
The experimental results show that our method obtains signiﬁcantly superior performance over all the baseline methods trained with multiple perturbations, generalizes to diverse perturbations, and substantially reduces the computational cost incurred by training with multiple perturbations.
In summary, the major contributions of this paper are as follows:
• We introduce Adversarial Consistency (AC) loss that enforces label consistency across multiple perturbations to enforce smooth and robust networks.
• We formulate Meta-Noise Generator that explicitly meta-learns an input-dependent noise generator, such that it outputs stochastic noise distribution to improve the model’s robustness and adversarial consistency across multiple types of adversarial perturbations.
• We validate our proposed method on various datasets against diverse benchmark adversarial attacks, on which it achieves state-of-the-art performance, highlighting its practical impact.
R ELATED WORK
Robustness against single adversarial perturbation.
In the past few years, multiple defenses have been proposed to defend against a single type of attack (Madry et al., 2017; Xiao et al., 2020;
Zhang et al., 2019; Carmon et al., 2019) and have been consequently circumvented by subsequent attacks (Athalye et al., 2018; Brendel et al., 2018; Tramer et al., 2020).
Adversarial-training based defenses (Madry et al., 2017; Zhang et al., 2019; Carmon et al., 2019) have been the only exceptions that have withstood the intense scrutiny and have provided empirical gains in adversarial robustness.
Generative models for adversarial robustness.
There have been various attempts that leverage the representative power of generative models to improve model robustness.
Samangouei et al.
; Jalal et al.
(2017) project an image onto the generator manifold, which is then classiﬁed by the discriminator.
Song et al.
(2018) uses the sensitivity of generative models to defend against a single perturbation.
Yin et al.
(2020) proposed a detection method based on input space partitioning.
However, Samangouei et al.
; Jalal et al.
; Song et al.
(2018) were shown to be ineffective by stronger attacks (Carlini & Wagner, 2017; Athalye et al., 2018).
In contrast to learning the generative model to model the adversarial examples, we meta-learn the generator to explicitly learn an input-dependent optimal noise distribution to lower adversarial error across multiple perturbations, that does not necessarily correspond to any of the attack perturbations.
Robustness against multiple adversarial perturbations.
Schott et al.
(2018) demonstrated that (cid:96) ∞ adversarial training is highly susceptible to (cid:96) 0 /(cid:96)
2 -norm adversarial perturbations and used
multiple
VAEs to defend against multiple perturbations on the MNIST dataset.
However, it was not scalable and limited to the MNIST dataset.
Tramèr & Boneh (2019) investigated the theoretical/empirical trade-offs between multiple perturbations and introduced adversarial training with worst/average perturbations to defend against multiple perturbations.
Maini et al.
(2020) incorporated multiple perturbations into a single adversary to maximize the adversarial loss.
However, computing all the perturbations is impractical for multiple perturbations and large scale datasets.
On the other hand, our proposed framework overcomes this limitation, with improved performance over these methods and has a negligible increase in training cost over multi-perturbation adversarial training.
R OBUSTNESS AGAINST MULTIPLE PERTURBATIONS
We ﬁrst brieﬂy review single/multi-perturbation adversarial training and introduce Stochastic Adversarial Training (SAT) to reduce the computational cost incurred by training with multiple perturbations.
We consider a dataset D over observations x ∈ R d and labels y ∈ R C with C classes.
Let f θ : R d → R C be a L -layered classiﬁer with parameters θ and classiﬁcation loss L cls .
Given an attack procedure A ( x ) with norm-ball B A ( x, ε ) around x with radius ε for each example, which introduces a perturbation δ , we let x adv = x + δ denote the corresponding adversarial examples.
We consider the (cid:96) p norm distance under the additive threat model (Laidlaw & Feizi, 2019) and adopt the projected-gradient descent (PGD) (Madry et al., 2017) for crafting the (cid:96) p perturbations:
[Equation]
where x adv0 is chosen at random within B A ( x, ε ) , α A is the step size, proj is the projection operator projecting the input onto the norm ball B A ( x, ε ) , and x adv( t +1) denotes the adversarial example at the t -th PGD step.
We will refer the approximation of the maximum loss by an attack procedure
A ( x ) , such that
[Equation] )) , y ) for the rest of our paper.
Single-perturbation adversarial training.
In the standard single-perturbation adversarial training (Kurakin et al., 2016; Madry et al., 2017), the model optimizes the network using a min-max formulation.
More formally, the inner maximization generates the adversarial perturbation by maximizing the loss, while the outer minimization minimizes the loss on the generated examples.
[Equation]
The majority of existing single-perturbation defenses are primarily able to defend against a single category of adversarial perturbation.
However, this limits the generalization of these methods to perturbations that are unseen during training (Schott et al., 2018; Tramèr & Boneh, 2019), which has been referred to as overﬁtting on the particular type of training perturbation.
Multi-perturbation adversarial training.
Tramèr & Boneh (2019) extended the adversarial training to multiple perturbations by optimizing the outer objective in Eq.
(2) on the strongest/union of adversarial perturbations for each input example.
Their proposed strategies can more formally be deﬁned as follows:
The maximum over all perturbations : It optimizes the outer objective in Eq.
(2) on the strongest adversarial perturbation from the whole set of additive adversarial perturbations
[Equation]
The average over all perturbations: It optimizes the outer objective in Eq.
(2) on the whole set of n additive perturbations.
[Equation]
Recently, Maini et al.
(2020) proposed “Multi Steepest Descent” (MSD) by incorporating the different perturbations into the direction of steepest descent.
However, the practicality of all these methods is limited due to an increased computational overhead for training.
Stochastic Adversarial Training (SAT).
To overcome this limitation, we propose Stochastic Adversarial Training to defend against multiple adversarial perturbations.
Speciﬁcally, we conjecture that it is essential to cover the threat model during training, not utilizing all the perturbations simultaneously.
We formulate the threat model as a random attack A ( x ) sampled uniformly from a perturbation set
S during each episode (or batch) of training which prevents overﬁtting on a particular adversarial perturbation.
In this work, we consider the (cid:96)
p -bounded perturbation set, and we sample the attack procedure A ( x ) with its corresponding norm-ball B A ( x, ε ) from the perturbation set S as follows:
[Equation]
where Cat is the categorical distribution and n is the number of attacks in the perturbation set S .
Our proposed SAT optimizes the outer objective in Eq.
(2) using the sampled attack procedure A ( x ) and is a drastic simpliﬁcation of the average one in Eq.
(4), which makes it highly efﬁcient for multiple perturbations.
It is important to note that unlike the average and max strategy SAT can be applied to any perturbation set with a constant cost and it promotes generalization and convergence (due to its stochasticity) by preventing over-ﬁtting on a single type of perturbation.
L EARNING TO GENERATE NOISE FOR MULTI - ATTACK ROBUSTNESS
In this section, we introduce our framework MNG-AC, which leverages an adversarial consistency loss (AC) and a meta-noise generator (MNG) to help the model generalize to multiple perturbations.
Let g φ : R d → R d denote the generator with parameters φ and x adv θ be the adversarial examples generated by SAT for a uniformly sampled attack A ( x ) from a perturbation set S with norm-ball
B A ( x, ε ) .
We sample z ∼ N (0 , I ) for input to our generator jointly with the clean examples x to generate the noise-augmented samples x aug φ projected on the norm-ball B A ( x, ε ) .
Note that, as MNG learns the noise to minimize the adversarial loss, it is essential to project the generated noise on the norm-ball B A ( x, ε ) , which is the corresponding norm-ball of the sampled attack procedure A ( x ) .
The total loss function L total for the classiﬁer consists exclusively of two terms: SAT classiﬁcation loss and an adversarial consistency loss:
[Equation]
where B is the batch-size, β is the hyper-parameter determining the strength of the AC loss denoted by
L ac and p clean , p adv , p aug represent the posterior distributions p ( y | x clean ) , p ( y | x adv θ ) , p ( y | x aug φ ) computed using the softmax function on the logits for x clean , x adv , and x aug respectively.
Speciﬁcally,
L ac represents the Jensen-Shannon Divergence (JSD) among the posterior distributions:
[Equation]
where M = (cid:0) p clean + p adv + p aug (cid:1) / 3 .
Consequently, L ac enforces stability and insensitivity across a diverse range of inputs based on the assumption that the classiﬁer should output similar predictions when fed perturbed versions of the same image.
input Dataset D
T inner steps, batch size perturbation set S .
output Final θ 1: for n = { 1 , . .
, N } do 2:
Sample mini-batch of size B .
Sample an attack procedure A ( x ) with its corresponding norm-ball B A ( x, ε ) using Eq.
Generate the adversarial examples for A ( x ) using Eq.
Sample z ∼ N (0 , I ) and generate x aug φ = proj B A ( x,ε ) ( x + g φ ( z, x )) using MNG, where B A ( x, ε ) is the norm-ball corresponding to the attack procedure sampled in Step 3.
Update θ to minimize Eq.
Initialize θ
=
θ 8: for t = {
. , T } do 9:
Update θ ( t ) using Eq.
10: end for 11:
Descent a single step to update θ ( T ) to θ ( T
1) by Eq.
Update the parameters φ of the generator by Eq.
13: end for
Recently, Rusak et al.
(2020) formulated an adversarial noise generator to learn the adversarial noise to improve the robustness on common corruptions.
However, our goal is different; the robustness against multiple adversarial attacks is a much more challenging task than that against common corruptions.
To generate the augmented samples for our purpose, we explicitly perturb the input examples for generalization across multiple perturbations.
In particular, MNG meta-learns (Thrun &
Pratt, 1998;
Finn et al., 2017)
the parameters φ of a noise generator g φ to generate an input-dependent noise distribution to alleviate the issue of generalization across multiple adversaries.
The standard approach to train our adversarial classiﬁer jointly with MNG is to use bi-level optimization (Finn et al., 2017).
However, bi-level optimization for adversarial training would be computationally expensive.
To tackle this challenge, we adopt an online approximation (Ren et al., 2018;
Jang et al., 2019) to update θ and φ using a single-optimization loop.
We alternatively update the parameters θ of the classiﬁer with the parameters φ of MNG.
In particular, we ﬁrst update the parameters θ using Eq.
(6) (step 3 in Algorithm 1).
Then, given current parameters θ of our adversarial classiﬁer, we update
MNG parameters φ using the following training scheme:
Update model parameters for T steps.
First, we update θ to minimize L cls ( θ | x aug φ , y ) for T steps which ensures the learning of the classiﬁer using the knowledge from the generated samples constructed by MNG.
It explicitly increases the inﬂuence of the noise-augmented samples on the classiﬁer in the inner loop.
More speciﬁcally, for a learning rate α , projection operator proj , θ ( t ) moves along the following descent direction on a mini-batch of training data:
[Equation]
where ,
[Equation]
Adapt model parameters on a single step.
Second, perform one-step update to update θ ( T ) to θ ( T +1) to minimize SAT loss from Eq.
This step explicitly models the adaptation of adversarial model parameters in the presence of the noise-augmented data using a single step of update:
[Equation]
Update generator parameters.
In the last step, after receiving feedback from the classiﬁer
, we measure the SAT loss from Eq.
(6) and adapt φ to minimize this loss.
In particular, φ performs the following update step to facilitate the classiﬁer parameters θ in the next step:
[Equation]
Overall, the generator minimizes the loss on the adversarial examples sampled from the perturbation set S .
Consequently, φ in Eq.
(10) is dependent on θ ( T +1) that depends on θ ( T ) (see Eq.
(9)), which in turn depends on x aug φ (see Eq.
(8)) and acts as a path for the ﬂow of gradients.
Similarly, the gradients for θ ( T +1) are chained through the T steps since θ ( T +1) is dependent on θ ( T ) that depends on θ (0) , and we use TorchMeta Deleu et al.
for the double backpropagation.
We list the detailed algorithm in Algorithm 1.
Formally, the overall objective can be summarized as:
[Equation]
subject to
[Equation]
To summarize, MNG-AC consists of perturbation sampling to generate adversarial examples.
Then, it perturbs the clean examples in a meta-learning framework to explicitly lower the adversarial classiﬁcation loss on the sampled perturbation.
Lastly, the adversarial classiﬁer utilizes the generated samples, adversarial samples and clean samples to optimize the classiﬁcation and adversarial consistency loss.
Intuition behind our framework.
Unlike existing adversarial defenses that aim for robustness against single perturbation, our proposed approach targets for a realistic scenario of robustness against multiple perturbations.
Our motivation is that meta-learning the noise distribution to minimize the stochastic adversarial classiﬁcation loss allows to learn the optimal noise to improve multiperturbation generalization.
Based on the assumption that the model should output similar predictions for perturbed versions of the same image, we enforce the adversarial consistency loss, which enforces the label consistency across multiple perturbations.
We empirically illustrate that our proposed training scheme increases the smoothness of the model (see Figure 3) and pushes the decision boundary (see Figure 4), which conﬁrms our hypothesis for multi-perturbation generalization.
E XPERIMENTS 5. E XPERIMENTAL SETUP
Baselines and our model.
We compare our method MNG-AC with the standard network (Nat) and state-of-the-art single-perturbation baselines including Madry et al.
(Adv p ) for (cid:96) ∞ , (cid:96) 1 , and (cid:96)norm, Zhang et al.
(TRADES ∞ ), and Carmon et al.
(RST ∞ ) for (cid:96) ∞ norm.
We also consider state-of-the-art multi-perturbation baselines: namely, we consider Adversarial training with the maximum (see Eq.
(Adv max ), average (Adv avg ) (Tramèr & Boneh, 2019) (see Eq.
(4)) over all perturbations, and Multiple steepest descent (MSD)
(Maini et al., 2020).
Datasets.
We evaluate our method on multiple benchmark datasets including CIFAR-10 (Krizhevsky, 2012), SVHN (Netzer et al., 2011) on Wide ResNet 28-10 (Zagoruyko & Komodakis, 2016) and
Tiny-ImageNet on ., 2016) architecture.
Evaluation setup.
We have evaluated the proposed defense scheme and baselines against perturbations generated by state-of-the-art attack methods.
We use the same attack parameters as Tramèr & Boneh (2019) for training and evaluation.
We validate the clean accuracy (Acc clean ), the worst (Acc unionadv ) and average (Acc avgadv ) adversarial accuracy across all the perturbation sets for all the models.
For (cid:96) ∞ attacks, we use PGD (Madry et al., 2017), Brendel and Bethge (Brendel et al., 2019), https [Table] and AutoAttack (Croce & Hein, 2020).
For (cid:96) 2 attacks, we use CarliniWagner (Carlini & Wagner, 2017), PGD (Madry et al., 2017), Brendel and Bethge (Brendel et al., 2019)
[Table]
and AutoAttack (Croce & Hein, 2020).
For (cid:96) 1 attacks, we use SLIDE (Tramèr & Boneh, 2019), Salt and pepper (Rauber et al., 2017), and EAD attack (Chen et al., 2018).
We provide a detailed description of the experimental setup in Appendix A.
5. C OMPARISON OF ROBUSTNESS AGAINST MULTIPLE PERTURBATIONS
Results with CIFAR-10 dataset.
Table 1 shows the experimental results for the CIFAR-10 dataset.
It is evident from the results that MNG-AC achieves a relative improvement of ∼ 6% and ∼ 4% on the Acc unionadv and Acc avgadv metric over the state-of-the-art methods trained on multiple perturbations.
Moreover, MNG-AC achieves ∼ 33% reduction in training time compared to the multi-perturbations training baselines.
It is also worth mentioning that, MNG-AC also shows an improvement over
Adv max , which is fundamentally designed to address the worst perturbation.
Results with SVHN dataset.
The results for the SVHN dataset are shown in Table 1.
We make the following observations from the results: (1) Firstly, MNG-AC signiﬁcantly outperforms Adv avg ,
Adv max by ∼ 14% and ∼ 25% on Acc unionadv metric.
Furthermore, it achieves an improvement of ∼ 7 .
2% and ∼ 26% on Acc avgadv metric over Adv avg , Adv max respectively.
(2) Secondly, MNG-AC leads to a ∼ 50% reduction in training time compared to the multi-perturbation training baselines. [Table]
Interestingly
[Table]
MNG-AC achieves signiﬁcant better performance over (cid:96) 1 adversarial training with comparable training time which illustrates the utility of our method over standard adversarial training.
Results with Tiny-ImageNet.
We also evaluate our method on Tiny-ImageNet to verify that it performs well on complex datasets.
In Table 1 we observe that MNG-AC outperforms the multiperturbation training baselines and achieves comparable performance to the single-perturbation baselines.
Only against (cid:96) ∞ perturbations, we notice that Adv max achieves better performance.
We believe this is an artefact of the inherent trade-off across multiple perturbations (Tramèr & Boneh, 2019; Schott et al., 2018).
Interestingly, MNG-AC even achieves comparable performance to the single perturbation baselines trained on (cid:96) 1 and (cid:96) 2 norm.
This demonstrates the effectiveness of MNG in preventing overﬁtting over a single attack, and it’s generalization ability to diverse types of attacks.
5. A BLATION STUDIES
Component analysis.
To further investigate our training scheme, we dissect the effectiveness of various components in Table 2.
First, we examine that SAT leads to a ∼ 68% and ∼ 30% reduction in training time over multiple perturbations baselines and MNG-AC for both the datasets, however, it does not improve the adversarial robustness.
Then, we analyze the impact of our meta-noise generator by injecting random noise z ∼ N (0 , I ) to the inputs for the generation of augmented samples.
We observe that it signiﬁcantly improves the performance over the SAT with a marginal increase in the training time.
Furthermore, leveraging MNG our combined framework MNG-AC achieves consistent improvements, outperforming all the baselines, demonstrating the efﬁcacy of our meta-learning scheme to defend against multiple perturbations.
Effect of hyperparameters.
We further analyze the impact of β in our augmentation loss (see
Eq.
(6)) in Figure 2.
We evaluate the worst-attack performance across all (cid:96) p norm adversarial attacks.
Our results show that as the value of β increases the performance on (cid:96) ∞ and (cid:96) 1 attacks improves signiﬁcantly.
In particular, the performance with (cid:96) ∞ and (cid:96) 1 attack improve by 4% with an increase in the weight of adversarial consistency loss.
However, an increase in β also leads to a reduction of ∼ 3% in the robustness against the (cid:96) 2 attacks, which is in line with the previous works that have showcased an inherent trade-off between various attacks theoretically and empirically (Tramèr &
Boneh, 2019; Schott et al., 2018).
5. F URTHER ANALYSIS OF OUR DEFENSE
Results on unforseen adversaries.
We further evaluate our model on various unforeseen perturbations (Kang et al., 2019) namely we evaluate on the Elastic, (cid:96) ∞ -JPEG, (cid:96) 1 -JPEG and (cid:96) − 2 -JPEG attacks.
Note that, even though adversarial training methods do not generalize beyond the threat model, we observe that MNG-VS improves the performance on these adversaries.
We compare
MNG SAT to the baselines trained with multiple perturbations on the SVHN dataset in Table 3.
We notice that even though, Adv max achieves better performance on (cid:96) p -JPEG attacks, it obtains the minimum robustness across the Acc unionadv metric.
In contrast, MNG-AC generalizes better over both the baselines for the worst-attack in the set of unforeseen perturbations.
Visualization of loss landscape.
As further qualitative analysis of the effect of MNG-AC, we compare the loss surface of various methods against (cid:96) ∞ , (cid:96) 1 , and (cid:96) 2 norm attack in Figure 3.
We can observe that in most of the instances when trained with a single adversary, the adversary can ﬁnd a direction orthogonal to that explored during training; for example, (cid:96) 1 attack results in a non-smooth
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
With an increase in β , the robustness against (cid:96) ∞ and (cid:96) 1 attack increases.
However, the robustness of (cid:96) 2 decreases showing an inherent trade-off across multiple perturbations
[Figure] [Figure]
loss surface for both (cid:96) ∞ and (cid:96) 2 adversarial training. On the contrary, MNG-AC achieves smoother loss surface across all types of attacks which suggests that the gradients modelled by our model are closer to the optimum global landscape.
See Appendix B for the loss landscape on CIFAR- [Figure]
Visualization of decision boundary.
Finally, we visualize the learned decision boundary on binaryclassiﬁcation task across multiple attacks in Figure 4.
We can observe that MNG-AC obtains the least error against all the attacks compared to the baselines trained on multiple perturbations.
Furthermore, the consistency regularization embeds multiple perturbations onto the same latent space, which pushes them away from the decision boundary that in turn improves the overall robustness.
See
Appendix B for visualization of the examples generated by our proposed meta-noise generator.
C ONCLUSION
We tackled the problem of robustness against multiple adversarial perturbations.
Existing defense methods are tailored to defend against single adversarial perturbation which is an artiﬁcial setting to evaluate in real-life scenarios where the adversary will attack the system in any way possible.
To this end, we propose a novel Meta-Noise Generator (MNG) that learns to stochastically perturb adversarial examples by generating output noise across diverse perturbations.
Then we train the model using Adversarial Consistency loss that accounts for label consistency across clean, adversarial, and augmented samples.
Additionally, to resolve the problem of computation overhead with conventional adversarial training methods for multiple perturbations, we introduce a Stochastic Adversarial
Training (SAT) which samples a perturbation from the distribution of perturbations.
We believe that our method can be a strong guideline when other researchers pursue similar tasks in the future.
A E XPERIMENTAL SETUP A. D ATASETS
CIFAR-10.
This dataset (Krizhevsky, 2012) contains 60,000 images with 5,000 images for training and 1,000 images for test for each class.
Each image is sized 32 × 32 , we use the Wide ResNet 28-10 architecture (Zagoruyko & Komodakis, 2016) as a base network for this dataset. 2.
SVHN.
This dataset (Netzer et al., 2011) contains 73257 training and 26032 testing images of digits and numbers in natural scene images containing ten-digit classes.
Each image is sized 32 × 32 , we use the Wide ResNet 28-10 architecture similar to the CIFAR-10 dataset as the base network.
Tiny-ImageNet.
This dataset 3 is a subset of ImageNet (Russakovsky et al., 2015) dataset, consisting of 500 , 50 , and 50 images for training, validation, and test dataset, respectively.
This dataset contains 64 × 64 size images from 200 classes, we use ResNet50 (He et al., 2016) as a base network for this dataset.
A. T RAINING SETUP
We use the SGD optimizer with momentum 0 .
9 and weight decay 5 · 10 − 4 to train all our models with cyclic learning rate with a maximum learning rate λ that increases linearly from 0 to λ over ﬁrst N/epochs and then decreases linearly from N/ 2 to 0 in the remainder epochs, as recommended by Wong et al.
(2020) for fast convergence of adversarial training.
We train all the models for 30 epochs on a single machine with four GeForce RTX 2080Ti using WideResNet 28-10 architecture (Zagoruyko & Komodakis, 2016).
We use the maximum learning rate of λ = 0 .
21 for all our experiments.
We use β = 16 for all the experiments with our meta noise generator.
The generator is formulated as a convolutional network with four 3 × 3 convolutional layers with LeakyReLU activations and one residual connection from input to output.
We use T = 2 for all our experiments and all our algorithms are implemented using Pytorch (Paszke et al., 2019) and TorchMeta (Deleu et al., 2019).
We use the weight for the KL divergence ( β = 6 . 0 ) for TRADES and RST in all our experiments.
We replicate all the baselines on SVHN and TinyImageNet since most of the baseline methods have reported their results on MNIST and CIFAR-10.
Unfortunately, we found that MSD Maini et al.
(2020) did not converge for larger datasets even after our extensive hyperparameter-search.
We believe that this is due to the the change in formulation of the inner optimization which leads to a difﬁculty in convergence for larger datasets.
Since the authors also report their results on CIFAR-10, we do not use it as a baseline for other datasets.
A. E VALUATION SETUP
For (cid:96) ∞ perturbations, we use PGD (Madry et al., 2017), Brendel and Bethge attack (Brendel et al., 2019), and AutoAttack (Croce & Hein, 2020).
For (cid:96) 2 perturbations, we use CarliniWagner attack (Carlini & Wagner, 2017), PGD (Madry et al., 2017), Brendel and Bethge attack (Brendel et al., 2019), and AutoAttack (Croce & Hein, 2020).
For (cid:96) 1 perturbations, we use SLIDE (Tramèr & Boneh, 2019), Salt and pepper (Rauber et al., 2017), and EAD attack (Chen et al., 2018).
For CIFAR-10 and SVHN, we use ε = { 8255 , 2000255 , 80255 } and α = { 0 . 004 , 1 . 0 , 0 . 1 } for (cid:96) ∞ , (cid:96) 1 , and (cid:96)attacks respectively.
For Tiny-ImageNet, we use ε = { 4255 , 2000255 , 80255 } and α = { 0 . 004 , 1 . 0 , 0 . 1 } for (cid:96) ∞ , (cid:96) 1 , and (cid:96) 2 attacks respectively.
We use 10 steps of PGD attack for (cid:96) ∞ , (cid:96) 2 during training.
For (cid:96)adversarial training, we use 20 steps during training and 100 steps during evaluation.
We use the code provided by the authors for evaluation against AutoAttack Croce & Hein (2020) and Foolbox (Rauber et al., 2017) library for all the other attacks.
B M ORE EXPERIMENTAL RESULTS
Due to the length limit of our paper, we provide a breakdown of all the attacks on CIFAR-10 in
Table 4, SVHN on Wide ResNet 28-10 in Table 5, Tiny-ImageNet on ResNet50 in Table 6.
Besides, we analyze the noise learned by our meta-learning framework on multiple datasets and the loss landscape on the CIFAR-10 dataset.
[Table]
Visualization of learned noise.
To demonstrate the learning ability of our meta-noise generator, we visualize the learned noise by our generator during training.
We present representative samples projected on various (cid:96) p norms and datasets in Figure 5 where each sample is projected to their respected norm-ball B ( x, ε ) around x with radius ε .
From the ﬁgure, we can observe that our metanoise generator incorporates the features by different attacks and learns diverse input-dependent noise distributions across multiple adversarial perturbations by explicitly minimizing the adversarial loss across multiple perturbations during meta-training.
Overall, it combines two approaches that are complementary to each other and leads to a novel input-dependent learner for generalization across diverse attacks.
Visuaization of loss landscape on CIFAR-10.
Figure 6 shows the visualization of loss landscape of various methods against (cid:96) ∞ , (cid:96) 1 , and (cid:96) 2 norm attack for CIFAR-10 dataset on Wide ResNet 28architecture.
We vary the input along a linear space deﬁned by the norm of the gradient where x and y-axes represent the perturbation added in each direction, and the z-axis represents the loss.
Similar to the SVHN dataset, we can observe that the loss is highly curved for multiple perturbations in the vicinity of the data point x for the adversarial training trained with a single perturbation, which reﬂects that the gradient poorly models the global landscape.
In contrast, MNG-AC achieves smoother loss surface across all types of (cid:96) p norm attacks.
[Table] [Table]
[Figure]
[Table]
C
I F
A R
S
VHN
[Figure]