Adaptive Perturbation for Adversarial Attack

Abstract

In recent years, the security of deep learning models achieves more and more attentions with the rapid development of neural networks, which are vulnerable to adversarial examples. Almost all existing gradient-based attack methods use the sign function in the generation to meet the requirement of perturbation budget on $L_{\infty }$ norm. However, we find that the sign function may be improper for generating adversarial examples since it modifies the exact gradient direction. Instead of using the sign function, we propose to directly utilize the exact gradient direction with a scaling factor for generating adversarial perturbations, which improves the attack success rates of adversarial examples even with fewer perturbations. At the same time, we also theoretically prove that this method can achieve better black-box transferability. Moreover, considering that the best scaling factor varies across different images, we propose an adaptive scaling factor generator to seek an appropriate scaling factor for each image, which avoids the computational cost for manually searching the scaling factor. Our method can be integrated with almost all existing gradient-based attack methods to further improve their attack success rates. Extensive experiments on the CIFAR10 and ImageNet datasets show that our method exhibits higher transferability and outperforms the state-of-the-art methods.

Accepted by IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI). 18 pages, 7 figures, 14 tables

References in corpus (9)

• ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Models
• Certified Adversarial Robustness via Randomized Smoothing
• Fast is better than free: Revisiting adversarial training
• Shake-Shake regularization
• A study of the effect of JPG compression on adversarial images
• Improving Adversarial Robustness via Promoting Ensemble Diversity
• DVERGE: Diversifying Vulnerabilities for Enhanced Robust Generation of Ensembles
• Certified Robustness for Top-k Predictions against Adversarial Perturbations via Randomized Smoothing
• Dual Path Networks