mlsanityData to 14 Oct 2026

Improving the affordability of robustness training for DNNs

arXiv 2002.04237 ↗First posted 11 Feb 2020cs.LG cs.CV stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 4; 2023: 2.

8 papers.