Year: 2020

Abstract:
Adversarial examples are crafted with imperceptible perturbations with the intent to fool neural networks. Against such attacks, adversarial training and its variants stand as the strongest defense to date. Previous studies have pointed out that robust models that have undergone adversarial training tend to produce more salient and interpretable Jacobian matrices than their non-robust counterparts. A natural question is whether a model trained with an objective to produce salient Jacobian can result in better robustness. This paper answers this question with affirmative empirical results. We propose Jacobian Adversarially Regularized Networks (JARN) as a method to optimize the saliency of a classifier’s Jacobian by adversarially regularizing the model’s Jacobian to resemble natural training images1. Image classifiers trained with JARN show improved robust accuracy compared to standard models on the MNIST, SVHN and CIFAR-10 datasets, uncovering a new angle to boost robustness without using adversarial training examples.

heading: 1 INTRODUCTION
text: Deep learning models have shown impressive performance in a myriad of classification tasks (LeCun et al., 2015). Despite their success, deep neural image classifiers are found to be easily fooled by visually imperceptible adversarial perturbations (Szegedy et al., 2013). These perturbations can be crafted to reduce accuracy during test time or veer predictions towards a target class. This vulnerability not only poses a security risk in using neural networks in critical applications like autonomous driving (Bojarski et al., 2016) but also presents an interesting research problem about how these models work.
Many adversarial attacks have come into the scene (Carlini & Wagner, 2017; Papernot et al., 2018; Croce & Hein, 2019), not without defenses proposed to counter them (Gowal et al., 2018; Zhang et al., 2019). Among them, the best defenses are based on adversarial training (AT) where models are trained on adversarial examples to better classify adversarial examples during test time (Madry et al., 2017). While several effective defenses that employ adversarial examples have emerged (Qin et al., 2019; Shafahi et al., 2019), generating strong adversarial training examples adds non-trivial computational burden on the training process (Kannan et al., 2018; Xie et al., 2019).
Adversarially trained models gain robustness and are also observed to produce more salient Jacobian matrices (Jacobians) at the input layer as a side effect (Tsipras et al., 2018). These Jacobians visually resemble their corresponding images for robust models but look much noisier for standard non-robust models. It is shown in theory that the saliency in Jacobian is a result of robustness (Etmann et al., 2019). A natural question to ask is this: can an improvement in Jacobian saliency induce robustness in models? In other words, could this side effect be a new avenue to boost model robustness? To the best of our knowledge, this paper is the first to show affirmative findings for this question.
To enhance the saliency of Jacobians, we draw inspirations from neural generative networks (Choi et al., 2018; Dai & Wipf, 2019). More specifically, in generative adversarial networks (GANs) (Goodfellow et al., 2014), a generator network learns to generate natural-looking images with a training objective to fool a discriminator network. In our proposed approach, Jacobian Adversarially ∗Corresponding author: guoweial001@ntu.edu.sg 1Source code available at https://github.com/alvinchangw/JARN ICLR2020
Regularized Networks (JARN), the classifier learns to produce salient Jacobians with a regularization objective to fool a discriminator network into classifying them as input images. This method offers a new way to look at improving robustness without relying on adversarial examples during training. With JARN, we show that directly training for salient Jacobians can advance model robustness against adversarial examples in the MNIST, SVHN and CIFAR-10 image dataset. When augmented with adversarial training, JARN can provide additive robustness to models thus attaining competitive results. All in all, the prime contributions of this paper are as follows:
• We show that directly improving the saliency of classifiers’ input Jacobian matrices can increase its adversarial robustness.
• To achieve this, we propose Jacobian adversarially regularized networks (JARN) as a method to train classifiers to produce salient Jacobians that resemble input images.
• Through experiments in MNIST, SVHN and CIFAR-10, we find that JARN boosts adversarial robustness in image classifiers and provides additive robustness to adversarial training.

heading: 2 BACKGROUND AND RELATED WORK
text: Given an input x, a classifier f(x; θ) : x 7→ Rk maps it to output probabilities for k classes in set C, where θ is the classifier’s parameters and y ∈ Rk is the one-hot label for the input. With a training dataset D, the standard method to train a classifier f is empirical risk minimization (ERM), through minθ E(x,y)∼DL(x,y), where L(x,y) is the standard cross-entropy loss function defined as
L(x,y) = E(x,y)∼D [ −y> log f(x) ] (1)
While ERM trains neural networks that perform well on holdout test data, their accuracy drops drastically in the face of adversarial test examples. With an adversarial perturbation of magnitude ε at input x, a model is robust against this attack if
arg max i∈C fi(x; θ) = arg max i∈C
fi(x+δ; θ) , ∀δ ∈ Bp(ε) = δ : ‖δ‖p ≤ ε (2)
We focus on p =∞ in this paper.
Adversarial Training To improve models’ robustness, adversarial training (AT) (Goodfellow et al., 2016) seek to match the training data distribution with the adversarial test distribution by training classifiers on adversarial examples. Specifically, AT minimizes the loss function:
L(x,y) = E(x,y)∼D [
max δ∈B(ε)
L(x+δ,y) ]
(3)
where the inner maximization, maxδ∈B(ε) L(x+δ,y), is usually performed with an iterative gradient-based optimization. Projected gradient descent (PGD) is one such strong defense which performs the following gradient step iteratively:
δ ← Proj [δ − η sign (∇δL(x+δ,y))] (4)
where Proj(x) = arg minζ∈B(ε) ‖x−ζ‖. The computational cost of solving Equation (3) is dominated by the inner maximization problem of generating adversarial training examples. A naive way to mitigate the computational cost involved is to reduce the number gradient descent iterations but that would result in weaker adversarial training examples. A consequence of this is that the models are unable to resist stronger adversarial examples that are generated with more gradient steps, due to a phenomenon called obfuscated gradients (Carlini & Wagner, 2017; Uesato et al., 2018).
Since the introduction of AT, a line of work has emerged that also boosts robustness with adversarial training examples. Capturing the trade-off between natural and adversarial errors, TRADES (Zhang et al., 2019) encourages the decision boundary to be smooth by adding a regularization term to reduce the difference between the prediction of natural and adversarial examples. Qin et al. (2019)
seeks to smoothen the loss landscape through local linearization by minimizing the difference between the real and linearly estimated loss value of adversarial examples. To improve adversarial training, Zhang & Wang (2019) generates adversarial examples by feature scattering, i.e., maximizing feature matching distance between the examples and clean samples.
Tsipras et al. (2018) observes that adversarially trained models display an interesting phenomenon: they produce salient Jacobian matrices (∇xL) that loosely resemble input images while less robust standard models have noisier Jacobian. Etmann et al. (2019) explains that linearized robustness (distance from samples to decision boundary) increases as the alignment between the Jacobian and input image grows. They show that this connection is strictly true for linear models but weakens for non-linear neural networks. While these two papers show that robustly trained models result in salient Jacobian matrices, our paper aims to investigate whether directly training to generate salient Jacobian matrices can result in robust models.
Non-Adversarial Training Regularization Provable defenses are first proposed to bound minimum adversarial perturbation for certain types of neural networks (Hein & Andriushchenko, 2017; Weng et al., 2018; Raghunathan et al., 2018). One of the most advanced defense from this class of work (Wong et al., 2018) uses a dual network to bound the adversarial perturbation with linear programming. The authors then optimize this bound during training to boost adversarial robustness. Apart from this category, closer to our work, several works have studied a regularization term on top of the standard training objective to reduce the Jacobian’s Frobenius norm. This term aims to reduce the effect input perturbations have on model predictions. Drucker & Le Cun (1991) first proposed this to improve model generalization on natural test samples and called it ‘double backpropagation’. Two subsequent studies found this to also increases robustness against adversarial examples Ross & Doshi-Velez (2018); Jakubovitz & Giryes (2018). Recently, Hoffman et al. (2019) proposed an efficient method to approximate the input-class probability output Jacobians of a classifier to minimize the norms of these Jacobians with a much lower computational cost. Simon-Gabriel et al. (2019) proved that double backpropagation is equivalent to adversarial training with l2 examples. Etmann et al. (2019) trained robust models using double backpropagation to study the link between robustness and alignment in non-linear models but did not propose a new defense in their paper. While the double backpropagation term improves robustness by reducing the effect that perturbations in individual pixel have on the classifiers prediction through the Jacobians norm, it does not have the aim to optimize Jacobians to explicitly resemble their corresponding images semantically. Different from these prior work, we train the classifier with an adversarial loss term with the aim to make the Jacobian resemble input images more closely and show in our experiments that this approach confers more robustness.

heading: 3 JACOBIAN ADVERSARIALLY REGULARIZED NETWORKS (JARN)
text: Motivation Robustly trained models are observed to produce salient Jacobian matrices that resemble the input images. This begs a question in the reverse direction: will an objective function that encourages Jacobian to more closely resemble input images, will standard networks become robust? To study this, we look at neural generative networks where models are trained to produce natural-looking images. We draw inspiration from generative adversarial networks (GANs) where a generator network is trained to progressively generate more natural images that fool a discriminator model, in a min-max optimization scenario (Goodfellow et al., 2014). More specifically, we frame a classifier as the generator model in the GAN framework so that its Jacobians can progressively fool a discriminator model to interpret them as input images.
Another motivation lies in the high computational cost of the strongest defense to date, adversarial training. The cost on top of standard training is proportional to the number of steps its adversarial examples take to be crafted, requiring an additional backpropagation for each iteration. Especially with larger datasets, there is a need for less resource-intensive defense. In our proposed method (JARN), there is only one additional backpropagation through the classifier and the discriminator model on top of standard training. We share JARN in the following paragraphs and offer some theoretical analysis in § 3.1.
Jacobian Adversarially Regularized Networks Denoting input as x ∈ Rhwc for h × w-size images with c channels, one-hot label vector of k classes as y ∈ Rk, we express fcls(x) ∈ Rk as the prediction of the classifier (fcls), parameterized by θ. The standard cross-entropy loss is
Lcls = E(x,y) [ −y> log fcls(x) ] (5)
With gradient backpropagation to the input layer, through fcls with respect to Lcls, we can get the Jacobian matrix J ∈ Rhwc as:
J(x) := ∇xLcls = [ ∂Lcls ∂x1 · · · ∂Lcls ∂xd ] (6)
where d = hwc. The next part of JARN entails adversarial regularization of Jacobian matrices to induce resemblance with input images. Though the Jacobians of robust models are empirically observed to be similar to images, their distributions of pixel values do not visually match (Etmann et al., 2019). The discriminator model may easily distinguish between the Jacobian and natural images through this difference, resulting in the vanishing gradient (Arjovsky et al., 2017) for the classifier train on. To address this, an adaptor network (fapt) is introduced to map the Jacobian into the domain of input images. In our experiments, we use a single 1x1 convolutional layer with tanh activation function to model fapt, expressing its model parameters as ψ. With the J as the input of fapt, we get the adapted Jacobian matrix J ′ ∈ Rhwc,
J ′ = fapt(J) (7)
We can frame the classifier and adaptor networks as a generator G(x,y)
Gθ,ψ(x,y) = fapt(∇xLcls(x,y) ) (8) learning to model distribution of pJ′ that resembles px.
We now denote a discriminator network, parameterized by φ, as fdisc that outputs a single scalar. fdisc(x) represents the probability that x came from training images px rather than pJ′ . To train Gθ,ψ to produce J ′ that fdisc perceive as natural images, we employ the following adversarial loss:
Ladv = Ex[log fdisc(x)] + EJ′ [log(1− fdisc(J ′))] = Ex[log fdisc(x)] + E(x,y)[log(1− fdisc(Gθ,ψ(x)))] = Ex[log fdisc(x)] + E(x,y) [log(1− fdisc( fapt(∇xLcls(x,y))))]
(9)
Combining this regularization loss with the classification loss function Lcls in Equation (5), we can optimize through stochastic gradient descent to approximate the optimal parameters for the classifier fcls as follows,
θ∗ = arg min θ (Lcls + λadvLadv) (10)
where λadv control how much Jacobian adversarial regularization term dominates the training.
Since the adaptor network (fapt) is part of the generator G, its optimal parameters ψ∗ can be found with minimization of the adversarial loss,
ψ∗ = arg min ψ Ladv (11)
On the other hand, the discriminator (fdisc) is optimized to maximize the adversarial loss term to distinguish Jacobian from input images correctly,
φ∗ = arg max φ Ladv (12)
Analogous to how generator from GANs learn to generate images from noise, we add [−ε,−ε] uniformly distributed noise to input image pixels during JARN training phase. Figure 1 shows a
summary of JARN training phase while Algorithm 1 details the corresponding pseudo-codes. In our experiments, we find that using JARN framework only on the last few epoch (25%) to train the classifier confers similar adversarial robustness compared to training with JARN for the whole duration. This practice saves compute time and is used for the results reported in this paper.
Algorithm 1: Jacobian Adversarially Regularized Network 1 Input: Training data Dtrain, Learning rates for classifier fcls, adaptor fapt and discriminator fdisc: (α, β, γ) 2 for each training iteration do 3 Sample (x,y) ∼ Dtrain 4 x← x+ξ, ξi ∼ unif[−ε, ε] 5 Lcls ← −y> log fcls(x) . (1) Compute classification cross-entropy loss 6 J ← ∇xLcls . (2) Compute Jacobian matrix 7 J ′ ← fapt(J) . (3) Adapt Jacobian to image domain 8 Ladv ← log fdisc(x) + log(1− fdisc(J ′)) . (4) Compute adversarial loss 9 θ ← θ − α∇θ(Lcls + λadvLadv) . (5a) Update the classifier fcls to minimize Lcls and Ladv
10 ψ ← ψ − β ∇ψLadv . (5b) Update the adaptor fapt to minimize Ladv 11 φ← φ+ γ ∇φLadv . (5c) Update the discriminator fdisc to maximize Ladv

heading: 3.1 THEORETICAL ANALYSIS
text: Here, we study the link between JARN’s adversarial regularization term with the notion of linearized robustness. Assuming a non-parameteric setting where the models have infinite capacity, we have the following theorem while optimizing G with the adversarial loss Ladv . Theorem 3.1. The global minimum of Ladv is achieved when G(x) maps x to itself, i.e., G(x) = x.
Its proof is deferred to § A. If we assume Jacobian J of our classifier fcls to be the direct output of G, then J = G(x) = x at the global minimum of the adversarial objective.
In Etmann et al. (2019), it is shown that the linearized robustness of a model is loosely upperbounded by the alignment between the Jacobian and the input image. More concretely, denoting Ψi as the logits value of class i in a classifier F , its linearized robustness ρ can be expressed as ρ(x) := minj 6=i∗ Ψi ∗
(x)−Ψj(x) ‖∇xΨi∗ (x)−∇xΨj(x)‖ . Here we quote the theorem from Etmann et al. (2019):
Theorem 3.2 (Linearized Robustness Bound). (Etmann et al., 2019) Defining i∗ = arg maxi Ψi and j∗ = arg maxj 6=i∗ Ψ
j as top two prediction, we let the Jacobian with respect to the difference in top two logits be g := ∇x(Ψi
∗ − Ψj∗)(x). Expressing alignment between the Jacobian with the input as α(x) = |〈x,g〉|‖g‖ , then
ρ(x) ≤ α(x) + C ‖g‖
(13)
where C is a positive constant.
Combining with what we have in Theorem 3.1, assuming J to be close to g in a fixed constant term, the alignment term α(x) in Equation (13) is maximum when Ladv reaches its global minimum. Though this is not a strict upper bound and, to facilitate the training in JARN in practice, we use an adaptor network to transform the Jacobian, i.e., J ′ = fapt(J), our experiments show that model robustness can be improved with this adversarial regularization.

heading: 4 EXPERIMENTS
text: We conduct experiments on three image datasets, MNIST, SVHN and CIFAR-10 to evaluate the adversarial robustness of models trained by JARN.

heading: 4.1 MNIST
text: Setup MNIST consists of 60k training and 10k test binary-colored images. We train a CNN, sequentially composed of 3 convolutional layers and 1 final softmax layer. All 3 convolutional layers have a stride of 5 while each layer has an increasing number of output channels (64-128-256). For JARN, we use λadv = 1, a discriminator network of 2 CNN layers (64-128 output channels) and update it for every 10 fcls training iterations. We evaluate trained models against adversarial examples with l∞ perturbation ε = 0.3, crafted from FGSM and PGD (5 & 40 iterations). FGSM generates weaker adversarial examples with only one gradient step and is weaker than the iterative PGD method.
Results The CNN trained with JARN shows improved adversarial robustness from a standard model across the three types of adversarial examples (Table 1). In the MNIST experiments, we find that data augmentation with uniform noise to pixels alone provides no benefit in robustness from the baseline.

heading: 4.2 SVHN
text: Setup SVHN is a 10-class house number image classification dataset with 73257 training and 26032 test images, each of size 32 × 32 × 3. We train the Wide-Resnet model following hyperparameters from (Madry et al., 2017)’s setup for their CIFAR-10 experiments. For JARN, we use λadv = 5, a discriminator network of 5 CNN layers (16-32-64-128-256 output channels) and update it for every 20 fcls training iterations. We evaluate trained models against adversarial examples with (ε = 8/255), crafted from FGSM and 5, 10, 20-iteration PGD attack.
Results Similar to the findings in § 4.1, JARN advances the adversarial robustness of the classifier from the standard baseline against all four types of attacks. Interestingly, uniform noise image augmentation increases adversarial robustness from the baseline in the SVHN experiments, concurring with previous work that shows noise augmentation improves robustness (Ford et al., 2019).

heading: 4.3 CIFAR-10
text: Setup CIFAR-10 contains 32 × 32 × 3 colored images labeled as 10 classes, with 50k training and 10k test images. We train the Wide-Resnet model using similar hyperparameters to (Madry et al., 2017) for our experiments. Following the settings from Madry et al. (2017), we compare with a strong adversarial training baseline (PGD-AT7) that involves training the model with adversarial examples generate with 7-iteration PGD attack. For JARN, we use λadv = 1, a discriminator network of 5 CNN layers (32-64-128-256-512 output channels) and update it for every 20 fcls training iterations. We evaluate trained models against adversarial examples with (ε = 8/255), crafted from FGSM and PGD (5, 10 & 20 iterations). We also add in a fast gradient sign attack baseline (FGSMAT1) that generates adversarial training examples with only 1 gradient step. Though FGSM-trained models are known to rely on obfuscated gradients to counter weak attacks, we augment it with JARN to study if there is additive robustness benefit against strong attacks. We also implemented double backpropagation (Drucker & Le Cun, 1991; Ross & Doshi-Velez, 2018) to compare.
Results Similar to results from the previous two datasets, the JARN classifier performs better than the standard baseline for all four types of adversarial examples. Compared to the model trained with uniform-noise augmentation, JARN performs closely in the weaker FGSM attack while being more robust against the two stronger PGD attacks. JARN also outperforms the double backpropagation baseline, showing that regularizing for salient Jacobians confers more robustness than regularizing for smaller Jacobian Frobenius norm values. The strong PGD-AT7 baseline shows higher robustness against PGD attacks than the JARN model. When we train JARN together with 1-step adversarial training (JARN-AT1), we find that the model’s robustness exceeds that of strong PGD-AT7 baseline on all four adversarial attacks, suggesting JARN’s gain in robustness is additive to that of AT.

heading: 4.3.1 GENERALIZATION OF ROBUSTNESS
text: Adversarial training (AT) based defenses generally train the model on examples generated by perturbation of a fixed ε. Unlike AT, JARN by itself does not have ε as a training parameter. To study how JARN-AT1 robustness generalizes, we conduct PGD attacks of varying ε and strength (5, 10 and 20 iterations). We also include another PGD-AT7 baseline that was trained at a higher ε = (12/255). JARN-AT1 shows higher robustness than the two PGD-AT7 baselines against attacks with higher ε values (≤ 8/255) across the three PGD attacks, as shown in Figure 2. We also observe that the PGD-AT7 variants outperform each other on attacks with ε values close to their training ε, suggesting that their robustness is more adapted to resist adversarial examples that they are trained on. This relates to findings by Tramèr & Boneh (2019) which shows that robustness from adversarial training is highest against the perturbation type that models are trained on.

heading: 4.3.2 LOSS LANDSCAPE
text: We compute the classification loss value along the adversarial perturbation’s direction and a random orthogonal direction to analyze the loss landscape of the models. From Figure 3, we see that the models trained by the standard and FGSM-AT method display loss surfaces that are jagged and nonlinear. This explains why the FGSM-AT display modest accuracy at the weaker FGSM attacks but fail at attacks with more iterations, a phenomenon called obfuscated gradients (Carlini & Wagner, 2017; Uesato et al., 2018) where the initial gradient steps are still trapped within the locality of the input but eventually escape with more iterations. The JARN model displays a loss landscape that is less steep compared to the standard and FGSM-AT models, marked by the much lower (1 order of magnitude) loss value in Figure 3c. When JARN is combined with one iteration of adversarial training, the JARN-AT1 model is observed to have much smoother loss landscapes, similar to that of the PGD-AT7 model, a strong baseline previously observed to be free of obfuscated gradients. This suggests that JARN and AT have additive benefits and JARN-AT1’s adversarial robustness is not attributed to obfuscated gradients.
A possible explanation behind the improved robustness through increasing Jacobian saliency is that the space of Jacobian shrinks under this regularization, i.e., Jacobians have to resemble non-noisy images. Intuitively, this means that there would be fewer paths for an adversarial example to reach an optimum in the loss landscape, improving the model’s robustness.

heading: 4.3.3 SALIENCY OF JACOBIAN
text: The Jacobian matrices of JARN model and PGD-AT are salient and visually resemble the images more than those from the standard model (Figure 4). Upon closer inspection, the Jacobian matrices of the PGD-AT model concentrate their values at small regions around the object of interest whereas those of the JARN model cover a larger proportion of the images. One explanation is that the JARN model is trained to fool the discriminator network and hence generates Jacobian that contains details of input images to more closely resemble them.

heading: 4.3.4 COMPUTE TIME
text: Training with JARN is computationally more efficient when compared to adversarial training (Table 4). Even when combined with FGSM adversarial training JARN, it takes less than half the time of 7-step PGD adversarial training while outperforming it in robustness.

heading: 4.3.5 SENSITIVITY TO HYPERPARAMETERS
text: The performance of GANs in image generation has been well-known to be sensitive to training hyperparameters. We test JARN performance across a range of λadv , batch size and discriminator update intervals that are different from § 4.3 and find that its performance is relatively stable across hyperparameter changes, as shown in Appendix Figure 5. In a typical GAN framework, each training step involves a real image sample and an image generated from noise that is decoupled from the real sample. In contrast, a Jacobian is conditioned on its original input image and both are used in the same training step of JARN. This training step resembles that of VAE-GAN (Larsen et al., 2015) where pairs of real images and its reconstructed versions are used for training together, resulting in generally more stable gradients and convergence than GAN. We believe that this similarity favors JARN’s stability over a wider range of hyperparameters.

heading: 4.3.6 BLACK-BOX TRANSFER ATTACKS
text: Transfer attacks are adversarial examples generated from an alternative, substitute model and evaluated on the defense to test for gradient masking (Papernot et al., 2016; Carlini et al., 2019). More specifically, defenses relying on gradient masking will display lower robustness towards transfer attacks than white-box attacks. When evaluated on such black-box attacks using adversarial examples generated from a PGD-AT7 trained model and their differently initialized versions, both JARN and JARN-AT1 display higher accuracy than when under white-box attacks (Table 5). This demonstrates that JARN’s robustness does not rely on gradient masking. Rather unexpectedly, JARN performs better than JARN-AT1 under the PGD-AT7 transfer attacks, which we believe is attributed to its better performance on clean test samples.

heading: 5 CONCLUSIONS
text: In this paper, we show that training classifiers to give more salient input Jacobian matrices that resemble images can advance their robustness against adversarial examples. We achieve this through an adversarial regularization framework (JARN) that train the model’s Jacobians to fool a discriminator network into classifying them as images. Through our experiments in three image datasets, JARN boosts adversarial robustness of standard models and give competitive performance when added on to weak defenses like FGSM. Our findings open the viability of improving the saliency of Jacobian as a new avenue to boost adversarial robustness.

heading: ACKNOWLEDGMENTS
text: This work is funded by the National Research Foundation, Singapore under its AI Singapore programme [Award No.: AISG-RP-2018-004] and the Data Science and Artificial Intelligence Research Center (DSAIR) at Nanyang Technological University.

heading: A PROOF OF THEOREM 3.1
text: Theorem A.1. The global minimum of Ladv is achieved when G(x) maps x to itself, i.e., G(x) = x.
Proof. From (Goodfellow et al., 2014), for a fixed G, the optimal discriminator is
f∗disc(x) = pdata(x)
pdata(x) + pG(x) (14)
We can include the optimal discriminator into Equation (9) to get
Ladv(G) = Ex∼pdata [log f∗disc(x)] + Ex∼pdata [log(1− f∗disc(G(x)))] = Ex∼pdata [log f∗disc(x)] + Ex∼pG [log(1− f∗disc(x))]
= Ex∼pdata [ log
pdata(x)
pdata(x) + pG(x)
] + Ex∼pG [ log
pG(x)
pdata(x) + pG(x) ] = Ex∼pdata [ log
pdata(x) 1 2 (pdata(x) + pG(x))
] + Ex∼pG [ log
pG(x) 1 2 (pdata(x) + pG(x))
] − 2 log 2
= KL ( pdata ∥∥∥∥ pdata + pG2 ) +KL ( pG ∥∥∥∥ pdata + pG2 ) − log 4
= 2 · JS(pdata||pG)− log 4 (15)
where KL and JS are the Kullback-Leibler and Jensen-Shannon divergence respectively. Since the Jensen-Shannon divergence is always non-negative, Ladv(G) reaches its global minimum value of − log 4 when JS(pdata||pG) = 0. When G(x) = x, we get pdata = pG and consequently JS(pdata||pG) = 0, thus completing the proof.

heading: B SENSITIVITY TO HYPERPARAMETERS

Review summaries:
This paper proposes a novel regularization strategy for improving the robustness of networks to adversarial noise. A term is added to the standard supervised cross-entropy loss that encourages the Jacobian of the network to itself be interpreted as a valid image. This "regularization" term is constructed by running the input-output Jacobian of the classification network through an "adapter network" and then in turn interpreting its output as a "generator" in a GAN setup. A separate discriminator network is training to distinguish real input images from these adapter-processed input-output Jacobians. The overall regularization is the standard minimax GAN loss applied to this generator/discriminator setup. The impetus for this stems from a previous observation that salient or interpretable input-output Jacobians naturally arise for networks that have undergone adversarial training to increase robustness.