In the previous post we reviewed some well-known methods for black-box decision-based adversarial attacks where the adversary has no knowledge about the victim model except for its discrete hard-label predictions, thus gradient-based methods become ineffective but simple random-walk based methods such as the Boundary Attack can still represent a threat even under these particular settings. Now that we have introduced both white and black-box attacks under different threat models, we are going to conclude this series by understanding how models can be, sometimes unsuccessfully, defended against these malicious attacks.

### Overview

This post is part of a **collection** including the following 6 posts:

- Threat models;
- White-box attacks;
- Black-box transfer-based attacks;
- Black-box score-based attacks;
- Black-box decision-based attacks;
- Defence methods (current post).

### Defence methods

Given the variety and the effectiveness of the existing adversarial attacks methods, it is very important to keep deep learning models safe and make their applications reliable. However, since *the cure shouldn’t be worse than the disease*, researchers have outlined some design requirements for defenses against adversarial perturbations so to ensure model’s performance is not degraded (link):

**Low impact on the architectur**e: techniques should limit the modifications made to the architecture to avoid abnormal behaviors.**Maintain accuracy**: defenses against adversarial samples should not decrease the model’s classification accuracy.**Maintain speed of network**: the solutions should not significantly impact the running time of the classiﬁer at test time.**Defenses should work for adversarial samples relatively close to points in the training dataset**: samples that are very far away from the training dataset are irrelevant to security because they can easily be detected, at least by humans.

Thus, extensive research has been conducted in this direction in order to build robust model to guard them against adversarial attacks. As for the attack methods, also defence methods can be split into different categories based on the strategy these methods employ. Defence techniques can then be classified into five categories such as:

**Robust training**: These kind of techniques aim to make a classifier robust against small internal perturbations. One possible strategy is based on adversarial training by augmenting the training data adding adversarially generated examples, or defensive distillation which consists of retraining a network using previously generated soft-labels. Another possible way consists of training robust models with regularization such as those based on the Lipschitz constant, or perturbation norm.**Input transformation**: These methods take advantage of the fact that several defenses aim at transforming the inputs right before feeding them to the classifier. Among them we have JPG compression, and feature squeezing such as total variance minimization and image quilting. More sophisticated methods project adversarial examples onto the data distribution through generative models.**Randomization**: Randomness-based defence methods add randomness to either the input such as resizing or padding, or adding randomness to the model parameters so to mitigate the effect of adversarial examples.**Model ensemble**: Ensemble methods can be used also for defence purposes. Besides just aggregating outputs from each model in the ensemble, some methods average the predictions over random noises injected to the model. Similarly, can be also introduced a regularizer to promote the diversity among the predictions of different models.

Note that these categories are not exclusive, that is, a defence method can belong to many categories. In order to avoid creating confusion, in the following sections we are going to describe several methods and, at the end of this section, we are going to summarize their respective category in a specific table.

### Adversarial training

**Adversarial training** is a very simple and intuitive defence method to protect a model against adversarial examples. It consists of generating adversarial examples using different attacks methods on the target model. In the second step, those adversarial examples are used merged to the original training set so to form an augmented training set and finally the target model is retrained on the augmented training set. During the retraining phase, along with the model’s objective function, it can be minimized also an adversarial objective function which can work as an effective regularizer. Evaluating this defence method, the corresponding authors found that without adversarial training, the error rate of a target model was 89.4% on adversarial examples based on the FGSM. Conversely, With adversarial training, the error rate fell to 17.9% on the same set of adversarial examples. (link)

### Parseval regularization

**Parseval regularization** is a layerwise regularization method for reducing the network’s sensitivity to small perturbations by carefully controlling its global Lipschitz constant. It works by constraining the Lipschitz constant of each hidden layer to be smaller than one. That way, it avoids the exponential growth of the Lipschitz constant, and a usual regularization scheme (i.e., weight decay) at the last layer then controls the overall Lipschitz constant of the network. To enforce these constraints in practice, network trained with Parseval regularization combine two ideas: maintaining orthonormal rows in linear and convolutional layers, and performing convex combinations in aggregation layers. As a consequence of this regularization method, models train faster and make a better use of their capacity. (link)

### Cross-Lipschitz regularization

**Cross-Lipschitz regularization** is a regularization constraint whose goal is to make the differences of the classifier functions at the input learned images as constant as possible. Cross-Lipschitz regularized object function is defined as:

where x_{i}, *i*=1,…,*n*, are training data, and *f*_{y}(*x*) is the probability of classifier *f* given to the class *y*. Hence, this loss function tries to minimize the equation above, thus it maximizes *f*_{c}(*x*_{i})-*f*_{j}(*x*_{i}) and at the same time keeps ||∇f_{l}(*x*_{i})-∇ f_{m}(*x*_{i})||_{2}^{2}) small uniformly over all classes. The authors of this method proved that training with Cross-Lipschitz regularization automatically enforces robustness of the resulting classifier. (link)

### Deep Defence

Many methods regularization-based defence methods approximate the learning objective of the target network. However, this may lead to a degraded prediction accuracy on the test set or lack of robustness against advanced adversarial examples. Therefore, **Deep Defence**, proposes to jointly optimize the original network objective and a scaled ||∇_{x}||_{p} used as regularization. Thus, it aims at minimizing:

where ||∇_{x}||_{p} can be generated with any attack method (i.e. DeepFool). The term R(||∇_{xk}||_{p}/||*x*_{k}||_{p}) is calculated by means of a recursive-flavoured regularizer network. It takes an image *x*_{k} as input and calculates each perturbed component for ||∇_{x}||_{p} by utilizing an incorporated multi-layer attack module. F is the index set of misclassified training samples, while the correct classified ones are indexed by T. The constants *c,d*>0 are two scaling factors that balance the importance of different samples, and R is chosen as the exponential function. This kind of regularization penalizes more on the correctly classified abnormal samples with small ||∇_{x}||_{p} than those with relatively large ones so to not penalize robust samples with high value of ||∇_{x}||_{p}. Deep Defence not only outperforms adversarial learning and Parseval regularization by large margins on various datasets, but also ensures it does not degrade the accuracy on benign samples. (link)

### Defensive distillation

Distillation is a technique used to reduce the size of DNN architectures or so as to reduce their computing resource needs . It consists of training a distilled network f_{d} using the classification predictions of the original network *f*. The intuition behind this method is that training with soft-labels provides additional knowledge compared to hard-labels since they encode the relative differences between classes. Thus, it has been proposed to utilize this method, known as **defensive distillation**, to train robust classifiers. The main difference between defensive distillation and the original distillation proposed is that *f* and f_{d} have the same architecture. This difference is justified since the goal of defensive distillation is resilience instead of compression. This defense method also dramatically reduces gradients magnitude, thus making it more difficult to generate adversarial examples for gradient-based methods. (link)

### Input transformations

On of the most simple and naive methods to defend a targeted network by input transformation consists of a **JPG compression** of the input themselves. However, even for simple methods such as FGSM, JPG compression can not always reverse the drop in classification and its performance degrade rapidly as the magnitude of the perturbations increases. (link)

Another approach called **feature squeezing**, reduces the degrees of freedom available to an adversary by squeezing out unnecessary input so to provide less opportunities for an adversary to construct adversarial examples. If the model’s prediction on the original sample and on the squeezed sample produce different outputs, then the input is likely to be adversarial. Feature squeezing techniques include reducing the color bit depth of each pixel and spatial smoothing. Adversarial perturbations can be partially removed via variance minimization. It randomly selects a small set of pixels, and reconstructs the simplest image that is consistent with the selected pixels. The reconstructed image does not contain the adversarial perturbations because these perturbations tend to be small and localized.

A similar approach is image quilting. It removes adversarial perturbations by constructing a patch database

that only contains patches from benign images. Using K-neighbors it select the patches used to create the transformed image so that it consists of pixels that were not modified by the adversary. (link)

### Defence-GAN

**Defence-GAN** is a defence that uses a WGAN trained on legitimate training samples so to learn to remove perturbations on adversarial examples. At inference time, it first generates some random samples z_{i} and finds z* as

where G is a generator and and *x* is the image to be classified. Finally, G(z*) is given as the input to the classifier. The equation above is a highly non-convex minimization problem which can be approximated by doing a fixed number of gradient descent steps. Once appropriately trained, generated clean images and their reconstruction should not differ too much. (link)

### Resizing & Padding

A simple form of input randomization consists of random **resizing** and random **zero-padding** the input images . This techniques make the model more robust to adversarial images and usually don’t hurt the performance on benign images. They also don’t require many computations and can be combined with other defence methods such as adversarial training. (link)

### SAP

A model randomization approach known as **Stochastic Activation Pruning** (SAP), inspired by dropout technique, consists of stochastically dropout nodes in each layer during forward propagation. Nodes with higher magnitude have more probability to be retained and the surviving nodes are scaled up so to preserve the dynamic range of the activations in each layer. In the case where most of the nodes are retained, namely, that fewer parameters of the network are pruned, then the scaling factor is close to 1, and it performs almost identically to the original model. Conversely, when a huge number of nodes are pruned, model’s accuracy will drop compared to its original accuracy, but the introduced stochasticity has more chance to deceive the adversary. Unlike dropout, SAP can be applied to pretrained models without significant loss of accuracy. (link)

### Adv-BNN

The authors of **Adv-BNN** noticed that adding noise blindly to all the layers is not the optimal way to incorporate randomness. Hence, they opted to learn the best model distribution under adversarial attacks under the framework of Bayesian Neural Network (BNN). The only difference between Adv-BNN and standard BNN training is that the expectation is taken over the adversarial examples (x_{adv}, *y*) and not over (*x*, *y*). Therefore, at each iteration it is first applied a randomized PGD attack for a certain number of iterations so to find an adversarial example x_{adv}, and then x_{adv} is used to maximize the ELBO. During training, it is used the Bayes by Backprop algorithm and the reparameterization trick to update the learnable mean and variance used to the define a gaussian from the which sampling the weights of the BNN at inference time. Finally, this method can be combined with adversarial training to further improve its performance. (link)

### RSE

**Random Self Ensemble** (RSE) is a defence method combining randomness and ensemble. Randomness is due to noisy layers, inserted before each convolutional layer, that add random noise to the input vector. During training, the noise is generated randomly for each stochastic gradient descent update and the training procedure can be considered as minimizing the upper bound of the loss of model ensemble. Ensemble is because during inference, are performed several forward propagation passes, each time with different prediction scores due to the noise layers. Note that this is equivalent to ensemble an infinite number of noisy models without any additional memory overhead. Then, during prediction, their logits as summed as the resulting class is chosen as

Thus, this method bring to main benefits: one is that perturbing the gradient can fool gradient-based attacks. The other is that ensemble method can improve the testing accuracy. (link)

### ADP

To focus on ensemble diversity, it can be used an **adaptive diversity promoting** (ADP) regularizer. It consists of two terms: a logarithm of ensemble diversity (LED) and an ensemble Shennon entropy term, and it is trained minimizing the difference between the ADP and the ensemble cross entropy loss. Its goal is thus to encourage non-maximal predictions of each member in the ensemble to be mutually orthogonal, while keeping the maximal prediction be consistent with the true label. The reason under this form of regularization is that a high diversity or inconsistency on the non-maximal predictions can lower down the transferability of adversarial examples among the networks, and further lead to better robustness of the ensemble. (link)

### Summary table

### References

- References are linked at the end of their corresponding section.

Very interesting!

LikeLike