Improving Adversarial Transferability with Neighbourhood Gradient Information
Haijing Guo, Jiafeng Wang, Zhaoyu Chen, Kaixun Jiang, Lingyi Hong, Pinxue Guo, Jinglun Li, Wenqiang Zhang
TL;DR
This paper introduces Neighbourhood Gradient Information (NGI) as a source of highly transferable gradient signals for black-box adversarial attacks. It proposes NGI-Attack with two mechanisms—Example Backtracking to accumulate NGI and Multiplex Mask to diversify gradient information across non-discriminative regions—delivering high transferability without extra computation. Empirical results on ImageNet show substantial improvements across single-model, ensemble-model, and defense-model settings, including strong performance against robust defenses like RS and DiffPure. The approach is plug-and-play with existing methods and highlights critical considerations for evaluating and strengthening model robustness against transferable adversarial examples.
Abstract
Deep neural networks (DNNs) are known to be susceptible to adversarial examples, leading to significant performance degradation. In black-box attack scenarios, a considerable attack performance gap between the surrogate model and the target model persists. This work focuses on enhancing the transferability of adversarial examples to narrow this performance gap. We observe that the gradient information around the clean image, i.e., Neighbourhood Gradient Information (NGI), can offer high transferability.Based on this insight, we introduce NGI-Attack, incorporating Example Backtracking and Multiplex Mask strategies to exploit this gradient information and enhance transferability. Specifically, we first adopt Example Backtracking to accumulate Neighbourhood Gradient Information as the initial momentum term. Then, we utilize Multiplex Mask to form a multi-way attack strategy that forces the network to focus on non-discriminative regions, which can obtain richer gradient information during only a few iterations. Extensive experiments demonstrate that our approach significantly enhances adversarial transferability. Especially, when attacking numerous defense models, we achieve an average attack success rate of 95.2%. Notably, our method can seamlessly integrate with any off-the-shelf algorithm, enhancing their attack performance without incurring extra time costs.
