Finding Optimal Tangent Points for Reducing Distortions of Hard-label Attacks
원문 초록
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 at https://github.com/machanic/TangentAttack.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
HQA-Attack: Toward High Quality Black-Box Hard-Label Adversarial Attack on Text
LimeAttack: Local Explainable Method for Textual Hard-Label Adversarial Attack
TextHacker: Learning based Hybrid Local Search Algorithm for Text Hard-label Adversarial Attack
Sign-OPT: A Query-Efficient Hard-label Adversarial Attack
DTA: Distribution Transform-based Attack for Query-Limited Scenario
PredCoin: Defense against Query-based Hard-label Attack
토론
이 논문과 연결된 포럼 글이 아직 없습니다.