Papers › Fast is better than free: Revisiting adversarial training
Fast is better than free: Revisiting adversarial training
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.
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.
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.
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.
8a93e041134b597a · report
89c2cf3b97685684 · report
fa636f649fc7a458 · report
7a93b4bf9b9553b9 · report
52d10a10fb72fb9f · report
89f1ad5572085e04 · report
47bfdbebc768db6a · report
f6debb1c3f5dd7da · report
b6a22c7b74d0b566 · report
5f605ede6476e2b2 · report
ef2b42bfdaa3556e · report
414bc3938ef8364c · report
2bc3009bc37610d0 · report
c31db8461c9422cd · report
d2f33f1ecdf5b3bc · report
48d009a3bfb3919f · report
f1f502008abfb7b0 · report
412d129df08139d7 · report
5f385a03a326c920 · report
daa0543c8e065130 · report
9b843c30b475815c · report
842519d6c63098ed · report
6d6817a15cfeccc0 · report
cc55d19dea2beabe · report
a116f92d34de08d0 · report
78865ef3023c58ad · report
debf7fa6a54c7259 · report
7ceaa0e5bd758ab3 · report
195faaace44890e8 · report
7d6882c87b7d7d18 · report
1a22911f27fa7a50 · report
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