Finding Optimal Tangent Points for Reducing Distortions of Hard-label Attacks

Chen Ma, Xiangyu Guo, Li Chen, Jun-Hai Yong, Yisen Wang

Keywords: black-box adversarial attack, hard-label attack, geometric-based attack, tangent point, tangent line, HopSkipJumpAttack

TL;DR: We propose a geometric-based hard-label attack, which computes the optimal tangent point of a virtual hemisphere at the decision boundary to reduce the distortion of the attack.

Abstract: One major problem in black-box adversarial attacks is the high query complexity in the hard-label attack setting, where only the top-1 predicted label is available. In this paper, we propose a novel geometric-based approach called Tangent Attack (TA), which identifies an optimal tangent point of a virtual hemisphere located on the decision boundary to reduce the distortion of the attack. Assuming the decision boundary is locally flat, we theoretically prove that the minimum $\ell_2$ distortion can be obtained by reaching the decision boundary along the tangent line passing through such tangent point in each iteration. To improve the robustness of our method, we further propose a generalized method which replaces the hemisphere with a semi-ellipsoid to adapt to curved decision boundaries. Our approach is free of pre-training. Extensive experiments conducted on the ImageNet and CIFAR-10 datasets demonstrate that our approach can consume only a small number of queries to achieve the low-magnitude distortion. The implementation source code is released online.

Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.

Code: https://github.com/machanic/TangentAttack

Community Implementations: [ 3 code implementations](https://www.catalyzex.com/paper/finding-optimal-tangent-points-for-reducing/code)