Papers › Minimally distorted Adversarial Examples with a Fast Adaptive Boundary Attack

Minimally distorted Adversarial Examples with a Fast Adaptive Boundary Attack

3 Jul 2019ICML 2020 1arXiv:1907.02044archive 2025-07-28

Francesco Croce, Matthias Hein

The evaluation of robustness against adversarial manipulation of neural networks-based classifiers is mainly tested with empirical attacks as methods for the exact computation, even when available, do not scale to large networks. We propose in this paper a new white-box adversarial attack wrt the lₚ-norms for p ∈{1,2,∞} aiming at finding the minimal perturbation necessary to change the class of a given input. It has an intuitive geometric meaning, yields quickly high quality results, minimizes the size of the perturbation (so that it returns the robust accuracy at every threshold with a single run). It performs better or similar to state-of-the-art attacks which are partially specialized to one lₚ-norm, and is robust to the phenomenon of gradient masking.

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="1907.02044")

Code

Syntology Ran 4 of 6 code samples harvested from 2 repositories linked to this paper; 2 have no recorded run. Of those that ran: 3 ran · our draft was wrong; 1 ran · fixture could not drive it.

By repository: official repository: 3 samples from 1 repository, 1 ran; community (archive-listed): 1 sample from 1 repository, 1 ran; 2 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

fra31/fab-attack officialmentioned in papermentioned on GitHubtf report
jeromerony/adversarial-library 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

6 samples harvested; 4 ran; 0 honoured the contract we drafted; 2 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.

3ran · our draft was wrong
1ran · fixture could not drive it
2unverified

Licence: 5 of the 6 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 2 repositories linked to this paper, official or community; each sample names its own and says which. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “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.

get_diff_logits_grads_batch fra31/fab-attack/FAB_linf.py official repository ran · our draft was wrong no licence file found · pointer only · 830ff1ed078b9571 · report
linear_approximation_search fra31/fab-attack/FAB_linf.py official repository unverified no licence file found · pointer only · 412ce9de5bed70f7 · report
projection_linf_hyperplane fra31/fab-attack/FAB_linf.py official repository unverified no licence file found · pointer only · ffcbde401a900856 · report
get_best_diff_logits_grads jeromerony/adversarial-library/adv_lib/attacks/fast_adaptive_boundary/fast_adaptive_boundary.py community (archive-listed) ran · our draft was wrong BSD-3-Clause (permissive) · 7fd53eb957716ff1 · report
generate_random_targets identical code first harvested elsewhere ran · our draft was wrong licence of this copy not recorded · 0832e3bf9440362b · report
get_all_targets identical code first harvested elsewhere ran · fixture could not drive it fingerprinted licence of this copy not recorded · c6344b8a7b36aea8 · report

Tasks

Adversarial Attack

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