Logit Pairing Methods Can Fool Gradient-Based Attacks
Marius Mosbach, Maksym Andriushchenko, Thomas Trost, Matthias Hein, Dietrich Klakow
TL;DR
The paper challenges the robustness claims of logit pairing defenses (CLP, LSQ, ALP) by showing that they mainly distort the input-space loss surface and obfuscate gradients rather than provide true robustness. Through extensive PGD-based evaluations across MNIST, CIFAR-10, and Tiny ImageNet, it demonstrates that results are highly sensitive to attack parameters and restarts, with CLP/LSQ failing to offer real protection and ALP giving only modest gains when combined with adversarial training. The authors advocate exhaustive grid searches over PGD parameters and many restarts to avoid false conclusions, and conclude that ALP's improvements are not substantially better than adversarial training alone. Overall, the work cautions against relying on default PGD settings to assess robustness and emphasizes dataset-dependent outcomes for logit pairing methods.
Abstract
Recently, Kannan et al. [2018] proposed several logit regularization methods to improve the adversarial robustness of classifiers. We show that the computationally fast methods they propose - Clean Logit Pairing (CLP) and Logit Squeezing (LSQ) - just make the gradient-based optimization problem of crafting adversarial examples harder without providing actual robustness. We find that Adversarial Logit Pairing (ALP) may indeed provide robustness against adversarial examples, especially when combined with adversarial training, and we examine it in a variety of settings. However, the increase in adversarial accuracy is much smaller than previously claimed. Finally, our results suggest that the evaluation against an iterative PGD attack relies heavily on the parameters used and may result in false conclusions regarding robustness of a model.
