论文标题
实现使用Stackelberg游戏的对抗性深度学习的最佳对抗精度
Achieve Optimal Adversarial Accuracy for Adversarial Deep Learning using Stackelberg Game
论文作者
论文摘要
对抗性深度学习是针对对抗性攻击训练强大的DNN，这是深度学习的主要研究之一。游戏理论已被用来回答有关对抗性深度学习的一些基本问题，例如具有最佳鲁棒性的分类器的存在以及给定类别的分类器的最佳对抗样本。在以前的大多数工作中，对抗性深度学习被称为同时游戏，并且假定策略空间是某些概率分布，以使NASH平衡存在。但是，此假设不适用于实际情况。在本文中，我们通过将对抗性深度学习作为顺序游戏提出，为分类器是具有给定结构的DNN的实际情况提供了这些基本问题的答案。证明了这些游戏的Stackelberg平衡存在。此外，当使用Carlini-Wagner的边缘损失时，平衡DNN具有相同结构的所有DNN中最大的对抗精度。从游戏理论方面也研究了对抗性深度学习的鲁棒性和准确性之间的权衡。
Adversarial deep learning is to train robust DNNs against adversarial attacks, which is one of the major research focuses of deep learning. Game theory has been used to answer some of the basic questions about adversarial deep learning such as the existence of a classifier with optimal robustness and the existence of optimal adversarial samples for a given class of classifiers. In most previous work, adversarial deep learning was formulated as a simultaneous game and the strategy spaces are assumed to be certain probability distributions in order for the Nash equilibrium to exist. But, this assumption is not applicable to the practical situation. In this paper, we give answers to these basic questions for the practical case where the classifiers are DNNs with a given structure, by formulating the adversarial deep learning as sequential games. The existence of Stackelberg equilibria for these games are proved. Furthermore, it is shown that the equilibrium DNN has the largest adversarial accuracy among all DNNs with the same structure, when Carlini-Wagner's margin loss is used. Trade-off between robustness and accuracy in adversarial deep learning is also studied from game theoretical aspect.
