理论证明对抗训练能强化鲁棒特征,抑制脆弱特征,提升模型抗干扰能力。
Adversarial Training Can Provably Improve Robustness: Theoretical Analysis of Feature Learning Process Under Structured Data
- 区分鲁棒与非鲁棒特征,揭示对抗样本成因
- 对抗训练可显式增强鲁棒特征学习,抑制脆弱特征
- 适用于希望理解对抗训练机制的研究者
对抗训练是提升深度神经网络对抗扰动鲁棒性的常用方法。尽管其在实践中表现良好,但对抗样本的成因及训练如何提升鲁棒性仍不明确。本文从特征学习理论视角,研究多分类场景下结构化数据的特征学习过程。数据由两类特征构成:鲁棒特征(抗扰动但稀疏)和非鲁棒特征(易受扰动但密集)。我们训练一个两层平滑ReLU卷积神经网络。首先证明,标准训练(梯度下降优化经验风险)主要学习非鲁棒特征,导致对抗样本出现在与负非鲁棒特征方向对齐的扰动上。其次,针对基于梯度的对抗训练算法(通过梯度上升生成对抗样本,再在对抗样本上进行梯度下降更新),我们证明该方法可严格增强鲁棒特征学习并抑制非鲁棒特征学习,从而提升网络鲁棒性。最后,我们在真实图像数据集MNIST、CIFAR10和SVHN上通过实验验证了上述理论结论。
原文摘要 · Abstract (English)
Adversarial training is a widely-applied approach to training deep neural networks to be robust against adversarial perturbation. However, although adversarial training has achieved empirical success in practice, it still remains unclear why adversarial examples exist and how adversarial training methods improve model robustness. In this paper, we provide a theoretical understanding of adversarial examples and adversarial training algorithms from the perspective of feature learning theory. Specifically, we focus on a multiple classification setting, where the structured data can be composed of two types of features: the robust features, which are resistant to perturbation but sparse, and the non-robust features, which are susceptible to perturbation but dense. We train a two-layer smoothed ReLU convolutional neural network to learn our structured data. First, we prove that by using standard training (gradient descent over the empirical risk), the network learner primarily learns the non-robust feature rather than the robust feature, which thereby leads to the adversarial examples that are generated by perturbations aligned with negative non-robust feature directions. Then, we consider the gradient-based adversarial training algorithm, which runs gradient ascent to find adversarial examples and runs gradient descent over the empirical risk at adversarial examples to update models. We show that the adversarial training method can provably strengthen the robust feature learning and suppress the non-robust feature learning to improve the network robustness. Finally, we also empirically validate our theoretical findings with experiments on real-image datasets, including MNIST, CIFAR10 and SVHN.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。