It is argued that future robustness evaluations should report vanilla-referenced accuracy gaps as a standard component, and demonstrated that the robustness-accuracy trade-off is substantially larger than what is typically conveyed by individual papers.
Abstract
Adversarial robustness research has produced hundreds of defended models over the past decade, yet the literature almost universally reports robustness results in isolation: standard (clean) accuracy and adversarial accuracy of the robust model are shown, but the gap to the corresponding vanilla model is rarely quantified. We introduce VanillaBench, a systematic benchmark that makes this gap explicit. For every adversarially-trained model catalogued by RobustBench across four threat models, we compute the accuracy difference against multiple vanilla references from Papers with Code, computed over both all entries and no-extra-data entries, the best vanilla model as of the robust model's publication year, and an architecture-matched baseline. Across all 186 robust models, the mean delta clean relative to the best vanilla model ranges from -7.7 to -29.5 percentage points, and even the single most robust model per track still trails its temporal vanilla counterpart by 4.0-21.0 points. The architecture-matched comparison, which isolates the effect of adversarial training from architectural differences, reveals a mean gap of -3.5 to -17.5 points. Restricting this architecture-matched comparison to models whose vanilla accuracy is known for the exact same architecture, rather than approximated from a related one, narrows the gap to -4.0 to -14.0 points. These results demonstrate that the robustness-accuracy trade-off is substantially larger than what is typically conveyed by individual papers. This information is critical for practitioners and decision-makers. When deploying models in real-world settings, the accuracy cost of robustness directly affects business outcomes, yet current publications do not provide the vanilla baseline needed to assess it. We argue that future robustness evaluations should report vanilla-referenced accuracy gaps as a standard component.
This work comprehensively investigates computation-efficient strategies to speed up latent adversarial training from two complementary perspectives, and reduces per-step adversarial-training FLOPs by 48.1% while requiring only 0.0118% trainable parameters.
Adversarial training (AT) is a widely adopted defense against adversarial attacks, but its multi-step optimization process for generating adversarial examples leads to substantial computational overhead. To mitigate this, various single-step adversarial training methods have been proposed. However, these models often s...
Lifeng Huang, Yuquan Lin, Chen Wan et al.· IEEE Transactions on Informa...· 0 citations
A novel energy-based optimization strategy to improve the robust generalization of machine learning models against adversarial attacks by incorporating the principles of energy-based models and shows strong and competitive performance across three extensively utilized datasets.
This work studies the opposite of an imperceptible perturbation to fool a model: a large, clearly visible perturbation that causes the model to keep its original, correct prediction, even though a human would no longer recognize the image.
A unified evaluation framework based on a comprehensive pool of minimum-norm attacks and robustness--perturbation curves across $\ell_0, $\ell_1, $\ell_2$ and $\ell_\infty$ norms", and proposes the Defense Optimality Index to rank defenses by their gap to the defense frontier.
This paper investigates the certified and empirical robustness of various Kolmogorov-Arnold network architectures against strong evasion attacks and systematically evaluates the robustness of various defended and undefended KAN models under FGSM, PGD, and C&W attacks.
Mohammad Meymani, R. Razavi-Far· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.