arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.04237cs.LGcs.CVstat.ML

Improving the affordability of robustness training for DNNs

University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);IBM Research(IBM研究院)

Sidharth Gupta, Parijat Dube, Ashish Verma

英文摘要:

Projected Gradient Descent (PGD) based adversarial training has become one of the most prominent methods for building robust deep neural network models. However, the computational complexity associated with this approach, due to the maximization of the loss function when finding adversaries, is a longstanding problem and may be prohibitive when using larger and more complex models. In this paper we show that the initial phase of adversarial training is redundant and can be replaced with natural training which significantly improves the computational efficiency. We demonstrate that this efficiency gain can be achieved without any loss in accuracy on natural and adversarial test samples. We support our argument with insights on the nature of the adversaries and their relative strength during the training process. We show that our proposed method can reduce the training time by a factor of up to 2.5 with comparable or better model test accuracy and generalization on various strengths of adversarial attacks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑