LGCVFeb 2, 2022

Make Some Noise: Reliable and Efficient Single-Step Adversarial Training

arXiv:2202.01181v365 citationsHas Code
AI Analysis

This work addresses a reliability issue in adversarial training for machine learning models, offering a more efficient solution, though it appears incremental as it builds directly on prior methods like RS-FGSM and GradAlign.

The paper tackles the problem of catastrophic overfitting in single-step adversarial training by proposing Noise-FGSM (N-FGSM), which uses stronger noise and avoids clipping to prevent this failure mode. The result is that N-FGSM matches or surpasses the performance of the previous state-of-the-art method, GradAlign, while achieving a 3x speed-up.

Recently, Wong et al. showed that adversarial training with single-step FGSM leads to a characteristic failure mode named Catastrophic Overfitting (CO), in which a model becomes suddenly vulnerable to multi-step attacks. Experimentally they showed that simply adding a random perturbation prior to FGSM (RS-FGSM) could prevent CO. However, Andriushchenko and Flammarion observed that RS-FGSM still leads to CO for larger perturbations, and proposed a computationally expensive regularizer (GradAlign) to avoid it. In this work, we methodically revisit the role of noise and clipping in single-step adversarial training. Contrary to previous intuitions, we find that using a stronger noise around the clean sample combined with \textit{not clipping} is highly effective in avoiding CO for large perturbation radii. We then propose Noise-FGSM (N-FGSM) that, while providing the benefits of single-step adversarial training, does not suffer from CO. Empirical analyses on a large suite of experiments show that N-FGSM is able to match or surpass the performance of previous state-of-the-art GradAlign, while achieving 3x speed-up. Code can be found in https://github.com/pdejorge/N-FGSM

Code Implementations1 repo
Foundations

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

Your Notes