E XCESSIVE I NVARIANCE C AUSES A DVERSARIAL V ULNERABILITY
A BSTRACT
Despite their impressive performance, deep neural networks exhibit striking failures on out-of-distribution inputs.
One core idea of adversarial example research is to reveal neural network errors under such distribution shifts.
We decompose these errors into two complementary sources: sensitivity and invariance.
We show deep networks are not only too sensitive to task-irrelevant changes of their input, as is well-known from (cid:15) -adversarial examples, but are also too invariant to a wide range of task-relevant changes, thus making vast regions in input space vulnerable to adversarial attacks.
We show such excessive invariance occurs across various tasks and architecture types.
On MNIST and ImageNet one can manipulate the class-speciﬁc content of almost any image without changing the hidden activations.
We identify an insufﬁciency of the cross-entropy loss as a reason for these failures.
Further, we extend the standard cross-entropy based on an informationtheoretic analysis so it encourages the model to consider all task-dependent features in its decision.
This provides the ﬁrst approach tailored explicitly to overcome excessive invariance and resulting vulnerabilities.
I NTRODUCTION
cases of modern machine learning models (Szegedy et al., 2013) and a prime example of their weakness in out-of-distribution generalization.
It is particularly striking that under i.i.d.
settings deep networks show superhuman performance on many tasks (LeCun et al., 2015), while tiny targeted shifts of the input distribution can cause them to make unintuitive mistakes.
The reason for these failures and how they may be avoided or at least mitigated is an active research area (Schmidt et al., 2018; Gilmer et al., 2018b; Bubeck et al., 2018).
So far, the study of adversarial examples has mostly been concerned with the setting of small perturbation, or (cid:15) -adversaries
(Goodfellow et al., 2015; Madry et al., 2017; Raghunathan et al., 2018).
Perturbation-based adversarial examples are appealing because they allow to quantitatively measure notions of adversarial robustness (Brendel et al., 2018).
However, recent work argued that the perturbation-based approach is unrealistically restrictive and called for the need of generalizing the concept of adversarial examples to the unrestricted case, including any input crafted to be misinterpreted by the learned model (Song et al., 2018; Brown et al., 2018).
Yet, settings beyond (cid:15) -robustness are hard to formalize (Gilmer et al., 2018a).
We argue here for an alternative, complementary viewpoint on the problem of adversarial examples.
Instead of focusing on transformations erroneously crossing the decision-boundary of classiﬁers, we focus on excessive invariance as a major cause for adversarial vulnerability.
To this end, we introduce the concept of invariance-based adversarial examples and show that class-speciﬁc content of almost any input can be changed arbitrarily without changing activations of the network, as illustrated in ﬁgure 1 for ImageNet.
This viewpoint opens up new directions to analyze and control crucial aspects underlying vulnerability to unrestricted adversarial examples.
The invariance perspective suggests that adversarial vulnerability is a consequence of narrow learning, yielding classiﬁers that rely only on few highly predictive features in their decisions.
This has also been supported by the observation that deep networks strongly rely on spectral statistical regularities (Jo & Bengio, 2017), or stationary statistics (Gatys et al., 2017) to make their decisions, rather than more abstract features like shape and appearance.
We hypothesize that a major reason for this excessive invariance can be understood from an information-theoretic viewpoint of crossentropy, which maximizes a bound on the mutual information between labels and representation, giving no incentive to explain all class-dependent aspects of the input.
This may be desirable in some cases, but to achieve truly general understanding of a scene or an object, machine learning models have to learn to successfully separate essence from nuisance and subsequently generalize even under shifted input distributions.
Our contributions:
• We identify excessive invariance underlying striking failures in deep networks and formalize the connection to adversarial examples.
• We show invariance-based adversarial examples can be observed across various tasks and types of deep network architectures.
• We propose an invertible network architecture that gives explicit access to its decision space, enabling class-speciﬁc manipulations to images while leaving all dimensions of the representation seen by the ﬁnal classiﬁer invariant.
• From an information-theoretic viewpoint, we identify the cross-entropy objective as a major reason for the observed failures.
Leveraging invertible networks, we propose an alternative objective that provably reduces excessive invariance and works well in practice.
T WO C OMPLEMENTARY A PPROACHES TO A DVERSARIAL E XAMPLES
In this section, we deﬁne pre-images and establish a link to adversarial examples
Deﬁnition 1 (Pre-images / Invariance) .
Let F : R d → R C be a neural network, F = f L ◦ · · · ◦ fwith layers
f i and let F i denote the network up to layer i .
Further, let D : R d → { 1 , . . .
, C } be a classiﬁer with D = arg max k =1 ,...,C softmax ( F ( x ))
k .
Then, for input x ∈ R d , we deﬁne the following pre-images
(i) i -th Layer pre-image: { x ∗ ∈ R d
| F i ( x ∗ )
=
F i ( x ) } (ii)
Logit pre-image: { x ∗ ∈ R d | F ( x ∗ ) =
F ( x ) } (iii) Argmax pre
image: { x ∗ ∈ R d | D ( x ∗ ) =
D ( x ) } ,
where (i) ⊂ (ii)
⊂ (iii) by the compositional nature of D .
Moreover, the (sub-)network is invariant to perturbations ∆ x which satisfy x ∗ = x + ∆ x .
[Equation]
→
[Equation]
Non-trivial pre
-images (pre-images containing more elements than input x ) after the i -th layer occur if the chain f i ◦ · · · ◦ f 1 is not injective, for instance due to subsampling or non-injective activation functions like ReLU (Behrmann et al., 2018a).
This accumulated invariance can become problematic if not controlled properly, as we will show in the following.
We deﬁne perturbation-based adversarial examples by introducing the notion of an oracle (e.g., a human decision-maker or the unknown input-output function considered in learning theory):
Deﬁnition 2 (Perturbation-based Adversarial Examples) .
A Perturbation-based adversarial example x ∗ ∈ R d of x ∈ R d fulﬁlls:
(i) Perturbation of decision: D ( x ∗ ) (cid:54)
=
o ( x ∗ ) and D ( x ) (cid:54)
=
D ( x ∗ ) , where D : R d → { 1 , . .
, C } is the classiﬁer and o : R d → { 1 , . . .
, C } is the oracle .
(ii) Created by adversary:
x ∗ ∈ R
d is created by an algorithm A : R d → R d with x (cid:55)→ x ∗ .
Further, (cid:15) -bounded adversarial ex. x ∗ of x fulﬁll (cid:107) x − x ∗ (cid:107) < (cid:15) , (cid:107) · (cid:107) a norm on R d and (cid:15) > 0 .
Usually, such examples are constructed as (cid:15) -bounded adversarial examples (Goodfellow et al., 2015).
However, as our goal is to characterize general invariances of the network, we do not restrict ourselves to bounded perturbations.
Deﬁnition 3 (Invariance-based Adversarial Examples) .
Let G denote the i -th layer, logits or the classiﬁer (Deﬁnition 1) and let x ∗ (cid:54) =
x be in the G pre-image of x and and o an oracle (Deﬁnition 2).
Then, an invariance-based adversarial example fulﬁlls o ( x ) (cid:54) =
o ( x ∗ ) , while G ( x ) =
G ( x ∗ ) (and hence D ( x )
= D ( x ∗ ) ).
Intuitively, adversarial perturbations cause the output of the classiﬁer to change while the oracle would still consider the new input x ∗ as being from the original class.
Hence in the context of (cid:15) - bounded perturbations, the classiﬁer is too sensitive to task-irrelevant changes .
On the other hand, movements in the pre-image leave the classiﬁer invariant.
If those movements induce a change in class as judged by the oracle, we call these invariance-based adversarial examples.
In this case, however, the classiﬁer is too insensitive to task-relevant changes .
In conclusion, these two modes are complementary to each other, whereas both constitute failure modes of the learned classiﬁer.
When not restricting to (cid:15) -perturbations, perturbation-based and invariance-based adversarial examples yield the same input x ∗ via
[Equation]
with different reference points x 1 and x 2 , see Figure 2.
Hence, the key difference is the change of reference , which allows us to approach these failure modes from different directions.
To connect these failure modes with an intuitive understanding of variations in the data, we now introduce the notion of invariance to nuisance and semantic variations, see also (Achille & Soatto, 2018).
Deﬁnition 4 (Semantic/ Nuisance perturbation of an input) .
Let o be an oracle (Deﬁnition 2) and x ∈ R d .
Then, a perturbation ∆ x of an input x ∈ R d is called semantic , if o ( x ) (cid:54) =
o ( x + ∆ x ) and nuisance if o ( x ) =
o ( x + ∆ x ) .
For example, such a nuisance perturbation could be a translation or occlusion in image classiﬁcation.
Further in Appendix A, we discuss the synthetic example called Adversarial Spheres from (Gilmer et al., 2018b), where nuisance and semantics can be explicitly formalized as rotation and norm scaling.
2. U SING B IJECTIVE N ETWORKS TO A NALYZE E XCESSIVE I NVARIANCE
[Figure]
As invariance-based adversarial examples manifest themselves in changes which do not affect the output of the network F , we need a generic approach that gives us access to the discarded nuisance variability.
While feature nuisances are intractable to access for general architectures (see comment after Deﬁnition 1), invertible classiﬁers only remove nuisance variability in their ﬁnal projection (Jacobsen et al., 2018).
For C < d , we denote the classiﬁer as D : R d → { 1 , ..., C } .
Our contributions in this section are: (1) Introduce an invertible architecture with a simpliﬁed readout structure, allowing to exactly visualize manipulations in the hidden-space, (2) Propose an analytic attack based on this architecture allowing to analyze its decision-making, (3)
Reveal striking invariance-based vulnerability in competitive classiﬁers.
Bijective classiﬁers with simpliﬁed readout.
We build deep networks that give access to their decision space by removing the ﬁnal linear mapping onto the class probes in invertible
RevNet-classiﬁers and call these networks fully invertible RevNets.
The fully invertible RevNet classiﬁer can be written as D θ = arg max k =1 ,...,C softmax ( F θ ( x ) k ) , where F θ represents the bijective network.
We denote z
= F θ ( x ) , z s =
z 1 ,...,C as the logits (semantic variables) and z n = z C +1 ,...,d as the nuisance variables ( z n is not used for classiﬁcation).
In practice we choose the ﬁrst C indices of the ﬁnal z tensor or apply a more sophiscticated DCT scheme (see appendix D) to set the subspace z s , but other choices work as well.
The architecture of the network is similar to iRevNets (Jacobsen et al., 2018) with some additional Glow components like actnorm (Kingma & Dhariwal, 2018), squeezing, dimension splitting and afﬁne block structure (Dinh et al., 2017), see Figurefor a graphical description.
As all components are common in the bijective network literature, we refer the reader to Appendix D for exact training and architecture details.
Due to its simple readout structure, the resulting invertible network allows to qualitatively and quantitatively investigate the task- content in and logit
Despite this restriction, we achieve performance on par with commenly-used baselines on MNIST and ImageNet, see Table 1 and Appendix
D.
[Table]
-2012 validation set of our proposed fully invertible RevNet compared to a VGG (Simonyan & Zisserman, 2014) and two ResNet
(He et al., 2016) variants, as well as an iRevNet (Jacobsen et al., 2018) with a non-invertible ﬁnal projection onto the logits.
Our proposed fully invertible RevNet performs roughly on par with others.
Analytic attack.
To analyze the trained models, we can sample elements from the logit pre-image by computing x met =
F − 1 ( z s , ˜ z n ) , where z s and ˜ z n are taken from two different inputs.
We term this heuristic metameric sampling .
The samples would be from the true data distribution if the subspaces would be factorized as P ( z s , z n )
=
P ( z s ) P ( z n ) .
Experimentally we ﬁnd that logit metamers are revealing adversarial subspaces and are visually close to natural images on ImageNet.
Thus, metameric sampling gives us an analytic tool to inspect dependencies between semantic and nuisance variables without the need for expensive and approximate optimization procedures.
Attack on adversarial spheres.
First, we evaluate our analytic attack on the synthetic spheres dataset, where the task is to classify samples as belonging to one out of two spheres with different radii.
We choose the sphere dimensionality to be d = 100 and the radii: R 1 = 1 , R 2 = 10 .
By training a fully-connected fully invertible RevNet, we obtain 100% accuracy.
After training we visualize the decision-boundaries of the original classiﬁer D and a posthoc trained classiﬁer on z n (nuisance classiﬁer), see Figure 4.
We densely sample points in a 2D subspace, following Gilmer et al.
(2018b),
to visualize two cases: 1) the decision-boundary on a 2D plane spanned by two randomly chosen data points, 2) the decision-boundary spanned by metameric sample x met and reference point x .
In the metameric sample subspace we identify excessive invariance of the classiﬁer.
Here, it is possible to move any point from the inner sphere to the outer sphere without changing the classiﬁers predictions.
However, this is not possible for the classiﬁer trained on z n .
Most notably, the visualized failure is not due to a lack of data seen during training, but rather due to excessive invariance of the original classiﬁer D on z s .
Thus, the nuisance classiﬁer on z n does not exhibit the same adversarial vulnerability in its subspace.
without changing the 10- and 1000-dimensional logit vectors respectively.
This highlights a striking failure of classiﬁers to capture all task-dependent variability.
Attack on MNIST and ImageNet.
After validating its potential to uncover adversarial subspaces, we apply metameric sampling to fully invertible RevNets trained on MNIST and Imagenet, see
Figure 5.
The result is striking, as the nuisance variables z n are dominating the visual appearance of the logit metamers, making it possible to attach any semantic content to any logit activation pattern.
Note that the entire 1000-dimensional feature vector containing probabilities over all ImageNet classses remains unchanged by any of the transformations we apply.
To show our ﬁndings are not a particular property of bijective networks, we attack an ImageNet trained ResNet152 with a gradientbased version of our metameric attack, also known as feature adversaries (Sabour et al., 2016).
The attack minimizes the mean squared error between a given set of logits from one image to another image (see appendix B for details).
The attack shows the same failures for non-bijective models.
This result highlights the general relevance of our ﬁnding and poses the question of the origin of this excessive invariance, which we will analyze in the following section.
O VERCOMING I NSUFFICIENCY OF C ROSSENTROPY - BASED I NFORMATION - MAXIMIZATION
In this section we identify why the cross-entropy objective does not necessarily encourage to explain all task-dependent variations of the data and propose a way to ﬁx this.
As shown in ﬁgure 4, the nuisance classiﬁer on z n uses task-relevant information not captured by the logit classiﬁer D θ on z s (evident by its superior performance in the adversarial subspace).
We leverage the simple readout-structure of our invertible network and turn this observation into a formal explanation framework using information theory: Let ( x, y ) ∼ D with labels y ∈ { 0 , 1 } C .
Then the goal of a classiﬁer can be stated as maximizing the mutual information (Cover & Thomas, 2006) between semantic features z s (logits) extracted by network F θ and labels y , denoted by
I ( y ; z s ) .
Adversarial distribution shift.
As the previously discussed failures required to modify input data from distribution D , we introduce the concept of an adversarial distribution shift D Adv (cid:54) =
D to formalize these modiﬁcations.
Our only assumption for D Adv is I D Adv ( z n ; y ) ≤ I D ( z n ; y ) .
Intuitively, the nuisance variables z n of our network do not become more informative about y .
Thus, the distribution shift may reduce the predictiveness of features encoded in z s , but does not introduce or increase the predictive value of variations captured in z n .
Bijective networks F θ capture all variations by design which translates to information preservation
I ( y ; x ) =
I ( y ; F θ ( x )) , see (Kraskov et al., 2004).
Consider the reformulation
[Equation]
by the chain rule of mutual information (Cover & Thomas, 2006), where I ( y ; z n | z s ) denotes the conditional mutual information.
Most strikingly, equation 5 offers three ways forward:
Direct increase of I ( y ; z s ) 2.
Indirect increase of I ( y ; z s | z n ) via decreasing I ( y ; z n ) 3.
Reducing dependence I ( z s ; z n ) to make maximizing I ( y ;
z s ) equivalent to minimizing I ( y ; z n ) , as I ( y ; z n | z s )
=
I ( y ; z n ) under independence ( I ( z s ; z n ) = 0 ).
Usually in a classiﬁcation task, only I ( y ; z s ) is increased actively via training a classiﬁer.
While this approach is sufﬁcient in most cases, expressed via high accuracies on training and test data, it may fail under D adv .
This highlights why cross-entropy training may not be sufﬁcient to overcome excessive semantic invariance.
However, by leveraging the bijection F θ we can minimize the unused information I ( y ; z n ) using the intuition of a nuisance classiﬁer.
Deﬁnition 5 (Independence cross-entropy loss) .
Let F θ : R d → R d a bijective network with parameters θ ∈ R p 1 and ˜ F θ ( x ) = softmax ( F θ ( x ) 1 ,...,C ) .
Furthermore, let D θ nc : R d − C →
[0 , 1] C be the nuisance classiﬁer with θ nc ∈ R p 2 .
Then, the independence cross-entropy loss is deﬁned as:
[Equation]
The underlying principles of the nuisance classiﬁcation loss L nCE can be understood using a variational lower bound on mutual information from Barber & Agakov (2003).
In summary, the minimization is with respect to a lower bound on I D ( y ; z n ) , while the maximization aims to tighten the bound (see Lemma 10 in Appendix C).
By using these results, we now state the main result under the assumed distribution shift and successful minimization (proof in Appendix C.1):
Theorem 6 (Information I D Adv ( y ; z s ) maximal after distribution shift) .
Let D Adv denote the adversarial distribution and D the training distribution.
Assume I D ( y ; z n )
= 0 by minimizing L iCE and the distribution shift satisﬁes I D Adv ( z n ; y ) ≤ I D ( z n ; y ) .
Then,
[Equation]
Thus, incorporating the nuisance classiﬁer allows for the discussed indirect increase of I D Adv ( y ; z s ) under an adversarial distribution shift, visualized in Figure 6. [Figure]
[Figure]
Under distribution D , the iCE-loss minimizes I ( y ; z n ) (Lemma 10, Appendix C), but has no effect as the CE-loss already maximizes I ( y ; z s ) .
However under the shift to D Adv , the information
I ( y ; z s ) decreases when training only under the CE-loss (orange arrow), while the iCE-loss induces
I ( y ; z n ) = 0 and thus leaves I ( y ; z s ) unchanged (Theorem 6).
To aid stability and further encourage factorization of z s and z n in practice, we add a maximum likelihood term to our independence cross-entropy objective as
[Equation]
where det ( J xθ ) denotes the determinant of the Jacobian of F θ ( x ) and p k ∼ N ( β k , γ k ) with β k , γ k learned parameter.
The log-determinant can be computed exactly in our model with negligible additional cost.
Note, that optimizing L MLE n on the nuisance variables together with L sCE amounts to maximum-likelihood under a factorial prior (see Lemma 11 in Appendix C).
Just as in GANs the quality of the result relies on a tight bound provided by the nuisance classiﬁer and convergence of the MLE term.
Thus, it is important to analyze the success of the objective after training.
We do this by applying our metameric sampling attack, but there are also other ways like evaluating a more powerful nuisance classiﬁer after training.
A PPLYING I NDEPENDENCE C ROSS - ENTROPY
In this section, we show that our proposed independence cross-entropy loss is effective in reducing invariance-based vulnerability in practice by comparing it to vanilla cross-entropy training in four aspects: (1) error on train and test set, (2) effect under distribution shift, perturbing nuisances via metameric sampling, (3) evaluate accuracy of a classiﬁer on the nuisance variables to quantify the class-speciﬁc information in them and (4) on our newly introduced shiftMNIST, an augmented version of MNIST to benchmark adversarial distribution shifts according to Theorem 6.
For all experiments we use the same network architecture and settings, the only difference being the two additional loss terms as explained in Deﬁnition 5 and equation 6.
In terms of test error of the logit classiﬁer, both losses perform approximately on par, whereas the gap between train and test error vanishes for our proposed loss function, indicating less overﬁtting.
For classiﬁcation errors see
Table 2 in appendix D.
Robustness under metameric sampling attack.
To analyze if our proposed loss indeed leads to independence between z n and labels y , we attack it with our metameric sampling procedure.
As we are only looking on data samples and not on samples from the model (factorized gaussian on nuisances), this attack should reveal if the network learned to trick the objective.
In Figure 7 we show interpolations between original images and logit metamers in CE- and iCE-trained fully invertible
RevNets.
In particular, we are holding the activations z s constant, while linearly interpolating nuisances z n down the column.
The CE-trained network allows us to transform any image into any class without changing the logits.
However, when training with our proposed iCE, the picture changes fundamentally and interpolations in the pre-image only change the style of a digit, but not its semantic content.
This shows our loss has the ability to overcome excessive task-related invariance and encourages the model to explain and separate all task-related variability of the input from the nuisances of the task.
A classiﬁer trained on the nuisance variables of the cross-entropy trained model performs even better than the logit classiﬁer.
Yet, a classiﬁer on the nuisances of the independence cross-entropy trained model is performing poorly (Table 2 in appendix D).
This indicates little class-speciﬁc information in the nuisances z n , as intended by our objective function.
Note also that this inability of the nuisance classiﬁer to decode class-speciﬁc information is not due to it being hard to read out from z n , as this would be revealed by the metameric sampling attack (see Figure 7).
[Figure]
D Train
D Adv (a
[Figure]
CE ResNet 00.
(a
[Figure]
CE ﬁ-RevNet 00.
(a
[Figure]
iCE ﬁ-RevNet 00.
(a) Difference 00.
[Figure]
CE ResNet 00.
[Figure]
) CE ﬁ-RevNet 00.
[Figure]
iCE ﬁ-RevNet 00.
[Figure]
Difference 00.
shifted adversarial test distribution does not shiftMNIST: Benchmarking adversarial distribution shift.
To further test the efﬁcacy of our proposed independence cross-entropy, we introduce a simple, but challenging new dataset termed shiftMNIST to test classiﬁers under adversarial distribution shifts D Adv .
The dataset is based on vanilla MNIST, augmented by introducing additional, highly predictive features at train time that are randomized or removed at test time.
This allows us to reduce mutual information between category and the newly introduced feature in a targeted and controllable manner
Binary shiftMNIST is vanilla MNIST augmented by coding the category for each digit into a single binary pixel scheme.
The location of the binary pixel reveals the category of each image unambigiously, while only minimally altering the image’s appearance.
At test time, the binary code is not present and the network can not rely on it anymore
Textured shiftMNIST introduces textured backgrounds for each digit category which are patches sampled the describable texture dataset (Cimpoi et al., 2014).
At train time the same type of texture is underlayed each digit of the same category, while texture types across categories differ.
At test time, the relationship is broken and texture backgrounds are paired with digits randomly, again minimizing the mutual information between background and label in a targeted manner.
See Figure 8 for examples 1 .
It turns out that this task is indeed very hard for standard classiﬁers and their tendency to become excessively invariant to semantically meaningful features, as predicted by our theoretical analysis.
When trained with cross-entropy, ResNets and ﬁ-RevNets make zero errors on the train set, while having error rates of up to 87% on the shifted test set.
This is striking, given that e.g. in binary shiftMNIST, only one single pixel is removed under D Adv , leaving the whole image almost unchanged.
When applying our independence cross-entropy, the picture changes again.
The errors made by the network improve by up to almost 38% on binary shiftMNIST and around 28% on textured shiftMNIST.
This highlights the effectiveness of our proposed loss function and its ability to minimize catastrophic failure under severe distribution shifts exploiting excessive invariance.
R ELATED W ORK
Adversarial examples.
Adversarial examples often include (cid:15) -norm restrictions (Szegedy et al., 2013), while (Gilmer et al., 2018a) argue for a broader deﬁnition to fully capture the implications for security.
The (cid:15) -adversarial examples have also been extended to (cid:15) -feature adversaries (Sabour et al., 2016), which are equivalent to our approximate metameric sampling attack.
Some works (Song et al., 2018; Fawzi et al., 2018) consider unrestricted adversarial examples, which are closely related to invariance-based adversarial vulnerability.
The difference to human perception revealed by adversarial examples fundamentally questions which statistics deep networks use to base their decisions (Jo & Bengio, 2017; Tsipras et al., 2019).
Relationship between standard and bijective networks.
We leverage recent advances in reversible (Gomez et al., 2017) and bijective networks (Jacobsen et al., 2018; Ardizzone et al., 2019; Kingma &
Dhariwal, 2018) for our analysis.
It has been shown that ResNets and iRevNets behave similarly on various levels of their representation on challenging tasks (Jacobsen et al., 2018) and that iRevNets as well as Glow-type networks are related to ResNets by the choice of dimension splitting applied in their residual blocks (Grathwohl et al., 2019).
Perhaps unsurprisingly, given so many similarities,
ResNets themselves have been shown to be provably bijective under mild conditions (Behrmann et al., 2018b).
Further, excessive invariance of the type we discuss here has been shown to occur in non residual-type architectures as well (Gilmer et al., 2018b; Behrmann et al., 2018a).
For instance, it has been observed that up to 60% of semantically meaningful input dimensions on the adversarial spheres problem are learned to be ignored, while retaining virtually perfect performance (Gilmer et al., 2018b).
In summary, there is ample evidence that RevNet-type networks are closely related to
ResNets, while providing a principled framework to study widely observed issues related to excessive invariance in deep learning in general and adversarial robustness in particular.
Information theory.
The information-theoretic view has gained recent interest in machine learning due to the information bottleneck (Tishby & Zaslavsky, 2015; Shwartz-Ziv & Tishby, 2017; Alemi et al., 2017) and usage in generative modelling (Chen et al., 2016; Hjelm et al., 2019).
As a consequence, the estimation of mutual information (Barber & Agakov, 2003; Alemi et al., 2018; Achille &
Soatto, 2018; Belghazi et al., 2018) has attracted growing attention.
The concept of group-wise independence between latent variables goes back to classical independent subspace analysis (Hyv¨arinen & Hoyer, 2000) and received attention in learning unbiased representations, e.g. see the Fair Variational Autoencoder (Louizos et al., 2015).
Furthermore, extended cross-entropy losses via entropy terms (Pereyra et al., 2017) or minimizing predictability of variables (Schmidhuber, 1991) has been introduced for other applications.
Our proposed loss also shows similarity to the GAN loss (Goodfellow et al., 2014).
However, in our case there is no notion of real or fake samples, but exploring similarities in the optimization are a promising avenue for future work.
C ONCLUSION
Failures of deep networks under distribution shift and their difﬁculty in out-of-distribution generalization are prime examples of the limitations in current machine learning models.
The ﬁeld of adversarial example research aims to close this gap from a robustness point of view.
While a lot of work has studied (cid:15) -adversarial examples, recent trends extend the efforts towards the unrestricted case.
However, adversarial examples with no restriction are hard to formalize beyond testing error.
We introduce a reverse view on the problem to: (1) show that a major cause for adversarial vulnerability is excessive invariance to semantically meaningful variations, (2) demonstrate that this issue persists across tasks and architectures; and (3) make the control of invariance tractable via fully-invertible networks.
In summary, we demonstrated how a bijective network architecture enables us to identify large adversarial subspaces on multiple datasets like the adversarial spheres, MNIST and ImageNet.
Afterwards, we formalized the distribution shifts causing such undesirable behavior via information theory.
Using this framework, we ﬁnd one of the major reasons is the insufﬁciency of the vanilla cross-entropy loss to learn semantic representations that capture all task-dependent variations in the input.
We extend the loss function by components that explicitly encourage a split between semantically meaningful and nuisance features.
Finally, we empirically show that this split can remove unwanted invariances by performing a set of targeted invariance-based distribution shift experiments.
A CKNOWLEDGEMENTS
We thank thank the anonymous reviewers, Ricky Chen, Will Grathwohl and Jesse Bettencourt for helpful comments on the manuscript.
We gratefully acknowledge the ﬁnancial support from the
German Science Foundation for the CRC 1233 on ”Robust Vision” and RTG 2224 ” π 3 : Parameter
Identiﬁcation - Analysis, Algorithms, Applications”
A S EMANTIC AND N UISANCE V ARIATION ON A DVERSARIAL S PHERES
Example 7 (Semantic and nuisance on Adversarial Spheres (Gilmer et al., 2018b)) .
Consider classifying inputs x from two classes given by radii R 1 or R 2 .
Further, let ( r, φ ) denote the spherical coordinates of x .
Then, any perturbation ∆ x , x ∗ = x + ∆ x with r ∗ (cid:54) =
r is semantic.
On the other hand, if r ∗ = r the perturbation is a nuisance with respect to the task of discriminating two spheres.
In this example, the max-margin classiﬁer D ( x ) = sign (cid:0) (cid:107) x (cid:107) − R 1 + R 2(cid:1) is invariant to any nuisance perturbation, while being only sensitive to semantic perturbations.
In summary, the transform to spherical coordinates allows to linearize semantic and nuisance perturbations.
Using this notion, invariance-based adversarial examples can be attributed to perturbations of x ∗ = x + ∆ x with following two properties
Perturbed sample x ∗ stays in the pre-image { x ∗ ∈ R d | D ( x ∗ ) =
D ( x ) } of the classiﬁer 2.
Perturbation ∆ x is semantic, as o ( x ) (cid:54) =
o ( x + ∆ x ) .
Thus, the failure of the classiﬁer D can be thought of a mis-alignment between its invariance (expressed through the pre-image) and the semantics of the data and task (expressed by the oracle).
Example 8 (Mis-aligned classiﬁer on Adversarial Spheres) .
Consider the classiﬁer
[Equation]
which computes the norm of x from its ﬁrst d − 1 cartesian-coordinates
Then, D is invariant to a semantic perturbation with ∆ r =
[Table]
We empirically evaluate the classiﬁer in equation 7 on the spheres problem (10M/2M samples setting (Gilmer et al., 2018b)) and validate that it can reach perfect classiﬁcation accuracy.
However, by construction, perturbing the invariant dimension x ∗ d = x d + ∆ x d allows us to move all samples from the inner sphere to the outer sphere.
Thus, the accuracy of the classiﬁer drops to chance level when evaluating its performance under such a distributional shift.
To conclude, this underlines how classiﬁers with optimal performance on ﬁnite samples can exhibit non-intuitive failure modes due to excessive invariance with respect to semantic variations.
B A PPROXIMATE G RADIENT - BASED M ETAMERIC S AMPLES
We use a standard Imagenet pre-trained Resnet-154 as provided by the torchvision package (Paszke et al., 2017) and choose a logit percept y
=
G ( x ) that can be based on any seed image.
Then we optimize various images ˜ x to be metameric to x by simply minimizing a mean squared error loss of the form:
[Equation]
in the 1000-dimensional semantic logit space via stochastic gradient descent.
We optimize with
Adam in Pytorch default settings and a learning rate of 0.01 for 3000 iterations.
The optimization thus takes the form of an adversarial attack targeting all logit entries and with no norm restriction on the input distance.
Note that our metameric sampling attack in bijective networks is the analytic reverse equivalent of this attack.
It leads to the exact solution at the cost of one inverse pass instead of an approximate solution here at the cost of thousands of gradient steps.
C I NFORMATION T HEORY
Computing mutual information is often intractable as it requires the joint probability p ( x, y ) , see (Cover & Thomas, 2006) for an extensive treatment of information theory.
However, following variational lower bound can be used for approximation, see (Barber & Agakov, 2003).
Lemma 9 (Variational lower bound on mutual information) .
Let X, Y be random variables with conditional density p ( y | x ) .
Further, let q θ ( y | x ) be a variational density depending on parameter θ .
Then, the lower bound
[Equation]
holds with equality if p ( y | x ) =
q θ ( y | x ) .
While above lower bound removes the need for the computation of p ( y | x ) , estimating the expectation E Y | X still requires sampling from it.
Using this bound, we can now state the effect of the nuisance classiﬁation loss.
Lemma 10 (Effect of nuisance classiﬁer) .
Deﬁne semantics as z s = F θ ( x ) 1 ,...,C and nuisances as z n = F θ ( x ) C +1 ,...,d , where ( x, y ) ∼ D .
Then, the nuisance classiﬁcation loss yields
(i) Minimization of lower bound on I D ( y ; z n ) :
θ ∗ =
arg min θ L nCE ( θ, θ ∗ nc ) minimizes I θ ∗ nc ( y ; z n ) , where I θ ∗ nc ( y ; z n ) ≤ I D ( y ; z n ) and θ ∗ nc = arg max θ 2 L nCE ( θ, θ nc ) .
(ii) Maximization to tighten bound on I D ( y ; z n ) : Under a perfect model of the conditional density, D θ ∗ nc ( z n ) =
p ( y | z n ) , it holds I θ ∗ nc ( y ; z n ) =
I D ( y ; z n ) .
Proof.
To proof above result, we need to draw the connection to the variational lower bound on mutual information from Lemma 9.
Let the nuisance classiﬁer D θ nc ( z n ) model the variational posterior q θ nc ( y | z n ) .
Then we have the lower bound
[Equation]
From Lemma 9 follows, that if D θ nc ( z n )
=
p ( y | z n ) , it holds I ( y ; z n ) =
I θ nc ( y ; z n ) .
Hence, the nuisance classiﬁer needs to model the conditional density perfectly.
Estimating this bound via Monte Carlo simulation requires sampling from the conditional density p ( y | z n ) .
Following (Alemi et al., 2017), we have the Markov property y ↔ x ↔ z n as labels y interact with inputs x and representation z n interacts with inputs x .
Hence,
[Equation]
Including above and assuming F θ ( x ) =
z n to be a deterministic function, we have
[Equation]
Lemma 11 (Effect of MLE-term) .
Deﬁne semantics as z s = F θ ( x ) 1 ,...,C and nuisances as z n =
F θ ( x ) C +1 ,...,d , where ( x, y ) ∼ D .
Then, the MLE-term in equation 6 together with cross-entropy on the semantics
[Equation]
minimizes the mutual information
I ( z s ; z n ) .
Proof.
Let ˜ z s = softmax ( z s ) .
Then minimizing the loss terms L sCE and L MLE n is a maximum likelihood estimation under the factorial prior
[Equation]
where Cat is a categorical distribution.
As softmax is shift-invariant, softmax ( x + c ) = softmax ( x ) , above factorial prior for ˜ z
s and z n yields independence between logits z s and z n up to a constant c .
Finally note, the log term and summation in L MLE n and L CE is re-formulation for computational ease but does not change its minimizer as the logarithm is monotone.
C. P ROOF OF T HEOREM
From the assumptions follows I D Adv ( y ; z n )
= 0 .
Furthermore
[Equation]
where the ﬁrst equality follows from the symmetry of mutual information and the last from the properties of conditional mutual information under independence I D Adv ( y ; z n )
= 0 .
By the chain rule of mutual information (Cover & Thomas, 2006) and information preservation under homeomorphisms (Kraskov et al., 2004), we have
[Equation]
C. M UTUAL INFORMATION BOUNDED
Remark 12.
Since our goal is to maximize the mutual information I ( y ; z s ) while minimizing
I ( y ; z n ) , we need to ensure that this objective is well deﬁned as mutual information can be unbounded from above for continuous random variables.
However, due to the data processing inequality (Cover & Thomas, 2006) we have I ( y ; z n ) =
I ( y ; F θ ( x )) ≤ I ( y ; x ) .
Hence, we have a ﬁxed upper bound given by our data ( x, y ) .
Compared to (Belghazi et al., 2018)
there is thus no need for gradient clipping or a switch to the bounded Jensen-Shannon divergence as in (Hjelm et al., 2019) is not necessary.
D T RAINING AND A RCHITECTURAL D ETAILS
All experiments were based on a fully invertible RevNet model with different hyperparameters for each dataset.
For the spheres experiment we used Pytorch (Paszke et al., 2017) and for MNIST, as well as Imagenet Tensorﬂow
(Abadi et al., 2016).
D. S PHERES EXPERIMENTS
The network is a fully connected fully invertible RevNet.
It has 4 RevNet-type ReLU bottleneck blocks with additive couplings and uses no batchnorm.
We train it via cross-entropy and use the
Adam optimizer (Kingma & Ba, 2014) with a learning rate of 0.0001 and otherwise default Pytorch settings.
The nuisance classiﬁer is a 3 layer ReLU network with 1000 hidden units per layer.
We choose the spheres to be 100-dimensional, with R 1 = 1 and R 2 = 10 , train on 500k samples for 10 epochs and then validate on another 100k holdout set.
We achieve 100% train and validation accuracy for logit and nuisance classiﬁer.
D. MNIST EXPERIMENTS
We use a convolutional fully invertible RevNet with additional actnorm and invertible 1x1 convolutions between each layer as introduced in Kingma & Dhariwal (2018).
The network has 3 stages, after which half of the variables are factored out and an invertible downsampling, or squeezing (Dinh et al., 2017; Jacobsen et al., 2018) is applied.
The network has 16 RevNet blocks with batch norm per stage and 128 ﬁlters per layer.
We also dequantize the inputs as is typically done in ﬂow-based generative models.
The network is trained via Adamax (Kingma & Ba, 2014) with a base learning rate of 0.001 forepochs and we multiply the it with a factor of 0.2 every 30 epochs and use a batch size of 64 and l2 weight decay of 1e-4.
For training we compare vanilla cross-entropy training with our proposed independence cross-entropy loss.
To have a more balanced loss signal, we normalize L nCE by the number of input dimensions it receives for the maximization step.
The nuisance classiﬁer is a fullyconnected 3 layer ReLU network with 512 units.
As data-augmentation we use random shifts ofpixels.
For classiﬁcation errors of the different architectures we compare, see Table 2.
D. I MAGE N ET EXPERIMENTS
We use a convolutional fully invertible RevNet with 4 stages, 4 RevNet blocks per stage and invertible downsampling after each stage, as well as two invertible downsamplings on the input of the network.
The ﬁrst three stages consist of additive and the last of afﬁne coupling layers.
After the ﬁnal layer we apply an orthogonal 2D DCT type-II to all feature maps and read out the classes in the low-pass components of the transformation.
This effectively gives us an invertible global average pooling and makes our network even more similar to ResNets, that always apply global average pooling on their ﬁnal feature maps.
We train the network with momentum SGD for 128 epochs, a
MNIST
SOTA
LeNet
[Table]
batch size of 480 (distributed to 6 GPUs), a base learning rate of 0.1, which is reduced by a factor of 0.1 every 32 epochs.
We apply momentum of 0.9 and l2 weight decay of 1e-4.