Improving the Convergence Rate of Ray Search Optimization for Query-Efficient Hard-Label Attacks
DOI:
https://doi.org/10.1609/aaai.v40i14.38127Abstract
In hard-label black-box adversarial attacks, where only the top-1 predicted label is accessible, the prohibitive query complexity poses a major obstacle to practical deployment. In this paper, we focus on optimizing a representative class of attacks that search for the optimal ray direction yielding the minimum ℓ₂-norm perturbation required to move a benign image into the adversarial region. Inspired by Nesterov's Accelerated Gradient (NAG), we propose a momentum-based algorithm, ARS-OPT, which proactively estimates the gradient with respect to a future ray direction inferred from accumulated momentum. We provide a theoretical analysis of its convergence behavior, showing that ARS-OPT enables more accurate directional updates and achieves faster, more stable optimization. To further accelerate convergence, we incorporate surrogate-model priors into ARS-OPT's gradient estimation, resulting in PARS-OPT with enhanced performance. The superiority of our approach is supported by theoretical guarantees under standard assumptions. Extensive experiments on ImageNet and CIFAR-10 demonstrate that our method surpasses 13 state-of-the-art approaches in query efficiency.Downloads
Published
2026-03-14
How to Cite
Xu, X., Cheng, S., Xu, D., Xuan, Q., & Ma, C. (2026). Improving the Convergence Rate of Ray Search Optimization for Query-Efficient Hard-Label Attacks. Proceedings of the AAAI Conference on Artificial Intelligence, 40(14), 11451–11459. https://doi.org/10.1609/aaai.v40i14.38127
Issue
Section
AAAI Technical Track on Computer Vision XI