Fine-Grained Iterative Adversarial Attacks with Limited Computation Budget
Not on the map. Why?
Abstract (arXiv)
This work tackles a critical challenge in AI safety research under limited compute: given a fixed computation budget, how can one maximize the strength of iterative adversarial attacks? Coarsely reducing the number of attack iterations lowers cost but substantially weakens effectiveness. To fulfill the attainable attack efficacy within a constrained budget, we propose a fine-grained control mechanism that selectively recomputes layer activations across both iteration-wise and layer-wise levels. Extensive experiments show that our method consistently outperforms existing baselines at equal cost. Moreover, when integrated into adversarial training, it attains comparable performance with only 30% of the original budget.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 26 references that are in the map. First posted on arXiv 30 Oct 2025.
Builds on
17 of 26 references.
References · 17
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2016Adversarial examples in the physical worldcited by 1,762
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2019Square Attack: a query-efficient black-box adversarial attack via random searchcited by 682
- 2018Improving Transferability of Adversarial Examples with Input Diversitycited by 591
- 2017One pixel attack for fooling deep neural networkscited by 579
- 2017Decision-Based Adversarial Attacks: Reliable Attacks Against Black-Box Machine Learning Modelscited by 459
- 2019Evading Defenses to Transferable Adversarial Examples by Translation-Invariant Attackscited by 440
- 2019Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attackscited by 352
5 more
- 2019HopSkipJumpAttack: A Query-Efficient Decision-Based Attackcited by 328
- 2019Topology Attack and Defense for Graph Neural Networks: An Optimization Perspectivecited by 196
- 2018Prior Convictions: Black-Box Adversarial Attacks with Bandits and Priorscited by 145
- 2018SparseFool: a few pixels make a big differencecited by 94
- 2017Boosting Adversarial Attacks with Momentumcited by 23
Built on by
Not cited yet.