Papers › Fast is better than free: Revisiting adversarial training

Fast is better than free: Revisiting adversarial training

12 Jan 2020ICLR 2020 1arXiv:2001.03994archive 2025-07-28

Eric Wong, Leslie Rice, J. Zico Kolter

Adversarial training, a method for learning robust deep networks, is typically assumed to be more expensive than traditional training due to the necessity of constructing adversarial examples via a first-order method like projected gradient decent (PGD). In this paper, we make the surprising discovery that it is possible to train empirically robust models using a much weaker and cheaper adversary, an approach that was previously believed to be ineffective, rendering the method no more costly than standard training in practice. Specifically, we show that adversarial training with the fast gradient sign method (FGSM), when combined with random initialization, is as effective as PGD-based training but has significantly lower cost. Furthermore we show that FGSM adversarial training can be further accelerated by using standard techniques for efficient training of deep networks, allowing us to learn a robust CIFAR10 classifier with 45% robust accuracy to PGD attacks with ϵ=8/255 in 6 minutes, and a robust ImageNet classifier with 43% robust accuracy at ϵ=2/255 in 12 hours, in comparison to past work based on "free" adversarial training which took 10 and 50 hours to reach the same respective thresholds. Finally, we identify a failure mode referred to as "catastrophic overfitting" which may have caused previous attempts to use FGSM adversarial training to fail. All code for reproducing the experiments in this paper as well as pretrained model weights are at https://github.com/locuslab/fast_adversarial.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2001.03994")

Code

Syntology Ran 7 of 32 code samples harvested from 7 repositories linked to this paper; 25 have no recorded run. Of those that ran: 2 ran · violated contract; 4 ran · our draft was wrong; 1 ran with no contract checked.

By repository: official repository: 1 sample from 1 repository, 0 ran; community (archive-listed): 31 samples from 6 repositories, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

locuslab/fast_adversarial officialmentioned in papermentioned on GitHubpytorch report
MetaSolver/icml2021 mentioned on GitHubpytorchBSD-3-Clause report
aliborji/Shapedefence mentioned on GitHubpytorchMIT report
aliborji/shapedefense mentioned on GitHubpytorch report
elijahcn/TextCNN-AdversarialTraining mentioned on GitHubpytorchMIT report
jokeryan/post_training mentioned on GitHubpytorch report
juliagusak/neural-ode-metasolver mentioned on GitHubpytorchBSD-3-Clause report
rohban-lab/catastrophic_overfitting mentioned on GitHubpytorch report
simon0987/Fast_FGSM mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

32 samples harvested; 7 ran; 0 honoured the contract we drafted; 25 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · violated contract
4ran · our draft was wrong
1ran
25unverified

Licence: 8 of the 32 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 7 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

clamp locuslab/fast_adversarial/MNIST/evaluate_mnist.py official repository unverified no licence file found · pointer only · 8a93e041134b597a · report
is_image_file aliborji/Shapedefence/make_imagenet_64_c.py community (archive-listed) ran · violated contract MIT (permissive) · 89c2cf3b97685684 · report
PreActResNet18 tml-epfl/understanding-fast-adv-training/models.py community (archive-listed) ran · our draft was wrong no licence file found · pointer only · fa636f649fc7a458 · report
auc aliborji/shapedefense/test_noise_robustness.py community (archive-listed) ran · violated contract fingerprinted MIT (permissive) · 7a93b4bf9b9553b9 · report
find_classes aliborji/Shapedefence/make_imagenet_64_c.py community (archive-listed) ran MIT (permissive) · 52d10a10fb72fb9f · report
l0_mid_points alirezaabdollahpour/CURE_fast_adversarial/attacks/fmn.py community (archive-listed) ran · our draft was wrong fingerprinted no licence file found · pointer only · 89f1ad5572085e04 · report
l1_mid_points alirezaabdollahpour/CURE_fast_adversarial/attacks/fmn.py community (archive-listed) ran · our draft was wrong fingerprinted no licence file found · pointer only · 47bfdbebc768db6a · report
linf_projection_Alireza alirezaabdollahpour/CURE_fast_adversarial/attacks/fmn.py community (archive-listed) ran · our draft was wrong fingerprinted no licence file found · pointer only · f6debb1c3f5dd7da · report
attack_pgd_Alireza alirezaabdollahpour/CURE_fast_adversarial/train_CIFAR10.py community (archive-listed) unverified no licence file found · pointer only · b6a22c7b74d0b566 · report
build_ButcherTableau_Heun MetaSolver/icml2021/sopa/src/solvers/rk_parametric_order2stage2.py community (archive-listed) unverified BSD-3-Clause (permissive) · 5f605ede6476e2b2 · report
build_ButcherTableau_Midpoint MetaSolver/icml2021/sopa/src/solvers/rk_parametric_order2stage2.py community (archive-listed) unverified BSD-3-Clause (permissive) · ef2b42bfdaa3556e · report
build_ButcherTableau_RK38 MetaSolver/icml2021/sopa/src/solvers/rk_parametric_order4stage4.py community (archive-listed) unverified BSD-3-Clause (permissive) · 414bc3938ef8364c · report
build_ButcherTableau_RKStandard MetaSolver/icml2021/sopa/src/solvers/rk_parametric_order4stage4.py community (archive-listed) unverified BSD-3-Clause (permissive) · 2bc3009bc37610d0 · report
build_dataset elijahcn/TextCNN-AdversarialTraining/utils.py community (archive-listed) unverified MIT (permissive) · c31db8461c9422cd · report
build_iterator elijahcn/TextCNN-AdversarialTraining/utils.py community (archive-listed) unverified MIT (permissive) · d2f33f1ecdf5b3bc · report
build_vocab elijahcn/TextCNN-AdversarialTraining/utils.py community (archive-listed) unverified MIT (permissive) · 48d009a3bfb3919f · report
clamp MetaSolver/icml2021/MegaAdversarial/src/attacks/fgsm.py community (archive-listed) unverified BSD-3-Clause (permissive) · f1f502008abfb7b0 · report
create_solver MetaSolver/icml2021/sopa/src/solvers/utils.py community (archive-listed) unverified BSD-3-Clause (permissive) · 412d129df08139d7 · report
detect_edge_gtsrb aliborji/Shapedefence/edge_detector.py community (archive-listed) unverified MIT (permissive) · 5f385a03a326c920 · report
detect_edge_new aliborji/Shapedefence/edge_detector.py community (archive-listed) unverified MIT (permissive) · daa0543c8e065130 · report
detect_edge_new_cifar aliborji/Shapedefence/edge_detector.py community (archive-listed) unverified MIT (permissive) · 9b843c30b475815c · report
get_cifar10_test_loader MetaSolver/icml2021/sopa/src/models/odenet_cifar10/data.py community (archive-listed) unverified BSD-3-Clause (permissive) · 842519d6c63098ed · report
get_cifar10_train_val_loaders MetaSolver/icml2021/sopa/src/models/odenet_cifar10/data.py community (archive-listed) unverified BSD-3-Clause (permissive) · 6d6817a15cfeccc0 · report
get_model tml-epfl/understanding-fast-adv-training/models.py community (archive-listed) unverified no licence file found · pointer only · cc55d19dea2beabe · report
get_norm_layer aliborji/Shapedefence/pix2pix-pytorch/networks.py community (archive-listed) unverified MIT (permissive) · a116f92d34de08d0 · report
get_scheduler aliborji/Shapedefence/pix2pix-pytorch/networks.py community (archive-listed) unverified MIT (permissive) · 78865ef3023c58ad · report
init_net aliborji/Shapedefence/pix2pix-pytorch/networks.py community (archive-listed) unverified MIT (permissive) · debf7fa6a54c7259 · report
load_model MetaSolver/icml2021/sopa/src/models/utils.py community (archive-listed) unverified BSD-3-Clause (permissive) · 7ceaa0e5bd758ab3 · report
make_dataset aliborji/Shapedefence/make_imagenet_64_c.py community (archive-listed) unverified MIT (permissive) · 195faaace44890e8 · report
noise_params MetaSolver/icml2021/sopa/src/solvers/utils.py community (archive-listed) unverified BSD-3-Clause (permissive) · 7d6882c87b7d7d18 · report
sample_noise MetaSolver/icml2021/sopa/src/solvers/utils.py community (archive-listed) unverified BSD-3-Clause (permissive) · 1a22911f27fa7a50 · report
zero_grad alirezaabdollahpour/CURE_fast_adversarial/train_CIFAR10.py community (archive-listed) unverified no licence file found · pointer only · 5c6723ed7945b680 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections