Transferable Sparse Adversarial Attack
Ziwen He, Wei Wang, Jing Dong, Tieniu Tan

TL;DR
This paper introduces a generator-based method for creating sparse adversarial attacks on neural networks that significantly improves transferability and speed compared to previous approaches.
Contribution
A novel generator architecture that decouples amplitude and position for sparse perturbations, enhancing transferability and inference speed in adversarial attacks.
Findings
Improved transferability by a large margin over state-of-the-art methods.
Achieves 700× faster inference speed than optimization-based methods.
Effectively crafts transferable sparse adversarial examples.
Abstract
Deep neural networks have shown their vulnerability to adversarial attacks. In this paper, we focus on sparse adversarial attack based on the norm constraint, which can succeed by only modifying a few pixels of an image. Despite a high attack success rate, prior sparse attack methods achieve a low transferability under the black-box protocol due to overfitting the target model. Therefore, we introduce a generator architecture to alleviate the overfitting issue and thus efficiently craft transferable sparse adversarial examples. Specifically, the generator decouples the sparse perturbation into amplitude and position components. We carefully design a random quantization operator to optimize these two components jointly in an end-to-end way. The experiment shows that our method has improved the transferability by a large margin under a similar sparsity setting compared with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Physical Unclonable Functions (PUFs) and Hardware Security · Advanced Malware Detection Techniques
