LGCVMLFeb 11, 2020

Improving the affordability of robustness training for DNNs

arXiv:2002.04237v218 citations
AI Analysis

This addresses the computational bottleneck in adversarial training for machine learning practitioners, making robust models more affordable, though it is an incremental improvement.

The paper tackles the high computational cost of adversarial training for deep neural networks by showing that the initial phase can be replaced with natural training, reducing training time by up to 2.5 times without loss in accuracy on natural and adversarial test samples.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes