English

Improving the Convergence Rate of Ray Search Optimization for Query-Efficient Hard-Label Attacks

Machine Learning 2025-12-25 v1 Artificial Intelligence Cryptography and Security Computer Vision and Pattern Recognition

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 2\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.

Keywords

Cite

@article{arxiv.2512.21241,
  title  = {Improving the Convergence Rate of Ray Search Optimization for Query-Efficient Hard-Label Attacks},
  author = {Xinjie Xu and Shuyu Cheng and Dongwei Xu and Qi Xuan and Chen Ma},
  journal= {arXiv preprint arXiv:2512.21241},
  year   = {2025}
}

Comments

Published at AAAI 2026 (Oral). This version corresponds to the conference proceedings; v2 will include the appendix

R2 v1 2026-07-01T08:40:02.318Z