mlsanityData to 14 Oct 2026

FastAT Benchmark: A Comprehensive Framework for Fair Evaluation of Fast Adversarial Training Methods

arXiv 2604.22853 ↗First posted 22 Apr 2026cs.CV cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Fast Adversarial Training (FastAT) seeks to achieve adversarial robustness at a fraction of the computational cost incurred by standard multi-step methods such as PGD-AT. Although numerous FastAT techniques have been proposed in recent years, fair comparison among them remains elusive. Existing benchmarks and public leaderboards typically permit diverse model architectures, varying training configurations, and external data sources, making it unclear whether reported improvements reflect genuine algorithmic advances or merely more favorable experimental conditions. To address this problem, we introduce the FastAT Benchmark, a controlled evaluation framework built on three core design principles: unified architecture requirements, standardized training settings, and strict prohibition of external or synthetic data. The benchmark implements over twenty representative FastAT methods within a single codebase, enabling direct and reproducible comparison. Each method is assessed through a dual-metric evaluation framework that measures both adversarial robustness (accuracy under PGD, AutoAttack, and CR Attack) and computational cost (GPU training time and peak memory footprint). Comprehensive experiments on CIFAR-10, CIFAR-100, and Tiny-ImageNet provide reliable baseline measurements and reveal that well-designed single-step methods can match or surpass PGD-AT robustness at substantially lower cost, while no single method dominates across all evaluation dimensions. The complete benchmark, including source code, configuration files, and experimental results, is publicly available to support transparent and fair evaluation of future FastAT research.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 35 references that are in the map. First posted on arXiv 22 Apr 2026.

Builds on

22 of 35 references.

References · 22

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  3. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  4. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  5. 2016Wide Residual Networkscited by 3,070
  6. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  7. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
  8. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  9. 2020Fast is better than free: Revisiting adversarial trainingcited by 727
  10. 2020RobustBench: a standardized adversarial robustness benchmarkcited by 661
  11. 2019Adversarial Training for Free!cited by 643
  12. 2020Understanding and Improving Fast Adversarial Trainingcited by 214
10 more
  1. 2020Understanding Catastrophic Overfitting in Single-step Adversarial Trainingcited by 76
  2. 2020Guided Adversarial Attack for Evaluating and Enhancing Adversarial Defensescited by 62
  3. 2023Robust Principles: Architectural Design Principles for Adversarially Robust CNNscited by 46
  4. 2022Make Some Noise: Reliable and Efficient Single-Step Adversarial Trainingcited by 43
  5. 2024Adversarial Robustness Limits via Scaling-Law and Human-Alignment Studiescited by 38
  6. 2022Prior-Guided Adversarial Initialization for Fast Adversarial Trainingcited by 35
  7. 2023Fast Adversarial Training with Smooth Convergencecited by 14
  8. 2024Preventing Catastrophic Overfitting in Fast Adversarial Training: A Bi-level Optimization Perspectivecited by 13
  9. 2024Eliminating Catastrophic Overfitting Via Abnormal Adversarial Examples Regularizationcited by 12
  10. 2024Efficient local linearity regularization to overcome catastrophic overfittingcited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.