arXiv · 2512.21241
Improving the Convergence Rate of Ray Search Optimization for Query-Efficient Hard-Label Attacks
Abstract
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 $\ell_2$-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.
Explore related subjects
Keep this discovery
Xinjie Xu, Shuyu Cheng, Dongwei Xu, Qi Xuan, Chen Ma. 2025-12-24. Improving the Convergence Rate of Ray Search Optimization for Query-Efficient Hard-Label Attacks. https://arxiv.org/abs/2512.21241
Cite the original work for its findings. Save a collection to share your selection of sources.