LGCRMLFeb 21, 2022

Robustness and Accuracy Could Be Reconcilable by (Proper) Definition

arXiv:2202.10103v2171 citationsHas Code
Originality Highly original
AI Analysis

This work addresses the robustness-accuracy trade-off problem in adversarial machine learning, offering a novel perspective that could improve model performance, though it is incremental in redefining robust error.

The authors tackled the perceived inherent trade-off between robustness and accuracy in adversarial training by proposing a new robust error definition called SCORE, which uses local equivariance instead of local invariance, and their models achieved top-rank performance on RobustBench under AutoAttack.

The trade-off between robustness and accuracy has been widely studied in the adversarial literature. Although still controversial, the prevailing view is that this trade-off is inherent, either empirically or theoretically. Thus, we dig for the origin of this trade-off in adversarial training and find that it may stem from the improperly defined robust error, which imposes an inductive bias of local invariance -- an overcorrection towards smoothness. Given this, we advocate employing local equivariance to describe the ideal behavior of a robust model, leading to a self-consistent robust error named SCORE. By definition, SCORE facilitates the reconciliation between robustness and accuracy, while still handling the worst-case uncertainty via robust optimization. By simply substituting KL divergence with variants of distance metrics, SCORE can be efficiently minimized. Empirically, our models achieve top-rank performance on RobustBench under AutoAttack. Besides, SCORE provides instructive insights for explaining the overfitting phenomenon and semantic input gradients observed on robust models. Code is available at https://github.com/P2333/SCORE.

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