diff --git "a/parse/train/rkZvSe-RZ/rkZvSe-RZ_content_list.json" "b/parse/train/rkZvSe-RZ/rkZvSe-RZ_content_list.json" new file mode 100644--- /dev/null +++ "b/parse/train/rkZvSe-RZ/rkZvSe-RZ_content_list.json" @@ -0,0 +1,2610 @@ +[ + { + "type": "text", + "text": "ENSEMBLE ADVERSARIAL TRAINING: ATTACKS AND DEFENSES ", + "text_level": 1, + "bbox": [ + 174, + 99, + 633, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Florian Tramer\\` \nStanford University \ntramer@cs.stanford.edu \nAlexey Kurakin \nGoogle Brain \nkurakin@google.com ", + "bbox": [ + 183, + 170, + 400, + 212 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 424, + 171, + 604, + 212 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Nicolas Papernot∗ Pennsylvania State University ngp5056@cse.psu.edu ", + "bbox": [ + 629, + 170, + 826, + 213 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Ian Goodfellow \nGoogle Brain \ngoodfellow@google.com ", + "bbox": [ + 183, + 234, + 392, + 276 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Dan Boneh Stanford University dabo@cs.stanford.edu ", + "bbox": [ + 410, + 234, + 606, + 275 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Patrick McDaniel Pennsylvania State University mcdaniel@cse.psu.edu ", + "bbox": [ + 625, + 234, + 825, + 275 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 313, + 544, + 327 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Adversarial examples are perturbed inputs designed to fool machine learning models. Adversarial training injects such examples into training data to increase robustness. To scale this technique to large datasets, perturbations are crafted using fast single-step methods that maximize a linear approximation of the model’s loss. ", + "bbox": [ + 232, + 344, + 764, + 400 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We show that this form of adversarial training converges to a degenerate global minimum, wherein small curvature artifacts near the data points obfuscate a linear approximation of the loss. The model thus learns to generate weak perturbations, rather than defend against strong ones. As a result, we find that adversarial training remains vulnerable to black-box attacks, where we transfer perturbations computed on undefended models, as well as to a powerful novel single-step attack that escapes the non-smooth vicinity of the input data via a small random step. ", + "bbox": [ + 233, + 404, + 764, + 500 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We further introduce Ensemble Adversarial Training, a technique that augments training data with perturbations transferred from other models. On ImageNet, Ensemble Adversarial Training yields models with strong robustness to black-box attacks. In particular, our most robust model won the first round of the NIPS 2017 competition on Defenses against Adversarial Attacks (Kurakin et al., 2017c). ", + "bbox": [ + 233, + 502, + 766, + 571 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 602, + 336, + 617 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Machine learning (ML) models are often vulnerable to adversarial examples, maliciously perturbed inputs designed to mislead a model at test time (Biggio et al., 2013; Szegedy et al., 2013; Goodfellow et al., 2014b; Papernot et al., 2016a). Furthermore, Szegedy et al. (2013) showed that these inputs transfer across models: the same adversarial example is often misclassified by different models, thus enabling simple black-box attacks on deployed models (Papernot et al., 2017; Liu et al., 2017). ", + "bbox": [ + 174, + 633, + 825, + 704 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Adversarial training (Szegedy et al., 2013) increases robustness by augmenting training data with adversarial examples. Madry et al. (2017) showed that adversarially trained models can be made robust to white-box attacks (i.e., with knowledge of the model parameters) if the perturbations computed during training closely maximize the model’s loss. However, prior attempts at scaling this approach to ImageNet-scale tasks (Deng et al., 2009) have proven unsuccessful (Kurakin et al., 2017b). ", + "bbox": [ + 174, + 710, + 825, + 794 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "It is thus natural to ask whether it is possible, at scale, to achieve robustness against the class of black-box adversaries Towards this goal, Kurakin et al. (2017b) adversarially trained an Inception v3 model (Szegedy et al., 2016b) on ImageNet using a “single-step” attack based on a linearization of the model’s loss (Goodfellow et al., 2014b). Their trained model is robust to single-step perturbations but remains vulnerable to more costly “multi-step” attacks. Yet, Kurakin et al. (2017b) found that these attacks fail to reliably transfer between models, and thus concluded that the robustness of their model should extend to black-box adversaries. Surprisingly, we show that this is not the case. ", + "bbox": [ + 174, + 801, + 825, + 898 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We demonstrate, formally and empirically, that adversarial training with single-step methods admits a degenerate global minimum, wherein the model’s loss can not be reliably approximated by a linear function. Specifically, we find that the model’s decision surface exhibits sharp curvature near the data points, thus degrading attacks based on a single gradient computation. In addition to the model of Kurakin et al. (2017b), we reveal similar overfitting in an adversarially trained Inception ResNet v2 model (Szegedy et al., 2016a), and a variety of models trained on MNIST (LeCun et al., 1998). ", + "bbox": [ + 174, + 103, + 823, + 186 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We harness this result in two ways. First, we show that adversarially trained models using single-step methods remain vulnerable to simple attacks. For black-box adversaries, we find that perturbations crafted on an undefended model often transfer to an adversarially trained one. We also introduce a simple yet powerful single-step attack that applies a small random perturbation—to escape the nonsmooth vicinity of the data point—before linearizing the model’s loss. While seemingly weaker than the Fast Gradient Sign Method of Goodfellow et al. (2014b), our attack significantly outperforms it for a same perturbation norm, for models trained with or without adversarial training. ", + "bbox": [ + 174, + 194, + 825, + 291 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Second, we propose Ensemble Adversarial Training, a training methodology that incorporates perturbed inputs transferred from other pre-trained models. Our approach decouples adversarial example generation from the parameters of the trained model, and increases the diversity of perturbations seen during training. We train Inception v3 and Inception ResNet v2 models on ImageNet that exhibit increased robustness to adversarial examples transferred from other holdout models, using various single-step and multi-step attacks (Goodfellow et al., 2014b; Carlini & Wagner, 2017a; Kurakin et al., 2017a; Madry et al., 2017). We also show that our methods globally reduce the dimensionality of the space of adversarial examples (Tramer et al., 2017). Our Inception ResNet v2 model won the \\` first round of the NIPS 2017 competition on Defenses Against Adversarial Attacks (Kurakin et al., 2017c), where it was evaluated on other competitors’ attacks in a black-box setting. ", + "bbox": [ + 174, + 297, + 823, + 440 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 463, + 344, + 479 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Various defensive techniques against adversarial examples in deep neural networks have been proposed (Gu & Rigazio, 2014; Luo et al., 2015; Papernot et al., 2016c; Nayebi & Ganguli, 2017; Cisse et al., 2017) and many remain vulnerable to adaptive attackers (Carlini & Wagner, 2017a;b; Baluja & Fischer, 2017). Adversarial training (Szegedy et al., 2013; Goodfellow et al., 2014b; Kurakin et al., 2017b; Madry et al., 2017) appears to hold the greatest promise for learning robust models. ", + "bbox": [ + 174, + 497, + 825, + 568 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Madry et al. (2017) show that adversarial training on MNIST yields models that are robust to whitebox attacks, if the adversarial examples used in training closely maximize the model’s loss. Moreover, recent works by Sinha et al. (2018), Raghunathan et al. (2018) and Kolter & Wong (2017) even succeed in providing certifiable robustness for small perturbations on MNIST. As we argue in Appendix C, the MNIST dataset is peculiar in that there exists a simple “closed-form” denoising procedure (namely feature binarization) which leads to similarly robust models without adversarial training. This may explain why robustness to white-box attacks is hard to scale to tasks such as ImageNet (Kurakin et al., 2017b). We believe that the existence of a simple robust baseline for MNIST can be useful for understanding some limitations of adversarial training techniques. ", + "bbox": [ + 173, + 574, + 825, + 699 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Szegedy et al. (2013) found that adversarial examples transfer between models, thus enabling blackbox attacks on deployed models. Papernot et al. (2017) showed that black-box attacks could succeed with no access to training data, by exploiting the target model’s predictions to extract (Tramer et al., \\` 2016) a surrogate model. Some prior works have hinted that adversarially trained models may remain vulnerable to black-box attacks: Goodfellow et al. (2014b) found that an adversarial maxout network on MNIST has slightly higher error on transferred examples than on white-box examples. Papernot et al. (2017) further showed that a model trained on small perturbations can be evaded by transferring perturbations of larger magnitude. Our finding that adversarial training degrades the accuracy of linear approximations of the model’s loss is as an instance of a gradient-masking phenomenon (Papernot et al., 2016b), which affects other defensive techniques (Papernot et al., 2016c; Carlini & Wagner, 2017a; Nayebi & Ganguli, 2017; Brendel & Bethge, 2017; Athalye et al., 2018). ", + "bbox": [ + 174, + 705, + 825, + 872 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "3 THE ADVERSARIAL TRAINING FRAMEWORK ", + "text_level": 1, + "bbox": [ + 173, + 102, + 578, + 118 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We consider a classification task with data $x \\in [ 0 , 1 ] ^ { d }$ and labels $y _ { \\mathrm { t r u e } } \\in \\mathbb { Z } _ { k }$ sampled from a distribution $\\mathcal { D }$ . We identify a model with an hypothesis $h$ from a space $\\mathcal { H }$ . On input $x$ , the model outputs class scores $h ( x ) \\in \\mathbb { R } ^ { k }$ . The loss function used to train the model, e.g., cross-entropy, is $L ( h ( x ) , y )$ . ", + "bbox": [ + 174, + 131, + 825, + 179 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1 THREAT MODEL ", + "text_level": 1, + "bbox": [ + 174, + 194, + 328, + 209 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "For some target model $h \\in \\mathcal H$ and inputs $( x , y _ { \\mathrm { t r u e } } )$ the adversary’s goal is to find an adversarial example $x ^ { \\mathrm { a d v } }$ such that $x ^ { \\mathrm { a d v } }$ and $x$ are “close” yet the model misclassifies $x ^ { \\mathrm { a d v } }$ . We consider the wellstudied class of $\\ell _ { \\infty }$ bounded adversaries (Goodfellow et al., 2014b; Madry et al., 2017) that, given some budget $\\epsilon$ , output examples $x ^ { \\mathrm { a d v } }$ where $\\| x ^ { \\mathrm { a d v } } - x \\| _ { \\infty } \\leq \\epsilon .$ . As we comment in Appendix C.1, $\\ell _ { \\infty }$ robustness is of course not an end-goal for secure ML. We use this standard model to showcase limitations of prior adversarial training methods, and evaluate our proposed improvements. ", + "bbox": [ + 173, + 219, + 825, + 310 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We distinguish between white-box adversaries that have access to the target model’s parameters (i.e., $h _ { . }$ ), and black-box adversaries with only partial information about the model’s inner workings. Formal definitions for these adversaries are in Appendix A. Although security against white-box attacks is the stronger notion (and the one we ideally want ML models to achieve), black-box security is a reasonable and more tractable goal for deployed ML models. ", + "bbox": [ + 174, + 315, + 823, + 387 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.2 ADVERSARIAL TRAINING ", + "text_level": 1, + "bbox": [ + 174, + 402, + 393, + 417 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Following Madry et al. (2017), we consider an adversarial variant of standard Empirical Risk Minimization (ERM), where our aim is to minimize the risk over adversarial examples: ", + "bbox": [ + 171, + 429, + 821, + 458 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/bb598728c43a71396f18ddba779ad2fedec19442160579402efc68a250b7ebb2.jpg", + "text": "$$\n\\begin{array} { r l } { h ^ { * } = \\underset { h \\in \\mathcal { H } } { \\arg \\operatorname* { m i n } } } & { \\underset { ( x , y _ { \\mathrm { t u e } } ) \\sim \\mathcal { D } } { \\mathbb { E } } \\left[ \\underset { \\| x ^ { \\mathrm { a d v } } - x \\| _ { \\infty } \\leq \\epsilon } { \\operatorname* { m a x } } L ( h ( x ^ { \\mathrm { a d v } } ) , y _ { \\mathrm { t r u e } } ) \\right] . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 302, + 463, + 696, + 496 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Madry et al. (2017) argue that adversarial training has a natural interpretation in this context, where a given attack (see below) is used to approximate solutions to the inner maximization problem, and the outer minimization problem corresponds to training over these examples. Note that the original formulation of adversarial training (Szegedy et al., 2013; Goodfellow et al., 2014b), which we use in our experiments, trains on both the “clean” examples x and adversarial examples xadv. ", + "bbox": [ + 174, + 502, + 825, + 575 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We consider three algorithms to generate adversarial examples with bounded $\\ell _ { \\infty }$ norm. The first two are single-step (i.e., they require a single gradient computation); the third is iterative—it computes multiple gradient updates. We enforce $x ^ { \\mathrm { a d v } } \\in [ 0 , 1 ] ^ { d }$ by clipping all components of $x ^ { \\mathrm { a d v } }$ . ", + "bbox": [ + 174, + 580, + 825, + 627 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Fast Gradient Sign Method (FGSM). This method (Goodfellow et al., 2014b) linearizes the inner maximization problem in (1): ", + "bbox": [ + 173, + 632, + 823, + 661 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/c985f58e7b152bf6835de024c641b20075bd33f15d6b58c10d550c3be6c5e20d.jpg", + "text": "$$\nx _ { \\mathrm { F G S M } } ^ { \\mathrm { a d v } } : = x + \\varepsilon \\cdot \\mathrm { s i g n } \\left( \\nabla _ { x } L ( h ( x ) , y _ { \\mathrm { t r u e } } ) \\right) \\ .\n$$", + "text_format": "latex", + "bbox": [ + 352, + 667, + 643, + 688 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Single-Step Least-Likely Class Method (Step-LL). This variant of FGSM introduced by Kurakin et al. (2017a;b) targets the least-likely class, $y _ { \\mathrm { L L } } = \\arg \\operatorname* { m i n } \\{ h ( x ) \\}$ : ", + "bbox": [ + 173, + 699, + 826, + 729 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/78115ccdc8738100b4286bfb16132885a2adce33cb9d8c6acf798bc0c8604d96.jpg", + "text": "$$\nx _ { \\mathrm { L L } } ^ { \\mathrm { a d v } } : = x - \\varepsilon \\cdot \\mathrm { s i g n } \\left( \\nabla _ { x } L ( h ( x ) , y _ { \\mathrm { L L } } ) \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 362, + 736, + 633, + 756 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Although this attack only indirectly tackles the inner maximization in (1), Kurakin et al. (2017b) find it to be the most effective for adversarial training on ImageNet. ", + "bbox": [ + 173, + 761, + 825, + 790 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Iterative Attack (I-FGSM or Iter-LL). This method iteratively applies the FGSM or Step-LL $k$ times with step-size $\\alpha \\geq \\epsilon / k$ and projects each step onto the $\\ell _ { \\infty }$ ball of norm $\\epsilon$ around $x$ . It uses projected gradient descent to solve the maximization in (1). For fixed $\\epsilon$ , iterative attacks induce higher error rates than single-step attacks, but transfer at lower rates (Kurakin et al., 2017a;b). ", + "bbox": [ + 174, + 796, + 825, + 853 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.3 A DEGENERATE GLOBAL MINIMUM FOR SINGLE-STEP ADVERSARIAL TRAINING", + "text_level": 1, + "bbox": [ + 173, + 868, + 777, + 883 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "When performing adversarial training with a single-step attack (e.g., the FGSM or Step-LL methods above), we approximate Equation (1) by replacing the solution to the inner maximization problem ", + "bbox": [ + 173, + 895, + 820, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "in with the output of the single-step attack (e.g., $x _ { \\mathrm { F G S M } } ^ { \\mathrm { a d v } }$ in (2)). That is, we solve ", + "bbox": [ + 173, + 102, + 699, + 119 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/4820e53bab307eb015554db789d1a935d2dd34d2e5e80b5fc3db9786195099bd.jpg", + "text": "$$\nh ^ { * } = \\underset { h \\in \\mathcal { H } } { \\arg \\operatorname* { m i n } } \\quad \\underset { ( x , y _ { \\mathrm { t u c } } ) \\sim \\mathcal { D } } { \\mathbb { E } } \\left[ L \\big ( h ( x _ { \\mathrm { F G S M } } ^ { \\mathrm { a d v } } ) , y _ { \\mathrm { t r u e } } \\big ) \\right] .\n$$", + "text_format": "latex", + "bbox": [ + 336, + 121, + 660, + 151 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "For model families $\\mathcal { H }$ with high expressive power, this alternative optimization problem admits at least two substantially different global minima $h ^ { * }$ : ", + "bbox": [ + 171, + 154, + 823, + 183 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "• For an input $x$ from $\\mathcal { D }$ , there is no $x ^ { \\mathrm { a d v } }$ close to $x$ (in $\\ell _ { \\infty }$ norm) that induces a high loss. That is, ", + "bbox": [ + 173, + 194, + 813, + 210 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/164425822e9912f819ca2d3e3b69e9e9185ac2681b7dd7636c65d3b1f8703f55.jpg", + "text": "$$\nL ( h ^ { * } ( x _ { \\mathrm { F G S M } } ^ { \\mathrm { a d v } } ) , y _ { \\mathrm { t r u e } } ) \\approx \\operatorname* { m a x } _ { \\| x ^ { \\mathrm { a d v } } - x \\| _ { \\infty } \\leq \\epsilon } L ( h ^ { * } ( x ^ { \\mathrm { a d v } } ) , y _ { \\mathrm { t r u e } } ) ] \\approx 0 .\n$$", + "text_format": "latex", + "bbox": [ + 308, + 214, + 700, + 243 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In other words, $h ^ { * }$ is robust to all $\\ell _ { \\infty }$ bounded perturbations. ", + "bbox": [ + 183, + 247, + 583, + 262 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "• The minimizer $h ^ { * }$ is a model for which the approximation method underlying the attack (i.e., linearization in our case) poorly fits the model’s loss function. That is, ", + "bbox": [ + 173, + 266, + 823, + 295 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/439ee11b1fc08260022f56149735ad065009d2f1d712f0090738556183705254.jpg", + "text": "$$\nL ( h ^ { * } ( x _ { \\mathrm { F G S M } } ^ { \\mathrm { a d v } } ) , y _ { \\mathrm { t r u e } } ) \\ll \\operatorname* { m a x } _ { \\| x ^ { \\mathrm { a d v } } - x \\| _ { \\infty } \\le \\epsilon } L ( h ^ { * } ( x ^ { \\mathrm { a d v } } ) , y _ { \\mathrm { t r u e } } ) ] .\n$$", + "text_format": "latex", + "bbox": [ + 321, + 297, + 687, + 327 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Thus the attack when applied to $h ^ { * }$ produces samples $x ^ { \\mathrm { a d v } }$ that are far from optimal. ", + "bbox": [ + 187, + 332, + 735, + 348 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Note that this second “degenerate” minimum can be more subtle than a simple case of overfitting to samples produced from single-step attacks. Indeed, we show in Section 4.1 that single-step attacks applied to adversarially trained models create “adversarial” examples that are easy to classify even for undefended models. Thus, adversarial training does not simply learn to resist the particular attack used during training, but actually to make that attack perform worse overall. This phenomenon relates to the notion of Reward Hacking (Amodei et al., 2016) wherein an agent maximizes its formal objective function via unintended behavior that fails to captures the designer’s true intent. ", + "bbox": [ + 173, + 359, + 825, + 457 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.4 ENSEMBLE ADVERSARIAL TRAINING ", + "text_level": 1, + "bbox": [ + 176, + 473, + 473, + 487 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The degenerate minimum described in Section 3.3 is attainable because the learned model’s parameters influence the quality of both the minimization and maximization in (1). One solution is to use a stronger adversarial example generation process, at a high performance cost (Madry et al., 2017). Alternatively, Baluja & Fischer (2017) suggest training an adversarial generator model as in the GAN framework (Goodfellow et al., 2014a). The power of this generator is likely to require careful tuning, to avoid similar degenerate minima (where the generator or classifier overpowers the other). ", + "bbox": [ + 173, + 498, + 825, + 583 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We propose a conceptually simpler approach to decouple the generation of adversarial examples from the model being trained, while simultaneously drawing an explicit connection with robustness to black-box adversaries. Our method, which we call Ensemble Adversarial Training, augments a model’s training data with adversarial examples crafted on other static pre-trained models. Intuitively, as adversarial examples transfer between models, perturbations crafted on an external model are good approximations for the maximization problem in (1). Moreover, the learned model can not influence the “strength” of these adversarial examples. As a result, minimizing the training loss implies increased robustness to black-box attacks from some set of models. ", + "bbox": [ + 173, + 589, + 825, + 700 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Domain Adaptation with multiple sources. We can draw a connection between Ensemble Adversarial Training and multiple-source Domain Adaptation (Mansour et al., 2009; Zhang et al., 2012). In Domain Adaptation, a model trained on data sampled from one or more source distributions $\\boldsymbol { S } _ { 1 } , \\ldots , \\boldsymbol { S } _ { k }$ is evaluated on samples $x$ from a different target distribution $\\tau$ . ", + "bbox": [ + 173, + 715, + 825, + 772 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Let $A _ { i }$ be an adversarial distribution obtained by sampling $( x , y _ { \\mathrm { t r u e } } )$ from $\\mathcal { D }$ , computing an adversarial example $x ^ { \\mathrm { a d v } }$ for some model such that $\\| x ^ { \\mathrm { a d v } } - x \\| _ { \\infty } \\leq \\epsilon$ , and outputting $( x ^ { \\mathrm { a d v } } , y _ { \\mathrm { t r u e } } )$ . In Ensemble Adversarial Training, the source distributions are $\\mathcal { D }$ (the clean data) and $\\mathcal { A } _ { 1 } , \\ldots , \\mathcal { A } _ { k }$ (the attacks overs the currently trained model and the static pre-trained models). The target distribution takes the form of an unseen black-box adversary $\\mathcal { A } ^ { * }$ . Standard generalization bounds for Domain Adaptation (Mansour et al., 2009; Zhang et al., 2012) yield the following result. ", + "bbox": [ + 173, + 777, + 825, + 864 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Theorem 1 (informal). Let $h ^ { \\ast } \\in \\mathcal { H }$ be a model learned with Ensemble Adversarial Training and static black-box adversaries $\\mathcal { A } _ { 1 } , \\ldots , \\mathcal { A } _ { k }$ . Then, if $h ^ { * }$ is robust against the black-box adversaries $\\mathcal { A } _ { 1 } , \\ldots \\mathcal { A } _ { k }$ used at training time, then $h ^ { * }$ has bounded error on attacks from a future black-box adversary $\\mathcal { A } ^ { * }$ , if $\\mathcal { A } ^ { * }$ is not “much stronger”, on average, than the static adversaries $\\mathcal { A } _ { 1 } , \\ldots , \\mathcal { A } _ { k }$ . ", + "bbox": [ + 174, + 867, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/364615ab0fa795bce9de81e64d675fc54bea01c98991140721a6039e35625055.jpg", + "image_caption": [ + "Figure 1: Gradient masking in single-step adversarial training. We plot the loss of model ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ on points $x ^ { * } = x + \\epsilon _ { 1 } \\cdot g + \\epsilon _ { 2 } \\cdot g ^ { \\perp }$ , where $g$ is the signed gradient and $g ^ { \\perp }$ is an orthogonal adversarial direction. Plot (b) is a zoom of (a) near $x$ . The gradient poorly approximates the global loss. " + ], + "image_footnote": [], + "bbox": [ + 192, + 112, + 764, + 290 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We give a formal statement of this result and of the assumptions on $\\mathcal { A } ^ { * }$ in Appendix B. Of course, ideally we would like guarantees against arbitrary future adversaries. For very low-dimensional tasks (e.g., MNIST), stronger guarantees are within reach for specific classes of adversaries (e.g., $\\ell _ { \\infty }$ bounded perturbations (Madry et al., 2017; Sinha et al., 2018; Raghunathan et al., 2018; Kolter & Wong, 2017)), yet they also fail to extend to other adversaries not considered at training time (see Appendix C.1 for a discussion). For ImageNet-scale tasks, stronger formal guarantees appear out of reach, and we thus resort to an experimental assessment of the robustness of Ensemble Adversarially Trained models to various non-interactive black-box adversaries in Section 4.2. ", + "bbox": [ + 174, + 359, + 825, + 472 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 494, + 326, + 510 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We show the existence of a degenerate minimum, as described in Section 3.3, for the adversarially trained Inception v3 model of Kurakin et al. (2017b). Their model (denoted ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } , }$ ) was trained on a Step-LL attack with $\\epsilon \\leq 1 6 / 2 5 6$ . We also adversarially train an Inception ResNet v2 model (Szegedy et al., 2016a) using the same setup. We denote this model by $\\mathrm { I R v } 2 _ { \\mathrm { a d v } }$ . We refer the reader to (Kurakin et al., 2017b) for details on the adversarial training procedure. ", + "bbox": [ + 174, + 526, + 823, + 597 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We first measure the approximation-ratio of the Step-LL attack for the inner maximization in (1). As we do not know the true maximum, we lower-bound it using an iterative attack. For 1,000 random test points, we find that for a standard Inception v3 model, step-LL gets within $1 9 \\%$ of the optimum loss on average. This attack is thus a good candidate for adversarial training. Yet, for the ${ \\bf V } { \\boldsymbol 3 } _ { \\mathrm { a d v } }$ model, the approximation ratio drops to $7 \\%$ , confirming that the learned model is less amenable to linearization. We obtain similar results for Inception ResNet v2 models. The ratio is $1 7 \\%$ for a standard model, and $8 \\%$ for $\\mathrm { I R v } 2 _ { \\mathrm { a d v } }$ . Similarly, we look at the cosine similarity between the perturbations given by a single-step and multi-step attack. The more linear the model, the more similar we expect both perturbations to be. The average similarity drops from 0.13 for Inception v3 to 0.02 for ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ . This effect is not due to the decision surface of ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ being “too flat” near the data points: the average gradient norm is larger for ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ (0.17) than for the standard v3 model (0.10). ", + "bbox": [ + 174, + 603, + 825, + 757 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We visualize this “gradient-masking” effect (Papernot et al., 2016b) by plotting the loss of ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ on examples $x ^ { * } = \\bar { x } + \\epsilon _ { 1 } \\cdot g + \\epsilon _ { 2 } \\cdot \\bar { g } ^ { ^ { \\perp } }$ , where $g$ is the signed gradient of model ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ and $g ^ { \\bot }$ is a signed vector orthogonal to $g$ . Looking forward to Section 4.1, we actually chose $g ^ { \\bot }$ to be the signed gradient of another Inception model, from which adversarial examples transfer to ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ . Figure 1 shows that the loss is highly curved in the vicinity of the data point $x$ , and that the gradient poorly reflects the global loss landscape. Similar plots for additional data points are in Figure 4. ", + "bbox": [ + 174, + 762, + 825, + 847 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We show similar results for adversarially trained MNIST models in Appendix C.2. On this task, input dropout (Srivastava et al., 2014) mitigates adversarial training’s overfitting problem, in some cases. Presumably, the random input mask diversifies the perturbations seen during training (dropout at intermediate layers does not mitigate the overfitting effect). Mishkin et al. (2017) find that input dropout significantly degrades accuracy on ImageNet, so we did not include it in our experiments. ", + "bbox": [ + 174, + 853, + 823, + 924 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/1b1fa59a7577da053103ef3f9ef7acd16398a3462e7c9d1797e142dd6889b76b.jpg", + "table_caption": [ + "Table 1: Error rates $( \\mathbf { i n \\% } )$ of adversarial examples transferred between models. We use StepLL with $\\epsilon = { ^ { 1 6 } } / { 2 5 6 }$ for 10,000 random test inputs. Diagonal elements represent a white-box attack. The best attack for each target appears in bold. Similar results for MNIST models appear in Table 7. " + ], + "table_footnote": [ + "" + ], + "table_body": "
Source
TargetV4v3v3advIRv2IRv2adv
v460.239.231.136.630.9
v343.869.636.442.135.1
v3ady36.335.626.635.235.9
IRv238.038.030.850.731.9
IRv2adv31.030.325.730.621.4
", + "bbox": [ + 173, + 150, + 495, + 256 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/b2d72ba58e3626f5c7f75d14e26c350d203259ef4972300b3acbc3a2a3b22637.jpg", + "table_caption": [], + "table_footnote": [ + "" + ], + "table_body": "
Source
Targetv4v3v3advIRv2IRv2adv
v431.014.910.213.69.9
v318.742.713.017.812.8
v3ady13.613.59.013.014.5
IRv214.114.89.924.010.6
IRv2adv10.310.57.710.458
", + "bbox": [ + 504, + 150, + 826, + 256 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1 ATTACKS AGAINST ADVERSARIALLY TRAINED NETWORKS ", + "text_level": 1, + "bbox": [ + 173, + 292, + 627, + 308 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Kurakin et al. (2017b) found their adversarially trained model to be robust to various single-step attacks. They conclude that this robustness should translate to attacks transferred from other models. As we have shown, the robustness to single-step attacks is actually misleading, as the model has learned to degrade the information contained in the model’s gradient. As a consequence, we find that the ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ model is substantially more vulnerable to single-step attacks than Kurakin et al. (2017b) predicted, both in a white-box and black-box setting. The same holds for the $\\mathrm { I R v } 2 _ { \\mathrm { a d v } }$ model. ", + "bbox": [ + 174, + 319, + 825, + 404 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In addition to the ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ and $\\mathrm { I R v } 2 _ { \\mathrm { a d v } }$ models, we consider standard Inception v3, Inception v4 and Inception ResNet v2 models. These models are available in the TensorFlow-Slim library (Abadi et al., 2015). We describe similar results for a variety of models trained on MNIST in Appendix C.2. ", + "bbox": [ + 174, + 410, + 825, + 452 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Black-box attacks. Table 1 shows error rates for single-step attacks transferred between models. We compute perturbations on one model (the source) and transfer them to all others (the targets). When the source and target are the same, the attack is white-box. Adversarial training greatly increases robustness to white-box single-step attacks, but incurs a higher error rate in a black-box setting. Thus, the robustness gain observed when evaluating defended models in isolation is misleading. Given the ubiquity of this pitfall among proposed defenses against adversarial examples (Carlini & Wagner, $2 0 1 7 \\mathrm { a }$ ; Brendel & Bethge, 2017; Papernot et al., 2016b), we advise researchers to always consider both white-box and black-box adversaries when evaluating defensive strategies. Notably, a similar discrepancy between white-box and black-box attacks was recently observed in Buckman et al. (2018). ", + "bbox": [ + 173, + 460, + 825, + 599 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Attacks crafted on adversarial models are found to be weaker even against undefended models (i.e., when using ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ or $\\mathrm { I R v } 2 _ { \\mathrm { a d v } }$ as source, the attack transfers with lower probability). This confirms our intuition from Section 3.3: adversarial training does not just overfit to perturbations that affect standard models, but actively degrades the linear approximation underlying the single-step attack. ", + "bbox": [ + 174, + 606, + 825, + 662 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "A new randomized single-step attack. The loss function visualization in Figure 1 shows that sharp curvature artifacts localized near the data points can mask the true direction of steepest ascent. We thus suggest to prepend single-step attacks by a small random step, in order to “escape” the non-smooth vicinity of the data point before linearizing the model’s loss. Our new attack, called $\\mathrm { R + F G S M }$ (alternatively, $\\mathrm { R } { + } ,$ Step-LL), is defined as follows, for parameters $\\epsilon$ and $\\alpha$ (where $\\alpha < \\epsilon$ ): ", + "bbox": [ + 174, + 670, + 825, + 741 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/a5a69dd287ac528c510c51f907431e520dfa67fc81620a099cda74fec32341a5.jpg", + "text": "$$\nx ^ { \\mathrm { a d v } } = x ^ { \\prime } + ( \\varepsilon - \\alpha ) \\cdot \\mathsf { s i g n } \\left( \\nabla _ { x ^ { \\prime } } J ( x ^ { \\prime } , y _ { \\mathrm { t r u e } } ) \\right) , \\quad \\mathrm { w h e r e } \\quad x ^ { \\prime } = x + \\alpha \\cdot \\mathsf { s i g n } ( \\mathcal { N } ( \\mathbf { 0 } ^ { d } , \\mathbf { I } ^ { d } ) ) ~ .\n$$", + "text_format": "latex", + "bbox": [ + 192, + 750, + 784, + 770 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Note that the attack requires a single gradient computation. The $\\mathrm { R + F G S M }$ is a computationally efficient alternative to iterative methods that have high success rates in a white-box setting. Our attack can be seen as a single-step variant of the general PGD method from (Madry et al., 2017). ", + "bbox": [ + 176, + 776, + 826, + 820 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Table 2 compares error rates for the Step-LL and $\\mathsf { R } { + } \\mathsf { S }$ tep-LL methods (with $\\epsilon \\ : = \\ : 1 6 / 2 5 6$ and $\\alpha = \\epsilon / 2 )$ ). The extra random step yields a stronger attack for all models, even those without adversarial training. This suggests that a model’s loss function is generally less smooth near the data points. We further compared the $\\mathsf { R } { + } \\iota$ Step-LL attack to a two-step Iter-LL attack, which computes two gradient steps. Surprisingly, we find that for the adversarially trained Inception v3 model, the $\\mathbf { R } { + } \\mathbf { S }$ tep-LL attack is stronger than the two-step Iter-LL attack. That is, the local gradients learned by the adversarially trained model are worse than random directions for finding adversarial examples! ", + "bbox": [ + 173, + 825, + 825, + 924 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/1fa4d24c1e65b8ece861b436235542350d4289447116bb98817e1dfb972f76b7.jpg", + "table_caption": [], + "table_footnote": [ + "" + ], + "table_body": "
v4v3v3advIRv2IRv2adv
60.269.626.650.721.4
70.580.064.856.337.5
78.586.358.369.941.6
", + "bbox": [ + 281, + 136, + 534, + 200 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/f1983ffa4c42c911d1c8ecd5016c2e7e4a51a93ebc6578d7f8e7a9b836226d4a.jpg", + "table_caption": [ + "Table 2: Error rates $( \\mathbf { i n \\% } )$ for Step-LL, $\\mathbf { R } +$ Step-LL and a two-step Iter-LL on ImageNet. We use $\\epsilon = { ^ { 1 6 } } / { 2 5 6 }$ , $\\alpha = \\epsilon / 2$ on 10,000 random test inputs. $\\mathrm { R + F G S M }$ results on MNIST are in Table 7. ", + "" + ], + "table_footnote": [], + "table_body": "
v4v3v3advIRv2IRv2adv
31.042.79.024.05.8
42.857.137.129.315.0
56.270.229.645.416.5
", + "bbox": [ + 552, + 135, + 810, + 200 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/0a5e9fc8eec0b93cf11314bfb496b59e94874e827cb5fd405580b34b5a977ee5.jpg", + "table_caption": [ + "Table 3: Models used for Ensemble Adversarial Training on ImageNet. The ResNets (He et al., 2016) use either 50 or 101 layers. IncRes stands for Inception ResNet (Szegedy et al., 2016a). " + ], + "table_footnote": [], + "table_body": "
Trained ModelPre-trained ModelsHoldout Models
Inception v3 (v3adv-ens3)Inception v3,ResNet v2 (50)Inception v4
Inception v3 (v3adv-ens4)Inception v3,ResNet v2 (5O), IncRes v2ResNet v1 (50)
IncRes v2 (IRv2adv-ens)Inception v3, IncRes v2ResNetv2(101))
", + "bbox": [ + 200, + 276, + 790, + 344 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We find that the addition of this random step hinders transferability (see Table 9). We also tried adversarial training using $\\mathrm { R + F G S M }$ on MNIST, using a similar approach as (Madry et al., 2017). We adversarially train a CNN (model A in Table 5) for 100 epochs, and attain $> 9 0 . 0 \\%$ accuracy on $\\mathrm { R + F G S M }$ samples. However, training on $\\mathrm { R + F G S M }$ provides only little robustness to iterative attacks. For the PGD attack of (Madry et al., 2017) with 20 steps, the model attains $1 8 . 0 \\%$ accuracy. ", + "bbox": [ + 174, + 376, + 825, + 445 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 ENSEMBLE ADVERSARIAL TRAINING ", + "text_level": 1, + "bbox": [ + 176, + 470, + 473, + 484 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We now evaluate our Ensemble Adversarial Training strategy described in Section 3.4. We recall our intuition: by augmenting training data with adversarial examples crafted from static pre-trained models, we decouple the generation of adversarial examples from the model being trained, so as to avoid the degenerate minimum described in Section 3.3. Moreover, our hope is that robustness to attacks transferred from some fixed set of models will generalize to other black-box adversaries. ", + "bbox": [ + 174, + 498, + 825, + 569 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We train Inception v3 and Inception ResNet v2 models (Szegedy et al., 2016a) on ImageNet, using the pre-trained models shown in Table 3. In each training batch, we rotate the source of adversarial examples between the currently trained model and one of the pre-trained models. We select the source model at random in each batch, to diversify examples across epochs. The pre-trained models’ gradients can be precomputed for the full training set. The per-batch cost of Ensemble Adversarial Training is thus lower than that of standard adversarial training: using our method with $n - 1$ pre-trained models, only every $n ^ { \\mathrm { t h } }$ batch requires a forward-backward pass to compute adversarial gradients. We use synchronous distributed training on 50 machines, with minibatches of size 16 (we did not pre-compute gradients, and thus lower the batch size to fit all models in memory). Half of the examples in a minibatch are replaced by Step-LL examples. As in Kurakin et al. (2017b), we use RMSProp with a learning rate of 0.045, decayed by a factor of 0.94 every two epochs. ", + "bbox": [ + 174, + 575, + 825, + 731 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To evaluate how robustness to black-box attacks generalizes across models, we transfer various attacks crafted on three different holdout models (see Table 3), as well as on an ensemble of these models (as in Liu et al. (2017)). We use the Step-LL, $\\mathbf { R } +$ Step-LL, FGSM, I-FGSM and the PGD attack from Madry et al. (2017) using the hinge-loss function from Carlini & Wagner (2017a). Our results are in Table 4. For each model, we report the worst-case error rate over all black-box attacks transfered from each of the holdout models (20 attacks in total). Results for MNIST are in Table 8. ", + "bbox": [ + 174, + 738, + 825, + 821 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Convergence speed. Convergence of Ensemble Adversarial Training is slower than for standard adversarial training, a result of training on “hard” adversarial examples and lowering the batch size. Kurakin et al. (2017b) report that after 187 epochs ( $1 5 0 k$ iterations with minibatches of size 32), the ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ model achieves $7 8 \\%$ accuracy. Ensemble Adversarial Training for models ${ \\mathbf { v } } 3 _ { \\mathrm { a d v - e n s } 3 }$ and ${ \\mathbf { v } } 3 _ { \\mathrm { a d v - e n s } 4 }$ converges after 280 epochs ( $4 5 0 k$ iterations with minibatches of size 16). The Inception ResNet v2 model is trained for 175 epochs, where a baseline model converges at around 160 epochs. ", + "bbox": [ + 174, + 839, + 825, + 924 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/b80302d05fa6127583590db91be97602af1ad416481472a7088512eeb7814031.jpg", + "table_caption": [ + "Table 4: Error rates $( \\mathbf { i n \\ \\% } )$ ) for Ensemble Adversarial Training on ImageNet. Error rates on clean data are computed over the full test set. For 10,000 random test set inputs, and $\\epsilon = { ^ { 1 6 } } / { 2 5 6 }$ , we report error rates on white-box Step-LL and the worst-case error over a series of black-box attacks (Step-LL, $R +$ Step-LL, FGSM, I-FGSM, PGD) transferred from the holdout models in Table 3. For both architectures, we mark methods tied for best in bold (based on $9 5 \\%$ confidence). " + ], + "table_footnote": [], + "table_body": "
ModelTop 1Top 5
CleanStep-LLMax.Black-BoxCleanStep-LLMax.Black-Box
v322.069.651.26.142.724.5
v3adv22.026.640.86.19.017.4
v3adv-ens323.630.034.07.610.111.2
v3adv-ens424.243.333.47.819.410.7
IRv219.650.744.44.824.017.8
IRv2adv19.821.434.54.95.811.7
IRv2adv-ens20.226.027.05.17.67.9
", + "bbox": [ + 192, + 176, + 802, + 324 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "White-box attacks. For both architectures, the models trained with Ensemble Adversarial Training are slightly less accurate on clean data, compared to standard adversarial training. Our models are also more vulnerable to white-box single-step attacks, as they were only partially trained on such perturbations. Note that for ${ \\mathbf { v } } 3 _ { \\mathrm { a d v - e n s } 4 }$ , the proportion of white-box Step-LL samples seen during training is $^ 1 / 4$ (instead of $^ 1 / 3$ for model ${ \\mathbf { v } } 3 _ { \\mathrm { a d v - e n s } 3 }$ ). The negative impact on the robustness to white-box attacks is large, for only a minor gain in robustness to transferred samples. Thus it appears that while increasing the diversity of adversarial examples seen during training can provide some marginal improvement, the main benefit of Ensemble Adversarial Training is in decoupling the attacks from the model being trained, which was the goal we stated in Section 3.4. ", + "bbox": [ + 174, + 338, + 825, + 463 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Ensemble Adversarial Training is not robust to white-box Iter-LL and $\\mathrm { R } { + } \\mathrm { : }$ Step-LL samples: the error rates are similar to those for the ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ model, and omitted for brevity (see Kurakin et al. (2017b) for Iter-LL attacks and Table 2 for $\\mathrm { R } { + } \\mathrm { i }$ Step-LL attacks). Kurakin et al. (2017b) conjecture that larger models are needed to attain robustness to such attacks. Yet, against black-box adversaries, these attacks are only a concern insofar as they reliably transfer between models. ", + "bbox": [ + 174, + 470, + 825, + 540 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Black-box attacks. Ensemble Adversarial Training significantly boosts robustness to all attacks transferred from the holdout models. For the $\\mathrm { I R v } 2 _ { \\mathrm { a d v - e n s } }$ model, the accuracy loss (compared to IRv2’s accuracy on clean data) is $7 . 4 \\%$ (top 1) and $\\mathbf { 3 . 1 \\% }$ (top 5). We find that the strongest attacks in our test suite (i.e., with highest transfer rates) are the FGSM attacks. Black-box $\\mathbf { R } { + } \\mathbf { S }$ tep-LL or iterative attacks are less effective, as they do not transfer with high probability (see Kurakin et al. (2017b) and Table 9). Attacking an ensemble of all three holdout models, as in Liu et al. (2017), did not lead to stronger black-box attacks than when attacking the holdout models individually. ", + "bbox": [ + 174, + 551, + 825, + 648 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Our results have little variance with respect to the attack parameters (e.g., smaller $\\epsilon$ ) or to the use of other holdout models for black-box attacks (e.g., we obtain similar results by attacking the v3adv-ens3 and ${ \\mathbf { v } } 3 _ { \\mathrm { a d v - e n s } 4 }$ models with the IRv2 model). We also find that ${ \\mathbf { v } } 3 _ { \\mathrm { a d v - e n s } 3 }$ is not vulnerable to perturbations transferred from ${ \\mathbf { v } } 3 _ { \\mathrm { a d v - e n s } 4 }$ . We obtain similar results on MNIST (see Appendix C.2), thus demonstrating the applicability of our approach to different datasets and model architectures. ", + "bbox": [ + 174, + 656, + 825, + 726 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The NIPS 2017 competition on adversarial examples. Our Inception ResNet v2 model was included as a baseline defense in the NIPS 2017 competition on Adversarial Examples (Kurakin et al., 2017c). Participants of the attack track submitted non-interactive black-box attacks that produce adversarial examples with bounded $\\ell _ { \\infty }$ norm. Models submitted to the defense track were evaluated on all attacks over a subset of the ImageNet test set. The score of a defense was defined as the average accuracy of the model over all adversarial examples produced by all attacks. ", + "bbox": [ + 174, + 742, + 825, + 825 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Our $\\mathrm { I R v } 2 _ { \\mathrm { a d v - e n s } }$ model finished $\\boldsymbol { l } ^ { s t }$ among 70 submissions in the first development round, with a score of $9 5 . 3 \\%$ (the second placed defense scored $8 9 . 9 \\%$ ). The test data was intentionally chosen as an “easy” subset of ImageNet. Our model achieved $9 7 . 9 \\%$ accuracy on the clean test data. ", + "bbox": [ + 176, + 832, + 823, + 875 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "After the first round, we released our model publicly, which enabled other users to launch white-box attacks against it. Nevertheless, a majority of the final submissions built upon our released model. The winning submission (team “liaofz” with a score of $9 5 . 3 \\%$ ) made use of a novel adversarial denoising technique. The second placed defense (team “cihangxie” with a score of $9 2 . 4 \\%$ ) prepends our $\\mathrm { I R v } 2 _ { \\mathrm { a d v - e n s } }$ model with random padding and resizing of the input image (Xie et al., 2018). ", + "bbox": [ + 176, + 882, + 823, + 924 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/f449b38b69b45a3191580e87ac4bd69f0109119052e927f54a66d5fb57558e43.jpg", + "image_caption": [ + "Figure 2: The dimensionality of the adversarial cone. For 500 correctly classified points $x$ , and for $\\epsilon \\in \\{ 4 , 1 0 , 1 6 \\}$ , we plot the probability that we find at least $k$ orthogonal vectors $r _ { i }$ such that $\\| r _ { i } \\| _ { \\infty } = \\epsilon$ and $\\boldsymbol { x } + \\boldsymbol { r } _ { i }$ is misclassified. For $\\epsilon \\geq 1 0$ , model ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ shows a bimodal phenomenon: most points $x$ either have 0 adversarial directions or more than 90. " + ], + "image_footnote": [], + "bbox": [ + 176, + 103, + 821, + 237 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 333, + 821, + 362 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "It is noteworthy that the defenses that incorporated Ensemble Adversarial Training faired better against the worst-case black-box adversary. Indeed, although very robust on average, the winning defense achieved as low as $1 1 . 8 \\%$ accuracy on some attacks. The best defense under this metric (team “rafaelmm” which randomly perturbed images before feeding them to our $\\mathrm { I R v } 2 _ { \\mathrm { a d v - e n s } }$ model) achieved at least $5 3 . 6 \\%$ accuracy against all submitted attacks, including the attacks that explicitly targeted our released model in a white-box setting. ", + "bbox": [ + 174, + 369, + 825, + 453 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Decreasing gradient masking. Ensemble Adversarial Training decreases the magnitude of the gradient masking effect described previously. For the ${ \\mathbf { v } } 3 _ { \\mathrm { a d v - e n s } 3 }$ and ${ \\mathbf { v } } 3 _ { \\mathrm { a d v - e n s } 4 }$ models, we find that the loss incurred on a Step-LL attack gets within respectively $1 3 \\%$ and $1 8 \\%$ of the optimum loss (we recall that for models v3 and ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ , the approximation ratio was respectively $1 9 \\%$ and $7 \\%$ ). Similarly, for the $\\mathrm { I R v } 2 _ { \\mathrm { a d v - e n s } }$ model, the ratio improves from $8 \\%$ (for $\\mathrm { I R } \\mathrm { v } 2 _ { \\mathrm { a d v } } ,$ ) to $1 4 \\%$ . As expected, not solely training on a white-box single-step attack reduces gradient masking. We also verify that after Ensemble Adversarial Training, a two-step iterative attack outperforms the $\\mathrm { R } +$ Step-LL attack from Section 4.1, thus providing further evidence that these models have meaningful gradients. ", + "bbox": [ + 173, + 486, + 825, + 597 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Finally, we revisit the “Gradient-Aligned Adversarial Subspace” (GAAS) method of Tramer et al. \\` (2017). Their method estimates the size of the space of adversarial examples in the vicinity of a point, by finding a set of orthogonal perturbations of norm $\\epsilon$ that are all adversarial. We note that adversarial perturbations do not technically form a “subspace” (e.g., the 0 vector is not adversarial). Rather, they may form a “cone”, the dimension of which varies as we increase $\\epsilon$ . By linearizing the loss function, estimating the dimensionality of this cone reduces to finding vectors $r _ { i }$ that are strongly aligned with the model’s gradient $g = \\nabla _ { x } L ( h ( x ) , y _ { \\mathrm { t r u e } } )$ . Tramer et al. (2017) give a method \\` that finds $k$ orthogonal vectors $r _ { i }$ that satisfy $\\begin{array} { r } { \\boldsymbol { g } ^ { \\intercal } \\boldsymbol { r } _ { i } \\geq \\dot { \\epsilon } \\cdot \\| \\boldsymbol { g } \\| _ { 2 } \\cdot \\frac { 1 } { \\sqrt { k } } } \\end{array}$ (this bound is tight). We extend this result to the $\\ell _ { \\infty }$ norm, an open question in Tramer et al. (2017). In Section E, we give a randomized \\` combinatorial construction (Colbourn, 2010), that finds $k$ orthogonal vectors $r _ { i }$ satisfying $\\| r _ { i } \\| _ { \\infty } =$ $\\epsilon$ and $\\begin{array} { r } { \\mathbb { E } \\left[ \\boldsymbol { g } ^ { \\top } \\boldsymbol { r } _ { i } \\right] \\ge \\epsilon \\cdot \\| \\boldsymbol { g } \\| _ { 1 } \\cdot \\frac { 1 } { \\sqrt { k } } } \\end{array}$ . We show that this result is tight as well. ", + "bbox": [ + 173, + 603, + 825, + 763 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "For models v3, ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ and ${ \\mathbf { v } } 3 _ { \\mathrm { a d v - e n s } 3 }$ , we select 500 correctly classified test points. For each $x$ , we search for a maximal number of orthogonal adversarial perturbations $r _ { i }$ with $\\| r _ { i } \\| _ { \\infty } = \\epsilon$ . We limit our search to $k \\leq 1 0 0$ directions per point. The results are in Figure 2. For $\\epsilon \\in \\{ 4 , 1 0 , 1 6 \\}$ , we plot the proportion of points that have at least $k$ orthogonal adversarial perturbations. For a fixed $\\epsilon$ , the value of $k$ can be interpreted as the dimension of a “slice” of the cone of adversarial examples near a data point. For the standard Inception v3 model, we find over 50 orthogonal adversarial directions for $3 0 \\%$ of the points. The ${ \\bf V } { \\boldsymbol 3 } _ { \\mathrm { a d v } }$ model shows a curious bimodal phenomenon for $\\epsilon \\geq 1 0$ : for most points $( \\approx 8 0 \\%$ ), we find no adversarial direction aligned with the gradient, which is consistent with the gradient masking effect. Yet, for most of the remaining points, the adversarial space is very high-dimensional $k \\geq 9 0$ ). Ensemble Adversarial Training yields a more robust model, with only a small fraction of points near a large adversarial space. ", + "bbox": [ + 173, + 770, + 825, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 CONCLUSION AND FUTURE WORK ", + "text_level": 1, + "bbox": [ + 174, + 102, + 495, + 118 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Previous work on adversarial training at scale has produced encouraging results, showing strong robustness to (single-step) adversarial examples (Goodfellow et al., 2014b; Kurakin et al., 2017b). Yet, these results are misleading, as the adversarially trained models remain vulnerable to simple black-box and white-box attacks. Our results, generic with respect to the application domain, suggest that adversarial training can be improved by decoupling the generation of adversarial examples from the model being trained. Our experiments with Ensemble Adversarial Training show that the robustness attained to attacks from some models transfers to attacks from other models. ", + "bbox": [ + 174, + 133, + 825, + 231 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We did not consider black-box adversaries that attack a model via other means than by transferring examples from a local model. For instance, generative techniques (Baluja & Fischer, 2017) might provide an avenue for stronger attacks. Yet, a recent work by Xiao et al. (2018) found Ensemble Adversarial Training to be resilient to such attacks on MNIST and CIFAR10, and often attaining higher robustness than models that were adversarially trained on iterative attacks. ", + "bbox": [ + 174, + 238, + 823, + 308 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Moreover, interactive adversaries (see Appendix A) could try to exploit queries to the target model’s prediction function in their attack, as demonstrated in Papernot et al. (2017). If queries to the target model yield prediction confidences, an adversary can estimate the target’s gradient at a given point (e.g., using finite-differences as in Chen et al. (2017)) and fool the target with our $\\mathrm { R + F G S M }$ attack. Note that if queries only return the predicted label, the attack does not apply. Exploring the impact of these classes of black-box attacks and evaluating their scalability to complex tasks is an interesting avenue for future work. ", + "bbox": [ + 174, + 314, + 825, + 411 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "ACKNOWLEDGMENTS ", + "text_level": 1, + "bbox": [ + 176, + 434, + 356, + 448 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We thank Ben Poole and Jacob Steinhardt for feedback on early versions of this work. Nicolas Papernot is supported by a Google PhD Fellowship in Security. Research was supported in part by the Army Research Laboratory, under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA), and the Army Research Office under grant W911NF-13-1-0421. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for government purposes notwithstanding any copyright notation hereon. ", + "bbox": [ + 174, + 463, + 825, + 575 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 597, + 285, + 611 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Mart´ın Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S. Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Ian Goodfellow, Andrew Harp, Geoffrey Irving, Michael Isard, Yangqing Jia, Rafal Jozefowicz, Lukasz Kaiser, Manjunath Kudlur, Josh Levenberg, Dan Mane, Rajat Monga, Sherry Moore, Derek Murray, Chris Olah, ´ Mike Schuster, Jonathon Shlens, Benoit Steiner, Ilya Sutskever, Kunal Talwar, Paul Tucker, Vincent Vanhoucke, Vijay Vasudevan, Fernanda Viegas, Oriol Vinyals, Pete Warden, Martin Watten- ´ berg, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng. TensorFlow: Large-scale machine learning on heterogeneous systems, 2015. URL https://www.tensorflow.org/. Software available from tensorflow.org. ", + "bbox": [ + 176, + 619, + 825, + 744 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Dario Amodei, Chris Olah, Jacob Steinhardt, Paul Christiano, John Schulman, and Dan Mane. Con- ´ crete problems in ai safety. arXiv preprint arXiv:1606.06565, 2016. ", + "bbox": [ + 171, + 753, + 823, + 782 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Anish Athalye, Nicholas Carlini, and David Wagner. Obfuscated gradients give a false sense of security: Circumventing defenses to adversarial examples. arXiv preprint arXiv:1802.00420, 2018. ", + "bbox": [ + 176, + 791, + 823, + 833 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Shumeet Baluja and Ian Fischer. Adversarial transformation networks: Learning to generate adversarial examples. arXiv preprint arXiv:1703.09387, 2017. ", + "bbox": [ + 169, + 842, + 823, + 871 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Battista Biggio, Igino Corona, Davide Maiorca, Blaine Nelson, Nedim Srndi ˇ c, Pavel Laskov, Gior- ´ gio Giacinto, and Fabio Roli. Evasion attacks against machine learning at test time. In ECMLKDD, pp. 387–402. Springer, 2013. ", + "bbox": [ + 176, + 881, + 823, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Wieland Brendel and Matthias Bethge. Comment on” biologically inspired protection of deep networks from adversarial attacks”. arXiv preprint arXiv:1704.01547, 2017. ", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jacob Buckman, Aurko Roy, Colin Raffel, and Ian Goodfellow. Thermometer encoding: One hot way to resist adversarial examples. In International Conference on Learning Representations, 2018. URL https://openreview.net/forum?id=S18Su--CW. ", + "bbox": [ + 176, + 140, + 823, + 184 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Nicholas Carlini and David Wagner. Towards evaluating the robustness of neural networks. In IEEE Symposium on Security and Privacy, 2017a. ", + "bbox": [ + 173, + 191, + 823, + 220 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Nicholas Carlini and David Wagner. Adversarial examples are not easily detected: Bypassing ten detection methods. arXiv preprint arXiv:1705.07263, 2017b. ", + "bbox": [ + 171, + 229, + 823, + 258 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Pin-Yu Chen, Huan Zhang, Yash Sharma, Jinfeng Yi, and Cho-Jui Hsieh. Zoo: Zeroth order optimization based black-box attacks to deep neural networks without training substitute models. In Proceedings of the 10th ACM Workshop on Artificial Intelligence and Security, pp. 15–26. ACM, 2017. ", + "bbox": [ + 173, + 266, + 825, + 321 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Moustapha Cisse, Bojanowski Piotr, Grave Edouard, Dauphin Yann, and Usunier Nicolas. Parseval networks: Improving robustness to adversarial examples. arXiv preprint arXiv:1704.08847, 2017. ", + "bbox": [ + 173, + 330, + 820, + 361 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Charles J Colbourn. CRC handbook of combinatorial designs. CRC press, 2010. ", + "bbox": [ + 173, + 368, + 705, + 385 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei. ImageNet: A Large-Scale Hierarchical Image Database. In CVPR09, 2009. ", + "bbox": [ + 168, + 391, + 823, + 421 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Logan Engstrom, Dimitris Tsipras, Ludwig Schmidt, and Aleksander Madry. A rotation and a translation suffice: Fooling cnns with simple transformations. arXiv preprint arXiv:1712.02779, 2017. ", + "bbox": [ + 174, + 429, + 823, + 472 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. Generative adversarial nets. In Advances in neural information processing systems, pp. 2672–2680, 2014a. ", + "bbox": [ + 173, + 479, + 823, + 523 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572, 2014b. ", + "bbox": [ + 173, + 531, + 821, + 560 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Shixiang Gu and Luca Rigazio. Towards deep neural network architectures robust to adversarial examples. arXiv preprint arXiv:1412.5068, 2014. ", + "bbox": [ + 174, + 569, + 821, + 598 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 770–778, 2016. ", + "bbox": [ + 174, + 606, + 825, + 648 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "J Zico Kolter and Eric Wong. Provable defenses against adversarial examples via the convex outer adversarial polytope. arXiv preprint arXiv:1711.00851, 2017. ", + "bbox": [ + 173, + 657, + 821, + 686 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alexey Kurakin, Ian Goodfellow, and Samy Bengio. Adversarial examples in the physical world. In ICLR, 2017a. ", + "bbox": [ + 174, + 694, + 821, + 723 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alexey Kurakin, Ian Goodfellow, and Samy Bengio. Adversarial machine learning at scale. In ICLR, 2017b. ", + "bbox": [ + 173, + 732, + 821, + 761 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alexey Kurakin, Ian J Goodfellow, and Samy Bengio. Nips 2017: Defense against adversarial attack, 2017c. URL https://www.kaggle.com/c/ nips-2017-defense-against-adversarial-attack. ", + "bbox": [ + 174, + 768, + 825, + 813 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yann LeCun, Leon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning applied to ´ document recognition. Proceedings of the IEEE, 86(11):2278–2324, 1998. ", + "bbox": [ + 174, + 820, + 821, + 849 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yanpei Liu, Xinyun Chen, Chang Liu, and Dawn Song. Delving into transferable adversarial examples and black-box attacks. In ICLR, 2017. ", + "bbox": [ + 176, + 858, + 821, + 887 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yan Luo, Xavier Boix, Gemma Roig, Tomaso Poggio, and Qi Zhao. Foveation-based mechanisms alleviate adversarial examples. arXiv preprint arXiv:1511.06292, 2015. ", + "bbox": [ + 176, + 895, + 821, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. Towards deep learning models resistant to adversarial attacks. arXiv preprint arXiv:1706.06083, 2017. ", + "bbox": [ + 176, + 103, + 823, + 146 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Yishay Mansour, Mehryar Mohri, and Afshin Rostamizadeh. Domain adaptation: Learning bounds and algorithms. arXiv preprint arXiv:0902.3430, 2009. ", + "bbox": [ + 174, + 154, + 823, + 183 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Dmytro Mishkin, Nikolay Sergievskiy, and Jiri Matas. Systematic evaluation of convolution neural network advances on the imagenet. Computer Vision and Image Understanding, 2017. ", + "bbox": [ + 174, + 189, + 823, + 218 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Aran Nayebi and Surya Ganguli. Biologically inspired protection of deep networks from adversarial attacks. arXiv preprint arXiv:1703.09202, 2017. ", + "bbox": [ + 171, + 226, + 823, + 255 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Nicolas Papernot, Patrick McDaniel, Somesh Jha, Matt Fredrikson, Z Berkay Celik, and Ananthram Swami. The limitations of deep learning in adversarial settings. In Security and Privacy (EuroS&P), 2016 IEEE European Symposium on, pp. 372–387. IEEE, 2016a. ", + "bbox": [ + 176, + 262, + 825, + 305 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Nicolas Papernot, Patrick McDaniel, Arunesh Sinha, and Michael Wellman. Towards the science of security and privacy in machine learning. arXiv preprint arXiv:1611.03814, 2016b. ", + "bbox": [ + 173, + 311, + 823, + 342 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Nicolas Papernot, Patrick McDaniel, Xi Wu, Somesh Jha, and Ananthram Swami. Distillation as a defense to adversarial perturbations against deep neural networks. In Security and Privacy (SP), 2016 IEEE Symposium on, pp. 582–597. IEEE, 2016c. ", + "bbox": [ + 173, + 347, + 821, + 391 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Nicolas Papernot, Patrick McDaniel, Ian Goodfellow, Somesh Jha, Z Berkay Celik, and Ananthram Swami. Practical black-box attacks against machine learning. In Asia Conference on Computer and Communications Security (ASIACCS), pp. 506–519. ACM, 2017. ", + "bbox": [ + 173, + 397, + 823, + 441 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Aditi Raghunathan, Jacob Steinhardt, and Percy Liang. Certified defenses against adversarial examples. In International Conference on Learning Representations, 2018. URL https: //openreview.net/forum?id $=$ Bys4ob-Rb. ", + "bbox": [ + 176, + 446, + 821, + 491 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Aman Sinha, Hongseok Namkoong, and John Duchi. Certifiable distributional robustness with principled adversarial training. In International Conference on Learning Representations, 2018. URL https://openreview.net/forum?id $=$ Hk6kPgZA-. ", + "bbox": [ + 173, + 497, + 825, + 540 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Nitish Srivastava, Geoffrey E Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. Dropout: a simple way to prevent neural networks from overfitting. Journal of machine learning research, 15(1):1929–1958, 2014. ", + "bbox": [ + 174, + 547, + 823, + 590 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013. ", + "bbox": [ + 173, + 598, + 823, + 627 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Christian Szegedy, Sergey Ioffe, Vincent Vanhoucke, and Alex Alemi. Inception-v4, inceptionresnet and the impact of residual connections on learning. arXiv preprint arXiv:1602.07261, 2016a. ", + "bbox": [ + 173, + 633, + 823, + 676 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jon Shlens, and Zbigniew Wojna. Rethinking the inception architecture for computer vision. In CVPR, pp. 2818–2826, 2016b. ", + "bbox": [ + 173, + 683, + 821, + 713 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Florian Tramer, Fan Zhang, Ari Juels, Michael K Reiter, and Thomas Ristenpart. Stealing machine\\` learning models via prediction apis. In Usenix Security, 2016. ", + "bbox": [ + 173, + 719, + 821, + 750 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Florian Tramer, Nicolas Papernot, Ian Goodfellow, Dan Boneh, and Patrick McDaniel. The space \\` of transferable adversarial examples. arXiv preprint arXiv:1704.03453, 2017. ", + "bbox": [ + 171, + 756, + 823, + 785 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Chaowei Xiao, Bo Li, Jun-Yan Zhu, Warren He, Mingyan Liu, and Dawn Song. Generating adversarial examples with adversarial networks, 2018. URL https://openreview.net/ forum?id $\\underline { { \\underline { { \\mathbf { \\Pi } } } } } =$ HknbyQbC-. ", + "bbox": [ + 173, + 792, + 823, + 835 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Cihang Xie, Jianyu Wang, Zhishuai Zhang, Zhou Ren, and Alan Yuille. Mitigating adversarial effects through randomization. In International Conference on Learning Representations, 2018. URL https://openreview.net/forum?id $=$ Sk9yuql0Z. ", + "bbox": [ + 176, + 842, + 823, + 886 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Chao Zhang, Lei Zhang, and Jieping Ye. Generalization bounds for domain adaptation. In Advances in neural information processing systems, pp. 3320–3328, 2012. ", + "bbox": [ + 173, + 892, + 823, + 921 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A THREAT MODEL: FORMAL DEFINITIONS ", + "text_level": 1, + "bbox": [ + 174, + 102, + 547, + 118 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We provide formal definitions for the threat model introduced in Section 3.1. In the following, we explicitly identify the hypothesis space $\\mathcal { H }$ that a model belongs to as describing the model’s architecture. We consider a target model $h \\in \\mathcal H$ trained over inputs $( x , y _ { \\mathrm { t r u e } } )$ sampled from a data distribution $\\mathcal { D }$ . More precisely, we write ", + "bbox": [ + 174, + 131, + 825, + 188 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/574c912208ce5ad6f00dbc7752843f6142bc28b6ce68dfb6f2a014ec1485fa18.jpg", + "text": "$$\nh \\gets \\mathsf { t r a i n } ( \\mathcal { H } , X _ { \\mathrm { t r a i n } } , Y _ { \\mathrm { t r a i n } } , r ) \\ ,\n$$", + "text_format": "latex", + "bbox": [ + 388, + 189, + 606, + 207 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "where train is a randomized training procedure that takes in a description of the model architecture $\\mathcal { H }$ , a training set $X _ { \\mathrm { t r a i n } } , Y _ { \\mathrm { t r a i n } }$ sampled from $\\mathcal { D }$ , and randomness $r$ . ", + "bbox": [ + 174, + 208, + 820, + 236 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "iven a set of test inputs produces adversarial $X , Y = \\{ ( x _ { 1 } , y _ { 1 } ) , \\dots , ( x _ { m } , y _ { m } ) \\}$ om, su $\\mathcal { D }$ and a that $\\epsilon > 0$ versaryfor all $\\mathcal { A }$ $X ^ { \\mathrm { a d v } } = \\{ x _ { 1 } ^ { \\mathrm { a d v } } , \\ldots , x _ { m } ^ { \\mathrm { a d v } } \\}$ $\\| x _ { i } - x _ { i } ^ { \\mathrm { a d v } } \\| _ { \\infty } ~ \\leq ~ \\epsilon$ $i \\in [ 1 , m ]$ . We evaluate success of the attack as the error rate of the target model over $X ^ { \\mathrm { a d v } }$ : ", + "bbox": [ + 173, + 241, + 825, + 290 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/7824d0154feca31f51f6d92c69765b2b67f54d8c254db27cbca380c77d387d2c.jpg", + "text": "$$\n\\frac { 1 } { m } \\sum _ { i = 1 } ^ { m } \\mathbb { 1 } ( \\arg \\operatorname* { m a x } h ( x _ { i } ^ { \\mathrm { a d v } } ) \\neq y _ { i } ) ~ .\n$$", + "text_format": "latex", + "bbox": [ + 385, + 291, + 611, + 332 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We assume $\\mathcal { A }$ can sample inputs according to the data distribution $\\mathcal { D }$ . We define three adversaries. ", + "bbox": [ + 174, + 332, + 815, + 347 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Definition 2 (White-Box Adversary). For a target model $h \\in \\mathcal H$ , a white-box adversary is given access to all elements of the training procedure, that is train (the training algorithm), $\\mathcal { H }$ (the model architecture), the training data $X _ { t r a i n } , Y _ { t r a i n } ,$ , the randomness $r$ and the parameters $h$ . The adversary can use any attack (e.g., those in Section 3.2) to find adversarial inputs. ", + "bbox": [ + 173, + 348, + 825, + 405 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "White-box access to the internal model weights corresponds to a very strong adversarial model. We thus also consider the following relaxed and arguably more realistic notion of a black-box adversary. Definition 3 (Non-Interactive Black-Box Adversary). For a target model $h \\in \\mathcal H$ , a non-interactive black-box adversary only gets access to train (the target model’s training procedure) and $\\mathcal { H }$ (the model architecture). The adversary can sample from the data distribution $\\mathcal { D }$ , and uses a local algorithm to craft adversarial examples Xadv. ", + "bbox": [ + 173, + 414, + 825, + 502 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Attacks based on transferability (Szegedy et al., 2013) fall in this category, wherein the adversary selects a procedure train0 and model architecture $\\mathcal { H } ^ { \\prime }$ , trains a local model $\\mathit { \\Pi } _ { h ^ { ' } }$ over $\\mathcal { D }$ , and computes adversarial examples on its local model $h ^ { \\prime }$ using white-box attack strategies. ", + "bbox": [ + 174, + 511, + 825, + 554 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Most importantly, a black-box adversary does not learn the randomness $r$ used to train the target, nor the target’s parameters $h$ . The black-box adversaries in our paper are actually slightly stronger than the ones defined above, in that they use the same training data $X _ { \\mathrm { t r a i n } } , Y _ { \\mathrm { t r a i n } }$ as the target model. ", + "bbox": [ + 174, + 560, + 825, + 603 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We provide $\\mathcal { A }$ with the target’s training procedure train to capture knowledge of defensive strategies applied at training time, e.g., adversarial training (Szegedy et al., 2013; Goodfellow et al., 2014b) or ensemble adversarial training (see Section 4.2). For ensemble adversarial training, $\\mathcal { A }$ also knows the architectures of all pre-trained models. In this work, we always mount black-box attacks that train a local model with a different architecture than the target model. We actually find that black-box attacks on adversarially trained models are stronger in this case (see Table 1). ", + "bbox": [ + 174, + 609, + 825, + 694 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The main focus of our paper is on non-interactive black-box adversaries as defined above. For completeness, we also formalize a stronger notion of interactive black-box adversaries that additionally issue prediction queries to the target model (Papernot et al., 2017). We note that in cases where ML models are deployed as part of a larger system (e.g., a self driving car), an adversary may not have direct access to the model’s query interface. ", + "bbox": [ + 174, + 700, + 825, + 770 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Definition 4 (Interactive Black-Box Adversary). For a target model $h \\in \\mathcal H$ , an interactive blackbox adversary only gets access to train (the target model’s training procedure) and $\\mathcal { H }$ (the model architecture). The adversary issues (adaptive) oracle queries to the target model. That is, for arbitrary inputs $x \\in [ 0 , 1 ] ^ { d }$ , the adversary obtains $y = \\arg \\operatorname* { m a x } h ( x )$ and uses a local algorithm to craft adversarial examples (given knowledge of $\\mathcal { H }$ , train, and tuples $( x , y )$ ). ", + "bbox": [ + 174, + 772, + 825, + 845 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Papernot et al. (2017) show that such attacks are possible even if the adversary only gets access to a small number of samples from $\\mathcal { D }$ . Note that if the target model’s prediction interface additionally returns class scores $h ( x )$ , interactive black-box adversaries could use queries to the target model to estimate the model’s gradient (e.g., using finite differences) (Chen et al., 2017), and then apply the attacks in Section 3.2. We further discuss interactive black-box attack strategies in Section 5. ", + "bbox": [ + 174, + 853, + 825, + 924 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "B GENERALIZATION BOUND FOR ENSEMBLE ADVERSARIAL TRAINING ", + "text_level": 1, + "bbox": [ + 169, + 102, + 781, + 118 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We provide a formal statement of Theorem 1 in Section 3.4, regarding the generalization guarantees of Ensemble Adversarial Training. For simplicity, we assume that the model is trained solely on adversarial examples computed on the pre-trained models (i.e., we ignore the clean training data and the adversarial examples computed on the model being trained). Our results are easily extended to also consider these data points. ", + "bbox": [ + 173, + 132, + 825, + 204 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Let $\\mathcal { D }$ be the data distribution and $\\mathcal { A } _ { 1 } , \\ldots , \\mathcal { A } _ { k } , \\mathcal { A } ^ { * }$ be adversarial distributions where a sample $( x , y )$ is obtained by sampling $( x , y _ { \\mathrm { t r u e } } )$ from $\\mathcal { D }$ , computing an $x ^ { \\mathrm { a d v } }$ such that $\\| x ^ { \\mathrm { a d v } } - x \\| _ { \\infty } \\leq \\epsilon$ and returning $( x ^ { \\mathrm { a d v } } , y _ { \\mathrm { t r u e } } )$ . We assume the model is trained on $N$ data points $Z _ { \\mathrm { t r a i n } }$ , where $\\textstyle { \\frac { N } { k } }$ data points are sampled from each distribution $A _ { i }$ , for $1 \\leq i \\leq k$ . We denote $\\mathcal { A } _ { \\mathrm { t r a i n } } = \\{ \\mathcal { A } _ { 1 } , . . . , \\overset { \\because } { \\mathcal { A } } _ { k } \\}$ . At test time, the model is evaluated on adversarial examples from $\\mathcal { A } ^ { * }$ . ", + "bbox": [ + 173, + 209, + 825, + 286 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "For a model $h \\in \\mathcal H$ we define the empirical risk ", + "bbox": [ + 173, + 291, + 488, + 306 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/f95f5a93a7a03ef3af8fd50b6bad89e0003e2ec105c3044243de34c44707df50.jpg", + "text": "$$\n\\hat { R } ( h , { \\mathcal A } _ { \\mathrm { t r a i n } } ) : = \\frac { 1 } { N } \\sum _ { ( x ^ { \\mathrm { a d v } } , y _ { \\mathrm { t r u e } } ) \\in Z _ { \\mathrm { t r a i n } } } L ( h ( x ^ { \\mathrm { a d v } } ) , y _ { \\mathrm { t r u e } } ) \\ ,\n$$", + "text_format": "latex", + "bbox": [ + 331, + 310, + 665, + 354 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "and the risk over the target distribution (or future adversary) ", + "bbox": [ + 173, + 358, + 568, + 373 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/af0c33838d357dd04f064c1748c3e63cc727f68787a70ecccec78b9da227ca24.jpg", + "text": "$$\nR ( h , \\mathcal { A } ^ { \\ast } ) : = \\underset { ( x ^ { \\mathrm { a d v } } , y _ { \\mathrm { t r u e } } ) \\sim \\mathcal { A } ^ { \\ast } } { \\mathbb { E } } [ L ( h ( x ^ { \\mathrm { a d v } } ) , y _ { \\mathrm { t r u e } } ) ] .\n$$", + "text_format": "latex", + "bbox": [ + 349, + 378, + 647, + 409 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We further define the average discrepancy distance (Mansour et al., 2009) between distributions $A _ { i }$ and $\\mathcal { A } ^ { * }$ with respect to a hypothesis space $\\mathcal { H }$ as ", + "bbox": [ + 171, + 414, + 823, + 443 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/6a12ecf33155f68f7b97ca554c11b0753afc76a027e28f5ae3ddbebb40ad2192.jpg", + "text": "$$\n\\operatorname { d i s c } _ { { \\mathcal { H } } } ( { \\mathcal { A } } _ { \\mathrm { t r a i n } } , { \\mathcal { A } } ^ { * } ) : = \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\operatorname* { s u p } _ { h _ { 1 } , h _ { 2 } \\in { \\mathcal { H } } } \\left| \\frac { \\mathbb { E } } { A _ { i } } \\big [ \\mathbb { 1 } _ { \\{ h _ { 1 } ( x ^ { \\mathrm { a b } } ) = h _ { 2 } ( x ^ { \\mathrm { a b } } ) \\} } \\big ] - \\underline { { \\mathbb { E } } } _ { * } \\big [ \\mathbb { 1 } _ { \\{ h _ { 1 } ( x ^ { \\mathrm { a b } } ) = h _ { 2 } ( x ^ { \\mathrm { a b } } ) \\} } \\big ] \\right| .\n$$", + "text_format": "latex", + "bbox": [ + 196, + 448, + 774, + 491 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "This quantity characterizes how “different” the future adversary is from the train-time adversaries. Intuitively, the distance disc $( \\mathcal { A } _ { \\mathrm { t r a i n } } , \\mathcal { A } ^ { * } )$ is small if the difference in robustness between two models to the target attack $\\mathcal { A } ^ { * }$ is somewhat similar to the difference in robustness between these two models to the attacks used for training (e.g., if the static black-box attacks $\\mathbf { \\mathcal { A } } _ { i }$ induce much higher error on some model $h _ { 1 }$ than on another model $h _ { 2 }$ , then the same should hold for the target attack $\\mathcal { A } ^ { * }$ ). In other words, the ranking of the robustness of models $h \\in \\mathcal H$ should be similar for the attacks in $\\mathcal { A } _ { \\mathrm { t r a i n } }$ as for $\\mathcal { A } ^ { * }$ . ", + "bbox": [ + 173, + 494, + 825, + 593 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Finally, let $R _ { N } ( \\mathscr { H } )$ be the average Rademacher complexity of the distributions $\\mathcal { A } _ { 1 } , \\ldots , \\mathcal { A } _ { k }$ (Zhang et al., 2012). Note that $R _ { N } ( \\mathscr { H } ) \\dot { \\mathbf { \\Omega } } \\to 0$ as $N \\infty$ . The following theorem is a corollary of Zhang et al. (2012, Theorem 5.2): ", + "bbox": [ + 174, + 599, + 825, + 642 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Theorem 5. Assume that $\\mathcal { H }$ is a function class consisting of bounded functions. Then, with probability at least $1 - \\epsilon ,$ , ", + "bbox": [ + 174, + 645, + 823, + 674 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/968b4a6a65dca5201584f84e64ee8b3494df09efba8c9219df7cf5ceb85db708.jpg", + "text": "$$\n\\operatorname* { s u p } _ { h \\in \\mathcal { H } } \\vert \\hat { R } ( h , { \\mathcal A } _ { t r a i n } ) - R ( h , { \\mathcal A } ^ { * } ) \\vert \\leq d i s c _ { \\mathcal { H } } ( { \\mathcal A } _ { t r a i n } , { \\mathcal A } ^ { * } ) + 2 R _ { N } ( \\mathcal { H } ) + O \\left( \\sqrt { \\frac { \\ln ( 1 / \\epsilon ) } { N } } \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 202, + 678, + 766, + 720 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Compared to the standard generalization bound for supervised learning, the generalization bound for Domain Adaptation incorporates the extra term $\\mathrm { d i s c } _ { \\mathcal { H } } ( \\mathcal { A } _ { \\mathrm { t r a i n } } , \\mathcal { A } ^ { * } )$ to capture the divergence between the target and source distributions. In our context, this means that the model $h ^ { * }$ learned by Ensemble Adversarial Training has guaranteed generalization bounds with respect to future adversaries that are not “too different” from the ones used during training. Note that $\\mathcal { A } ^ { * }$ need not restrict itself to perturbation with bounded $\\ell _ { \\infty }$ norm for this result to hold. ", + "bbox": [ + 173, + 732, + 825, + 818 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C EXPERIMENTS ON MNIST ", + "text_level": 1, + "bbox": [ + 176, + 835, + 429, + 853 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We re-iterate our ImageNet experiments on MNIST. For this simpler task, Madry et al. (2017) show that training on iterative attacks conveys robustness to white-box attacks with bounded $\\ell _ { \\infty }$ norm. Our goal is not to attain similarly strong white-box robustness on MNIST, but to show that our observations on limitations of single-step adversarial training, extend to other datasets than ImageNet. ", + "bbox": [ + 174, + 867, + 823, + 924 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/2b6af3b5b8bdd08fb1a44e32ac65797040e19643a1e40965efbd54da313b7abf.jpg", + "image_caption": [ + "Figure 3: Adversarial Examples on MNIST. (top) clean examples. (middle) inputs are rotated by $2 0 ^ { \\circ }$ and 5 random pixels are flipped. (bottom) The I-FGSM with $\\epsilon = 0 . 3$ is applied. " + ], + "image_footnote": [], + "bbox": [ + 370, + 103, + 627, + 162 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "C.1 A NOTE ON $\\ell _ { \\infty }$ ROBUSTNESS ON MNIST ", + "bbox": [ + 174, + 210, + 503, + 227 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "The MNIST dataset is a simple baseline for assessing the potential of a defense, but the obtained results do not always generalize to harder tasks. We suggest that this is because achieving robustness to $\\ell _ { \\infty }$ perturbations admits a simple “closed-form” solution, given the near-binary nature of the data. Indeed, for an average MNIST image, over $8 0 \\%$ of the pixels are in $\\{ 0 , 1 \\}$ and only $6 \\%$ are in the range [0.2, 0.8]. Thus, for a perturbation with $\\epsilon \\leq 0 . 3$ , binarized versions of $x$ and $x ^ { \\mathrm { a d v } }$ can differ in at most $6 \\%$ of the input dimensions. By binarizing the inputs of a standard CNN trained without adversarial training, we obtain a model that enjoys robustness similar to the model trained by Madry et al. (2017). Concretely, for a white-box I-FGSM attack, we get at most $1 1 . 4 \\%$ error. ", + "bbox": [ + 173, + 238, + 825, + 352 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "The existence of such a simple robust representation begs the question of why learning a robust model with adversarial training takes so much effort. Finding techniques to improve the performance of adversarial training, even on simple tasks, could provide useful insights for more complex tasks such as ImageNet, where we do not know of a similarly simple “denoising” procedure. ", + "bbox": [ + 174, + 359, + 825, + 415 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "These positive results on MNIST for the $\\ell _ { \\infty }$ norm also leave open the question of defining a general norm for adversarial examples. Let us motivate the need for such a definition: we find that if we first rotate an MNIST digit by $2 0 ^ { \\circ }$ , and then use the I-FGSM, our rounding model and the model from Madry et al. (2017) achieve only $6 5 \\%$ accuracy (on “clean” rotated inputs, the error is $< 5 \\%$ ). If we further randomly “flip” 5 pixels per image, the accuracy of both models drops to under $5 0 \\%$ . Thus, we successfully evade the model by slightly extending the threat model (see Figure 3). ", + "bbox": [ + 174, + 421, + 825, + 506 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Of course, we could augment the training set with such perturbations (see Engstrom et al. (2017)). An open question is whether we can enumerate all types of “adversarial” perturbations. In this work, we focus on the $\\ell _ { \\infty }$ norm to illustrate our findings on the limitations of single-step adversarial training on ImageNet and MNIST, and to showcase the benefits of our Ensemble Adversarial Training variant. Our approach can easily be extended to consider multiple perturbation metrics. We leave such an evaluation to future work. ", + "bbox": [ + 174, + 512, + 825, + 595 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "C.2 RESULTS ", + "text_level": 1, + "bbox": [ + 174, + 614, + 281, + 630 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We repeat experiments from Section 4 on MNIST. We use the architectures in Table 5. We train a standard model for 6 epochs, and an adversarial model with the FGSM $\\epsilon = 0 . 3$ ) for 12 epochs. ", + "bbox": [ + 176, + 641, + 823, + 670 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "During adversarial training, we avoid the label leaking effect described by Kurakin et al. (2017b) by using the model’s predicted class arg max $h ( x )$ instead of the true label $y _ { \\mathrm { t r u e } }$ in the FGSM, ", + "bbox": [ + 173, + 676, + 820, + 705 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We first analyze the “degenerate” minimum of adversarial training, described in Section 3.3. For each trained model, we compute the approximation-ratio of the FGSM for the inner maximization problem in equation (1). That is, we compare the loss produced by the FGSM with the loss of a strong iterative attack. The results appear in Table 6. As we can see, for all model architectures, adversarial training degraded the quality of a linear approximation to the model’s loss. ", + "bbox": [ + 174, + 712, + 825, + 755 + ], + "page_idx": 14 + }, + { + "type": "table", + "img_path": "images/61a7838c52a30441f17b5bb0361161b82e9ddfa854968545be2d9baaacbf0c1b.jpg", + "table_caption": [ + "Table 5: Neural network architectures used in this work for the MNIST dataset. Conv: convolutional layer, FC: fully connected layer. " + ], + "table_footnote": [], + "table_body": "
ABCD
Conv(64,5,5) +ReluDropout(0.2)Conv(128,3,3) + Tanh[FC(300) + Relu] ×4
Conv(64,5,5) + ReluConv(64,8,8) + ReluMaxPool(2,2)Dropout(0.5）
Dropout(0.25)Conv(128,6,6) +ReluConv(64,3,3) + TanhFC +Softmax
FC(128) + ReluConv(128,5,5) +ReluMaxPool(2,2)
Dropout(0.5)Dropout(0.5)FC(128) + Relu
FC + SoftmaxFC + SoftmaxFC + Softmax
", + "bbox": [ + 173, + 804, + 821, + 919 + ], + "page_idx": 14 + }, + { + "type": "table", + "img_path": "images/f794efb8aaa8dd491508cb1da781c576c3834f69ba9a421c42ba723c5e898e0d.jpg", + "table_caption": [ + "Table 6: Approximation ratio between optimal loss and loss induced by single-step attack on MNIST. Architecture $\\mathbf { B } ^ { \\prime }$ is the same as B without the input dropout layer. " + ], + "table_footnote": [], + "table_body": "
AAadvBBadvB*BdvCCadvDDady
17%0%25%8%23%1%25%0%49%16%
", + "bbox": [ + 225, + 133, + 766, + 174 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 188, + 823, + 217 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "We find that input dropout (Srivastava et al., 2014) (i.e., randomly dropping a fraction of input features during training) as used in architecture B limits this unwarranted effect of adversarial training.2 If we omit the input dropout (we call this architecture $\\boldsymbol { \\mathrm { B } } ^ { * }$ ) the single-step attack degrades significantly. We discuss this effect in more detail below. For the fully connected architecture D, we find that the learned model is very close to linear and thus also less prone to the degenerate solution to the min-max problem, as we postulated in Section 3.3. ", + "bbox": [ + 173, + 223, + 825, + 310 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Attacks. Table 7 compares error rates of undefended and adversarially trained models on whitebox and black-box attacks, as in Section 4.1. Again, model B presents an anomaly. For all other models, we corroborate our findings on ImageNet for adversarial training: (1) black-box attacks trump white-box single-step attacks; (2) white-box single-step attacks are significantly stronger if prepended by a random step. For model $\\mathrm { \\Delta B _ { a d v } }$ , the opposite holds true. We believe this is because input dropout increases diversity of attack samples similarly to Ensemble Adversarial Training. ", + "bbox": [ + 173, + 320, + 825, + 405 + ], + "page_idx": 15 + }, + { + "type": "table", + "img_path": "images/7967edfa6290d020921bc7b23691337c62fe130733d53e12bb80222585fa1faf.jpg", + "table_caption": [ + "Table 7: White-box and black-box attacks against standard and adversarially trained models. For each model, the strongest single-step white-box and black box attacks are marked in bold. " + ], + "table_footnote": [], + "table_body": "
white-boxblack-box
FGSMR+FGSMFGSMAFGSMBFGSMB*FGSMcFGSMD
A64.769.7161.553.246.841.5
Aadv2.214.86.610.78.86.58.3
B85.086.045.7169.959.985.9
Badv11.611.16.48.98.54.96.1
B*75.774.144.372.8-46.062.6
Badv4.340.616.114.715.017.99.1
C81.881.840.255.849.5159.4
Cadv3.717.19.829.321.511.921.9
D92.495.461.374.168.965.1-
Dadv25.547.532.130.529.328.221.8
", + "bbox": [ + 223, + 454, + 771, + 662 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "While training with input dropout helps avoid the degradation of the single-step attack, it also significantly delays convergence of the model. Indeed, model $\\mathrm { \\Delta B _ { a d v } }$ retains relatively high error on white-box FGSM examples. Adversarial training with input dropout can be seen as comparable to training with a randomized single-step attack, as discussed in Section 4.1. ", + "bbox": [ + 174, + 675, + 825, + 731 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "The positive effect of input dropout is architecture and dataset specific: Adding an input dropout layer to models A, C and D confers only marginal benefit, and is outperformed by Ensemble Adversarial Training, discussed below. Moreover, Mishkin et al. (2017) find that input dropout significantly degrades accuracy on ImageNet. We thus did not incorporate it into our models on ImageNet. ", + "bbox": [ + 174, + 738, + 823, + 794 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Ensemble Adversarial Training. To evaluate Ensemble Adversarial Training 3.4, we train two models per architecture. The first, denoted $[ \\mathrm { A } \\mathrm { - } \\mathrm { D } ] _ { \\mathrm { a d v - e n s } }$ , uses a single pre-trained model of the same type (i.e., $\\mathbf { A } _ { \\mathrm { a d v - e n s } }$ is trained on perturbations from another model A). The second model, denoted [A$\\mathrm { D l a d v } { \\mathrm { - e n s } } 3$ , uses 3 pre-trained models $( \\{ A , C , D \\}$ or $\\{ B , C , D \\} )$ . We train all models for 12 epochs. ", + "bbox": [ + 174, + 805, + 825, + 863 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "We evaluate our models on black-box attacks crafted on models A,B,C,D (for a fair comparison, we do not use the same pre-trained models for evaluation, but retrain them with different random seeds). ", + "bbox": [ + 178, + 868, + 823, + 897 + ], + "page_idx": 15 + }, + { + "type": "table", + "img_path": "images/14d90c8d567374540515aa86fe7d0d9f1184d044dd406fd07c3536a991a47e79.jpg", + "table_caption": [ + "Table 8: Ensemble Adversarial Training on MNIST. For black-box robustness, we report the maximum and average error rate over a suite of 12 attacks, comprised of the FGSM, I-FGSM and PGD (Madry et al., 2017) attacks applied to models A,B,C and D. We use $\\epsilon = 1 6$ in all cases. For each model architecture, we mark the models tied for best (at a $9 5 \\%$ confidence level) in bold. " + ], + "table_footnote": [], + "table_body": "
CleanFGSMMax.Black BoxAvg. Black Box
Aadv0.82.210.87.7
Aadv-ens0.87.06.65.2
Aadv-ens30.75.46.54.3
Badv0.811.68.95.5
Badv-ens0.710.56.85.3
Badv-ens30.814.08.85.1
Cadv1.03.729.318.7
Cadv-ens1.31.917.210.7
Cadv-ens31.43.614.58.4
Dadv2.625.532.523.5
Dadv-ens2.621.538.628.0
Dadv-ens32.629.429.815.6
", + "bbox": [ + 271, + 162, + 723, + 372 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "The attacks we consider are the FGSM, I-FGSM and the PGD attack from Madry et al. (2017) with the loss function from Carlini & Wagner (2017a)), all with $\\epsilon = 0 . 3$ . The results appear in Table 8. For each model, we report the worst-case and average-case error rate over all black-box attacks. ", + "bbox": [ + 176, + 397, + 823, + 440 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Ensemble Adversarial Training significantly increases robustness to black-box attacks, except for architecture B, which we previously found to not suffer from the same overfitting phenomenon that affects the other adversarially trained networks. Nevertheless, model $\\mathrm { B _ { a d v - e n s } }$ achieves slightly better robustness to white-box and black-box attacks than $\\mathrm { \\Delta B _ { a d v } }$ . In the majority of cases, we find that using a single pre-trained model produces good results, but that the extra diversity of including three pre-trained models can sometimes increase robustness even further. Our experiments confirm our conjecture that robustness to black-box attacks generalizes across models. Indeed, we find that when training with three external models, we attain very good robustness against attacks initiated from models with the same architecture (as evidenced by the average error on our attack suite), but also increased robustness to attacks initiated from the fourth holdout model ", + "bbox": [ + 173, + 446, + 825, + 587 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "D TRANSFERABILITY OF RANDOMIZED SINGLE-STEP PERTURBATIONS. ", + "text_level": 1, + "bbox": [ + 171, + 621, + 785, + 637 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "In Section 4.1, we introduced the $\\mathbb { R } { + } \\mathbb { S }$ tep-LL attack, an extension of the Step-LL method that prepends the attack with a small random perturbation. In Table 9, we evaluate the transferability of $\\mathrm { R } +$ Step-LL adversarial examples on ImageNet. We find that the randomized variant produces perturbations that transfer at a much lower rate (see Table 1 for the deterministic variant). ", + "bbox": [ + 174, + 660, + 825, + 717 + ], + "page_idx": 16 + }, + { + "type": "table", + "img_path": "images/4be6059538e7d31a3a1decab63e6aa53aabc55d90b65e4f49c1e744d169d417c.jpg", + "table_caption": [ + "Table 9: Error rates $( \\mathbf { i n \\ } \\% )$ of randomized single-step attacks transferred between models on ImageNet. We use $\\mathrm { R } +$ Step-LL with $\\epsilon = 1 6 / 2 5 6 , \\alpha = \\epsilon / 2$ for 10,000 random test set samples. The white-box attack always outperforms black-box attacks. " + ], + "table_footnote": [], + "table_body": "
Source
Targetv4v3v3advIRv2IRv2ady
v470.537.223.234.024.6
v342.680.026.738.527.6
v3ady31.430.764.830.434.0
IRv236.235.723.056.324.6
IRv2adv26.826.325.226.937.5
", + "bbox": [ + 173, + 791, + 495, + 897 + ], + "page_idx": 16 + }, + { + "type": "table", + "img_path": "images/548041a9e9e7e640dbe05f0de1e62c4cbddcca3c6b8f69722906fedcd778b5b5.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Source
Targetv4v3v3advIRv2IRv2adv
v442.814.36.311.96.9
v318.057.18.015.68.6
v3ady10.710.437.110.112.9
IRv212.813.66.129.37.0
IRv2adv8.08.07.78.315.0
", + "bbox": [ + 504, + 792, + 826, + 897 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "E GRADIENT ALIGNED ADVERSARIAL SUBSPACES FOR THE $\\ell _ { \\infty }$ NORM ", + "text_level": 1, + "bbox": [ + 169, + 102, + 776, + 119 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Tramer et al. (2017) consider the following task for a given model \\` $h$ : for a (correctly classified) point $x$ , find $k$ orthogonal vectors $\\{ r _ { 1 } , \\ldots , r _ { k } \\}$ such that $\\lVert \\boldsymbol { r } _ { i } \\rVert _ { 2 } \\leq \\epsilon$ and all the $\\boldsymbol { x } + \\boldsymbol { r } _ { i }$ are adversarial (i.e., arg max $h ( x + r _ { i } ) \\neq y _ { \\mathrm { t r u e } } )$ . By linearizing the model’s loss function, this reduces to finding $k$ orthogonal vectors $r _ { i }$ that are maximally aligned with the model’s gradient $g = \\nabla _ { x } L ( h ( x ) , \\hat { y _ { \\mathrm { t r u e } } } )$ . Tramer et al. (2017) left a construction for the\\` $\\ell _ { \\infty }$ norm as an open problem. ", + "bbox": [ + 173, + 131, + 825, + 204 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "We provide an optimal construction for the $\\ell _ { \\infty }$ norm, based on Regular Hadamard Matrices (Colbourn, 2010). Given the $\\ell _ { \\infty }$ constraint, we find orthogonal vectors $r _ { i }$ that are maximally aligned with the signed gradient, $\\mathtt { s i g n } ( g )$ . We first prove an analog of (Tramer et al., 2017, Lemma 1). \\` ", + "bbox": [ + 174, + 209, + 825, + 252 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Lemma 6. Let $v \\in \\{ - 1 , 1 \\} ^ { d }$ and $\\alpha \\in ( 0 , 1 )$ . Suppose there are $k$ orthogonal vectors $r _ { 1 } , \\ldots r _ { n } \\in$ $\\{ - 1 , 1 \\} ^ { d }$ satisfying $v ^ { \\top } r _ { i } \\geq \\alpha \\cdot d .$ . Then $\\alpha \\leq { k ^ { - \\frac { 1 } { 2 } } }$ . ", + "bbox": [ + 173, + 256, + 823, + 290 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Proof. Let $\\begin{array} { r } { \\hat { r _ { i } } = \\frac { r _ { i } } { \\Vert r _ { i } \\Vert _ { 2 } } = \\frac { r _ { i } } { \\sqrt { d } } } \\end{array}$ . Then, we have ", + "bbox": [ + 174, + 303, + 468, + 324 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/f2e38f4be0edea35abc342b4470994b5d5019d7e07b8ec4f5d373271c5e314df.jpg", + "text": "$$\nd = \\| \\boldsymbol { v } \\| _ { 2 } ^ { 2 } \\geq \\sum _ { i = 1 } ^ { k } | \\boldsymbol { v } ^ { \\top } \\hat { \\boldsymbol { r _ { i } } } | ^ { 2 } = d ^ { - 1 } \\sum _ { i = 1 } ^ { k } | \\boldsymbol { v } ^ { \\top } \\boldsymbol { r _ { i } } | ^ { 2 } \\geq d ^ { - 1 } \\cdot k \\cdot \\left( { \\boldsymbol { \\alpha } } \\cdot d \\right) ^ { 2 } = k \\cdot \\alpha ^ { 2 } \\cdot d \\ ,\n$$", + "text_format": "latex", + "bbox": [ + 243, + 324, + 753, + 369 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "from which we obtain $\\alpha \\leq k ^ { - { \\frac { 1 } { 2 } } }$ . ", + "bbox": [ + 174, + 375, + 390, + 390 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "This result bounds the number of orthogonal perturbations we can expect to find, for a given alignment with the signed gradient. As a warm-up consider the following trivial construction of $k$ orthogonal vectors in $\\{ - 1 , 1 \\} ^ { d }$ that are “somewhat” aligned with $\\mathtt { s i g n } ( g )$ . We split $\\mathtt { s i g n } ( g )$ into $k$ “chunks” of size $\\frac { d } { k }$ and define $r _ { i }$ to be the vector that is equal to $\\mathtt { s i g n } ( g )$ in the $i ^ { \\mathrm { t h } }$ chunk and zero otherwise. We obtain $\\begin{array} { r } { \\mathrm { s i g n } ( g ) ^ { \\top } r _ { i } = \\frac { d } { k } } \\end{array}$ , a factor $\\sqrt { k }$ worse than the the bound in Lemma 6. ", + "bbox": [ + 173, + 404, + 825, + 486 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "We now provide a construction that meets this upper bound. We make use of Regular Hadamard Matrices of order $k$ (Colbourn, 2010). These are square matrices $H _ { k }$ such that: (1) all entries of √ $H _ { k }$ are in $\\{ - 1 , 1 \\} ^ { k }$ ; (2) the rows of $H _ { k }$ are mutually orthogonal; (3) All row sums are equal to $\\sqrt { k }$ . ", + "bbox": [ + 174, + 489, + 825, + 536 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "The order of a Regular Hadamard Matrix is of the form $4 u ^ { 2 }$ for an integer $u$ . We use known constructions for $k \\overset { \\cdot } { \\in } \\{ 4 , 1 6 , 3 6 , 6 4 , 1 0 0 \\}$ . ", + "bbox": [ + 176, + 542, + 820, + 574 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Lemma 7. Let $\\boldsymbol { g } \\in \\mathbb { R } ^ { d }$ and $k$ be an integer for which a Regular Hadamard Matrix of order $k$ exists. Then, there is a randomized construction of $k$ orthogonal vectors $r _ { 1 } , . . . r _ { n } \\in \\{ - 1 , 1 \\} ^ { d }$ , such that $s i g n ( g ) ^ { \\top } r _ { i } = d \\cdot k ^ { - 1 / 2 }$ . Moreover, $\\mathbb { E } [ g ^ { \\top } r _ { i } ] = k ^ { - 1 / 2 } \\cdot \\lVert g \\rVert _ { 1 }$ . ", + "bbox": [ + 174, + 577, + 825, + 627 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Proof. We construct $k$ orthogonal vectors $r _ { 1 } , \\ldots , r _ { k } \\in \\{ - 1 , 1 \\} ^ { d }$ , where $r _ { i }$ is obtained by repeating the $\\mathrm { i } ^ { \\mathrm { t h } }$ row of $H _ { k } \\ d / k$ times (for simplicity, we assume that $k$ divides $d$ . Otherwise we pad $r _ { i }$ with zeros). We then multiply each $r _ { i }$ component-wise with $\\mathtt { s i g n } ( g )$ . By construction, the $k$ vectors $r _ { i } \\in \\{ - 1 , 1 \\} ^ { d }$ are mutually orthogonal, and we have $\\begin{array} { r } { \\mathrm { s i g n } ( g ) ^ { \\top } r _ { i } = \\frac { d } { k } \\cdot \\sqrt { k } = d \\cdot k ^ { - 1 / 2 } } \\end{array}$ , which is tight according to Lemma 6. ", + "bbox": [ + 173, + 642, + 825, + 719 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "As the weight of the gradient $g$ may not be uniformly distributed among its $d$ components, we apply our construction to a random permutation of the signed gradient. We then obtain ", + "bbox": [ + 173, + 726, + 821, + 756 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/af4f888667eda85a9f15c4424ad4a3d59e967346e9de7fe74800593f72ac6847.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathbb { E } [ g ^ { \\top } \\boldsymbol { r } _ { i } ] = \\mathbb { E } \\left[ \\displaystyle \\sum _ { j = 1 } ^ { d } \\vert g ^ { ( j ) } \\vert \\cdot \\mathsf { s i g n } ( g ^ { ( j ) } ) \\cdot r _ { i } ^ { ( j ) } \\right] } \\\\ & { \\quad \\quad = \\displaystyle \\sum _ { j = 1 } ^ { d } \\vert g ^ { ( j ) } \\vert \\cdot \\mathbb { E } \\left[ \\mathsf { s i g n } ( g ^ { ( j ) } ) \\cdot r _ { i } ^ { ( j ) } \\right] = k ^ { - 1 / 2 } \\cdot \\| g \\| _ { 1 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 295, + 757, + 700, + 849 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "It can be shown that the bound in Lemma 7 can be attained if and only if the $r _ { i }$ are constructed from the rows of a Regular Hadamard Matrix (Colbourn, 2010). For general integers $k$ for which no such matrix exists, other combinatorial designs may be useful for achieving looser bounds. ", + "bbox": [ + 173, + 878, + 825, + 921 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "F ILLUSTRATIONS OF GRADIENT MASKING IN ADVERSARIAL TRAINING ", + "text_level": 1, + "bbox": [ + 169, + 102, + 794, + 118 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "In Section 3.3, we show that adversarial training introduces spurious curvature artifacts in the model’s loss function around data points. As a result, one-shot attack strategies based on first-order approximations of the model loss produce perturbations that are non-adversarial. In Figures 4 and 5 we show further illustrations of this phenomenon for the Inception ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ model trained on ImageNet by Kurakin et al. (2017b) as well as for the model $\\mathbf { A } _ { \\mathrm { a d v } }$ we trained on MNIST. ", + "bbox": [ + 173, + 133, + 825, + 204 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/923595c61cad34fb814eb73c6c063c03833140695ae2f1302f3f857f5a158110.jpg", + "image_caption": [ + "Figure 4: Additional illustrations of the local curvature artifacts introduced by adversarial training on ImageNet. We plot the loss of model ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ on samples of the form $x ^ { * } = \\stackrel { \\cdot } { x } + \\epsilon _ { 1 } \\cdot g + \\epsilon _ { 2 } .$ · $g ^ { \\perp }$ , where $g$ is the signed gradient of ${ \\mathrm { v } } 3 _ { \\mathrm { a d v } }$ and $g ^ { \\perp }$ is an orthogonal adversarial direction, obtained from an Inception v4 model. The right-side plots are zoomed in versions of the left-side plots. " + ], + "image_footnote": [], + "bbox": [ + 251, + 227, + 732, + 843 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/80a137c74b4999940442ab91d53cd66f2fe0e469a712fe75d67af8e599265474.jpg", + "image_caption": [ + "Figure 5: Illustrations of the local curvature artifacts introduced by adversarial training on MNIST. We plot the loss of model $\\mathbf { A _ { \\mathrm { a d v } } }$ on samples of the form $x ^ { * } = x + \\epsilon _ { 1 } \\cdot g + \\epsilon _ { 2 } \\cdot g ^ { \\perp }$ , where $g$ is the signed gradient of model $\\mathbf { A } _ { \\mathrm { a d v } }$ and $g ^ { \\perp }$ is an orthogonal adversarial direction, obtained from model B. The right-side plots are zoomed in versions of the left-side plots. " + ], + "image_footnote": [], + "bbox": [ + 200, + 184, + 818, + 779 + ], + "page_idx": 19 + } +] \ No newline at end of file