Learning Ordered Top-k Adversarial Attacks via Adversarial Distillation
Zekun Zhang, Tianfu Wu
Abstract
Deep Neural Networks (DNNs) are vulnerable to adversarial attacks, especially white-box targeted attacks. This paper studies the problem of how aggressive white-box targeted attacks can be to go beyond widely used Top-1 attacks. We propose to learn ordered Top-k attacks (k ≥ 1), which enforce the Top-k predicted labels of an adversarial example to be the k (randomly) selected and ordered labels (the ground-truth label is exclusive). Two methods are presented. First, we extend the vanilla Carlini-Wagner (C&W) method and use it as a strong baseline. Second, we present an Adversarial Distillation (AD) framework consisting of two components: (i) Computing an adversarial probability distribution for a given ordered Top-k targeted labels. (ii) Learning adversarial examples by minimizing the Kullback-Leibler (KL) divergence between the adversarial distribution and the predicted distribution, together with the perturbation energy penalty. In computing adversarial distributions, we explore how to leverage label semantic similarities, leading to knowledge-oriented attacks. In experiments, we test Top-k (k = 1, 2, 5, 10) attacks in the ImageNet-1000 val dataset using three representative DNNs trained with the clean ImageNet-1000 train dataset, ResNet-50 [11], DenseNet-121 [14] and AOGNet-12M [21]. Overall, the proposed AD approach obtains the best results, especially by a large margin when computation budget is limited. It reduces the perturbation energy consistently with the same attack success rate on all the four k's, and improve the attack success rate by a large margin against the modified C&W method for k = 10.