Leveraging Information Consistency in Frequency and Spatial Domain for Adversarial Attacks
Zhibo Jin, Jiayu Zhang, Zhiyu Zhu, Xinyi Wang, Yiyun Huang, Huaming Chen
TL;DR
The paper addresses the susceptibility of deep neural networks to adversarial perturbations by proposing a frequency-spatial consistency framework (FSA) that aligns gradient information across both the spatial domain and the frequency domain via DCT/IDCT transforms. By computing and reconciling spatial and frequency gradients through a binary consistency mask, FSA directs perturbations to maximize misclassification under a budget while decoupling from model parameters. Empirical results across multiple white-box attacks show state-of-the-art improvements, with up to 28.98% relative gain and an average improvement of 5.23%, validating the efficacy of cross-domain consistency in adversarial generation. The work highlights the importance of considering multi-domain information when crafting adversarial examples and provides code for reproducibility.
Abstract
Adversarial examples are a key method to exploit deep neural networks. Using gradient information, such examples can be generated in an efficient way without altering the victim model. Recent frequency domain transformation has further enhanced the transferability of such adversarial examples, such as spectrum simulation attack. In this work, we investigate the effectiveness of frequency domain-based attacks, aligning with similar findings in the spatial domain. Furthermore, such consistency between the frequency and spatial domains provides insights into how gradient-based adversarial attacks induce perturbations across different domains, which is yet to be explored. Hence, we propose a simple, effective, and scalable gradient-based adversarial attack algorithm leveraging the information consistency in both frequency and spatial domains. We evaluate the algorithm for its effectiveness against different models. Extensive experiments demonstrate that our algorithm achieves state-of-the-art results compared to other gradient-based algorithms. Our code is available at: https://github.com/LMBTough/FSA.
