The AutoAttack (AA) has been the most reliable method to evaluate adversarial robustness when considerable computational resources are available. However, the high computational cost (e.g., 100 times more than that of the project gradient descent attack) makes AA infeasible for practitioners with limited computational resources, and also hinders applications of AA in the adversarial training (AT). In this paper, we propose a novel method, minimum-margin (MM) attack, to fast and reliably evaluate adversarial robustness. Compared with AA, our method achieves comparable performance but only costs 3% of the computational time in extensive experiments. The reliability of our method lies in that we evaluate the quality of adversarial examples using the margin between two targets that can precisely identify the most adversarial example. The computational efficiency of our method lies in an effective Sequential TArget Ranking Selection (STARS) method, ensuring that the cost of the MM attack is independent of the number of classes. The MM attack opens a new way for evaluating adversarial robustness and provides a feasible and reliable way to generate high-quality adversarial examples in AT.
翻译:AutoAttack(AA)一直是在有大量计算资源的情况下评估对抗性强力的最可靠方法,然而,由于计算成本高(例如,梯度下降攻击比项目成本高100倍),对于计算资源有限的从业人员来说,AAA不可行,也妨碍了AAA在对抗性训练(AT)中的应用。在本文中,我们提出了一个新颖的方法,即最小距离(MMM)攻击,以快速和可靠地评估对抗性强力。与AAA相比,我们的方法取得了可比较的业绩,但在广泛的试验中只花费了计算时间的3%。我们方法的可靠性在于,我们利用两个目标之间的差值来评估对抗性例子的质量,这两个目标能够准确确定最强的对抗性例子。我们方法的计算效率在于一种有效的序列定级选择方法,确保M攻击的费用独立于各类。M攻击为评价对抗性强力提供了一种新的方法,并为在AT中生成高质量的敌对性例子提供了一种可行和可靠的方法。