Papers › Why Does Little Robustness Help? A Further Step Towards Understanding Adversarial...

Why Does Little Robustness Help? A Further Step Towards Understanding Adversarial Transferability

15 Jul 2023arXiv:2307.07873archive 2025-07-28

Yechao Zhang, Shengshan Hu, Leo Yu Zhang, Junyu Shi, Minghui Li, Xiaogeng Liu, Wei Wan, Hai Jin

Adversarial examples (AEs) for DNNs have been shown to be transferable: AEs that successfully fool white-box surrogate models can also deceive other black-box models with different architectures. Although a bunch of empirical studies have provided guidance on generating highly transferable AEs, many of these findings lack explanations and even lead to inconsistent advice. In this paper, we take a further step towards understanding adversarial transferability, with a particular focus on surrogate aspects. Starting from the intriguing little robustness phenomenon, where models adversarially trained with mildly perturbed adversarial samples can serve as better surrogates, we attribute it to a trade-off between two predominant factors: model smoothness and gradient similarity. Our investigations focus on their joint effects, rather than their separate correlations with transferability. Through a series of theoretical and empirical analyses, we conjecture that the data distribution shift in adversarial training explains the degradation of gradient similarity. Building on these insights, we explore the impacts of data augmentation and gradient regularization on transferability and identify that the trade-off generally exists in the various training mechanisms, thus building a comprehensive blueprint for the regulation mechanism behind transferability. Finally, we provide a general route for constructing better surrogates to boost transferability which optimizes both model smoothness and gradient similarity simultaneously, e.g., the combination of input gradient regularization and sharpness-aware minimization (SAM), validated by extensive experiments. In summary, we call for attention to the united impacts of these two factors for launching effective transfer attacks, rather than optimizing one while ignoring the other, and emphasize the crucial role of manipulating surrogate models.

PaperPDFCodeCode 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="2307.07873")

Code

Syntology Ran 12 of 15 code samples harvested from 1 repository linked to this paper; 3 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 11 ran with no contract checked.

By repository: official repository: 15 samples from 1 repository, 12 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

cgcl-codes/transferattacksurrogates officialmentioned in paperpytorchMIT 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

15 samples harvested; 12 ran; 0 honoured the contract we drafted; 3 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.

1ran · our draft was wrong
11ran
3unverified

Licence: 0 of the 15 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 cgcl-codes/transferattacksurrogates. “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.

clip_by_tensor cgcl-codes/transferattacksurrogates/TransferAttack/imagenet_attack.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 11d8e1b97b2f5801 · report
drop_connect cgcl-codes/transferattacksurrogates/TransferAttack/models/efficientnet.py official repository ran fingerprinted MIT (permissive) · 4304a326c593f8db · report
make_layers cgcl-codes/transferattacksurrogates/TransferAttack/models/vgg.py official repository ran MIT (permissive) · 424b4090e4679330 · report
resnet18 cgcl-codes/transferattacksurrogates/TransferAttack/models/resnet.py official repository ran MIT (permissive) · 33b1291f4ed17ae8 · report
resnet20 cgcl-codes/transferattacksurrogates/TransferAttack/models/resnet_cifar.py official repository ran MIT (permissive) · ef2cb901ccb65deb · report
resnet32 cgcl-codes/transferattacksurrogates/TransferAttack/models/resnet_cifar.py official repository ran MIT (permissive) · 580a194529286f83 · report
resnet44 cgcl-codes/transferattacksurrogates/TransferAttack/models/resnet_cifar.py official repository ran MIT (permissive) · 7a0631b66b62efa7 · report
resnet50 cgcl-codes/transferattacksurrogates/TransferAttack/models/resnet.py official repository ran MIT (permissive) · 8a672b592867c614 · report
swish cgcl-codes/transferattacksurrogates/TransferAttack/models/efficientnet.py official repository ran fingerprinted MIT (permissive) · 8737c82de631cffc · report
vgg11_bn cgcl-codes/transferattacksurrogates/TransferAttack/models/vgg.py official repository ran MIT (permissive) · acc8c58f222a7df0 · report
vgg13 cgcl-codes/transferattacksurrogates/TransferAttack/models/vgg.py official repository ran MIT (permissive) · 573861d5c02def4d · report
wrn34_10 cgcl-codes/transferattacksurrogates/TransferAttack/models/resnet.py official repository ran MIT (permissive) · 91926dac2d2c5373 · report
densenet121 cgcl-codes/transferattacksurrogates/TransferAttack/models/densenet.py official repository unverified MIT (permissive) · 7510d0bcd890c346 · report
densenet161 cgcl-codes/transferattacksurrogates/TransferAttack/models/densenet.py official repository unverified MIT (permissive) · 8fc5580681158f30 · report
densenet169 cgcl-codes/transferattacksurrogates/TransferAttack/models/densenet.py official repository unverified MIT (permissive) · 54ca014637609170 · report

Tasks

AttributeData Augmentation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

FocusSharpness-Aware Minimization

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