SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2003.01690 · ICML · 2020

Reliable Evaluation of Adversarial Robustness with an Ensemble of Diverse Parameter-free Attacks

Matthias Hein, Francesco Croce

arXiv · PDF · Open in the Atlas

Code that ran

3 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 3 failures of our instrument; 2 no recorded run), measured 2026-11-21; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2003.01690.json · badge: /api/ran/2003.01690.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
locuslab/robust_overfitting canonical (classifier label)
classifier basis: census
1 ran · 1 no recorded run
copy not recorded community
not in the paper's declared repositories
2 ran · 0 no recorded run
jeromerony/adversarial-library extension (classifier label)
classifier basis: classifier_2025
0 ran · 1 no recorded run
FunctionStatusWhere it lives
generate_random_targets Ran
ran; our contract draft was wrong, not the code
this paper's copy was not recorded; identical code first harvested from jeromerony/adversarial-library
pointer only · get_code("0832e3bf9440362b")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_all_targets Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
this paper's copy was not recorded; identical code first harvested from jeromerony/adversarial-library
pointer only · get_code("c6344b8a7b36aea8")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

mixup_data Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
locuslab/robust_overfitting/train_cifar.py
pointer only (licence: NONE) · get_code("b20f1357b1d8dbf8")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, locuslab/robust_overfitting when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

clamp Not yet run
unverified (harvested, no recorded run)
locuslab/robust_overfitting/train_cifar.py
pointer only (licence: NONE) · get_code("8a93e041134b597a")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, locuslab/robust_overfitting when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

init_lr_finder Not yet run
unverified (harvested, no recorded run)
jeromerony/adversarial-library/adv_lib/attacks/augmented_lagrangian.py
code served (permissive licence) · get_code("fd670ddeddb80a69")
How it ran

no invocation recorded.

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 5 are also present in other papers whose code we hold (4 with at least one paper dated earlier, 0 the same month, 5 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
clamp 33 other papers
3 dated earlier, 30 later · 1 only as an assembly brick
1706.06083 (2017-06)
Towards Deep Learning Models Resistant to Adversarial Attacks
2001.03994 (2020-01)
Fast is better than free: Revisiting adversarial training
2002.11569 (2020-02)
Overfitting in adversarially robust deep learning
and 30 more not named here
mixup_data 7 other papers
2 dated earlier, 5 later
1706.06083 (2017-06)
Towards Deep Learning Models Resistant to Adversarial Attacks
2002.11569 (2020-02)
Overfitting in adversarially robust deep learning
2004.05884 (2020-04)
Adversarial Weight Perturbation Helps Robust Generalization
and 4 more not named here
generate_random_targets 3 other papers
2 dated earlier, 1 later
1812.06371 (2018-12)
Trust Region Based Adversarial Attack on Neural Networks
1907.02044 (2019-07)
Minimally distorted Adversarial Examples with a Fast Adaptive Boundary Attack
2103.01208 (2021-03)
Mind the Box: l 1 -APGD for Sparse Adversarial Attacks on Image Classifiers
get_all_targets 3 other papers
2 dated earlier, 1 later
1812.06371 (2018-12)
Trust Region Based Adversarial Attack on Neural Networks
1907.02044 (2019-07)
Minimally distorted Adversarial Examples with a Fast Adaptive Boundary Attack
2103.01208 (2021-03)
Mind the Box: l 1 -APGD for Sparse Adversarial Attacks on Image Classifiers
init_lr_finder 2 other papers
2 later
2011.11857 (2020-11)
Augmented Lagrangian Adversarial Attacks
2106.01538 (2021-06)
PDPGD: Primal-Dual Proximal Gradient Descent Adversarial Attack

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

The field of defense strategies against adversarial attacks has significantly grown over the last years, but progress is hampered as the evaluation of adversarial defenses is often insufficient and thus gives a wrong impression of robustness. Many promising defenses could be broken later on, making it difficult to identify the state-of-the-art. Frequent pitfalls in the evaluation are improper tuning of hyperparameters of the attacks, gradient obfuscation or masking. In this paper we first propose two extensions of the PGD-attack overcoming failures due to suboptimal step size and problems of the objective function. We then combine our novel attacks with two complementary existing ones to form a parameter-free, computationally affordable and user-independent ensemble of attacks to test adversarial robustness. We apply our ensemble to over 50 models from papers published at recent top machine learning and computer vision venues. In all except one of the cases we achieve lower robust test accuracy than reported in these papers, often by more than 10%, identifying several broken defenses.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2003.01690")
get_code_for_paper("2003.01690")
have("2003.01690")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2003.01690.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2003.01690.svg)](https://syntology.ai/paper/2003.01690)

Connect an agent — have() is free.