Enhancing Adversarial Transferability via Information Bottleneck Constraints
Not on the map. Why?
Abstract (arXiv)
From the perspective of information bottleneck (IB) theory, we propose a novel framework for performing black-box transferable adversarial attacks named IBTA, which leverages advancements in invariant features. Intuitively, diminishing the reliance of adversarial perturbations on the original data, under equivalent attack performance constraints, encourages a greater reliance on invariant features that contributes most to classification, thereby enhancing the transferability of adversarial attacks. Building on this motivation, we redefine the optimization of transferable attacks using a novel theoretical framework that centers around IB. Specifically, to overcome the challenge of unoptimizable mutual information, we propose a simple and efficient mutual information lower bound (MILB) for approximating computation. Moreover, to quantitatively evaluate mutual information, we utilize the Mutual Information Neural Estimator (MINE) to perform a thorough analysis. Our experiments on the ImageNet dataset well demonstrate the efficiency and scalability of IBTA and derived MILB. Our code is available at https://github.com/Biqing-Qi/Enhancing-Adversarial-Transferability-via-Information-Bottleneck-Constraints.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 35 references that are in the map. First posted on arXiv 8 Jun 2024.
Builds on
26 of 35 references.
References · 26
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2013Intriguing properties of neural networkscited by 5,155
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
- 2016Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learningcited by 1,512
- 2016Deep Variational Information Bottleneckcited by 930
- 2015Deep Learning and the Information Bottleneck Principlecited by 802
14 more
- 2018MINE: Mutual Information Neural Estimationcited by 683
- 2016Delving into Transferable Adversarial Examples and Black-box Attackscited by 536
- 2019Evading Defenses to Transferable Adversarial Examples by Translation-Invariant Attackscited by 442
- 2019Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attackscited by 355
- 2021Enhancing the Transferability of Adversarial Attacks through Variance Tuningcited by 244
- 2021Admix: Enhancing the Transferability of Adversarial Attackscited by 156
- 2022Frequency Domain Model Augmentation for Adversarial Attackcited by 130
- 2020On Success and Simplicity: A Second Look at Transferable Targeted Attackscited by 89
- 2022Boosting the Transferability of Adversarial Attacks with Reverse Adversarial Perturbationcited by 68
- 2021On Generating Transferable Targeted Perturbationscited by 65
- 2022Improving the Transferability of Targeted Adversarial Examples through Object-Based Diverse Inputcited by 50
- 2021Improving the Transferability of Adversarial Examples with Resized-Diverse-Inputs, Diversity-Ensemble and Region Fittingcited by 37
- 2023Improving the Transferability of Adversarial Samples by Path-Augmented Methodcited by 36
- 2022Enhancing the Self-Universality for Transferable Targeted Attackscited by 30
Built on by
Not cited yet.