GSBA$^K$: $top$-$K$ Geometric Score-based Black-box Attack
Abstract
Existing score-based adversarial attacks mainly focus on crafting -1 adversarial examples against classifiers with single-label classification. Their attack success rate and query efficiency are often less than satisfactory, particularly under small perturbation requirements; moreover, the vulnerability of classifiers with multi-label learning is yet to be studied. In this paper, we propose a comprehensive surrogate free score-based attack, named \b geometric \b score-based \b black-box \b attack (GSBA), to craft adversarial examples in an aggressive - setting for both untargeted and targeted attacks, where the goal is to change the - predictions of the target classifier. We introduce novel gradient-based methods to find a good initial boundary point to attack. Our iterative method employs novel gradient estimation techniques, particularly effective in - setting, on the decision boundary to effectively exploit the geometry of the decision boundary. Additionally, GSBA can be used to attack against classifiers with - multi-label learning. Extensive experimental results on ImageNet and PASCAL VOC datasets validate the effectiveness of GSBA in crafting - adversarial examples.
Keywords
Cite
@article{arxiv.2503.12827,
title = {GSBA$^K$: $top$-$K$ Geometric Score-based Black-box Attack},
author = {Md Farhamdur Reza and Richeng Jin and Tianfu Wu and Huaiyu Dai},
journal= {arXiv preprint arXiv:2503.12827},
year = {2025}
}
Comments
License changed to CC BY 4.0 to align with ICLR 2025. No changes to content. Published at: https://openreview.net/forum?id=htX7AoHyln