Accelerating Targeted Hard-Label Adversarial Attacks in Low-Query Black-Box Settings
Arjhun Swaminathan, Mete Akg\"un

TL;DR
This paper introduces TEA, a novel black-box adversarial attack leveraging edge information from target images to reduce query counts and improve attack efficiency in low-query scenarios.
Contribution
The paper proposes TEA, a new targeted attack method that uses edge information to generate adversarial examples more efficiently in black-box settings.
Findings
TEA reduces query count by nearly 70% compared to existing methods.
TEA outperforms state-of-the-art attacks across different models.
TEA enhances target initialization for geometry-based attacks.
Abstract
Deep neural networks for image classification remain vulnerable to adversarial examples -- small, imperceptible perturbations that induce misclassifications. In black-box settings, where only the final prediction is accessible, crafting targeted attacks that aim to misclassify into a specific target class is particularly challenging due to narrow decision regions. Current state-of-the-art methods often exploit the geometric properties of the decision boundary separating a source image and a target image rather than incorporating information from the images themselves. In contrast, we propose Targeted Edge-informed Attack (TEA), a novel attack that utilizes edge information from the target image to carefully perturb it, thereby producing an adversarial image that is closer to the source image while still achieving the desired target classification. Our approach consistently outperforms…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
