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.
翻译:黑盒对抗性攻击的一个主要问题是,硬标签攻击设置的查询复杂程度很高,只有1个最上面的预测标签。在本文中,我们提议采用一种新的基于几何的方法,称为Tangent attack(TA),确定位于决定边界上的虚拟半球的最佳正切点,以减少攻击的扭曲。假设决定边界是当地平坦的,我们理论上证明,在每次迭代中通过这种正切点穿过的正切线到达决定边界时,至少可以得到2美元的扭曲。为了提高我们方法的稳健性,我们进一步提议一种以半利球取代半球的方法,以半利球取代这个半球,以适应曲线上的决定边界。我们的方法是免费的。在图像网和CIFAR-10数据集上进行的广泛实验表明,我们的方法只能消耗少量的查询,才能达到低磁度扭曲。执行源代码可在https://github.com/machanic/TangentAtack上发布。