Pith. sign in

REVIEW 1 cited by

Who's Afraid of Adversarial Transferability?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.00433 v3 pith:EQUFAQ4W submitted 2021-05-02 cs.LG cs.CR

classification cs.LGcs.CR
keywords adversarialtransferabilityreal-lifeattacklearningmodeladversariesattacks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Adversarial transferability, namely the ability of adversarial perturbations to simultaneously fool multiple learning models, has long been the "big bad wolf" of adversarial machine learning. Successful transferability-based attacks requiring no prior knowledge of the attacked model's parameters or training data have been demonstrated numerous times in the past, implying that machine learning models pose an inherent security threat to real-life systems. However, all of the research performed in this area regarded transferability as a probabilistic property and attempted to estimate the percentage of adversarial examples that are likely to mislead a target model given some predefined evaluation set. As a result, those studies ignored the fact that real-life adversaries are often highly sensitive to the cost of a failed attack. We argue that overlooking this sensitivity has led to an exaggerated perception of the transferability threat, when in fact real-life transferability-based attacks are quite unlikely. By combining theoretical reasoning with a series of empirical results, we show that it is practically impossible to predict whether a given adversarial example is transferable to a specific target model in a black-box setting, hence questioning the validity of adversarial transferability as a real-life attack tool for adversaries that are sensitive to the cost of a failed attack.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. With Great Backbones Comes Great Adversarial Transferability

    cs.CV 2025-01 conditional novelty 6.0 of 10

    A backbone-only attack that maximizes feature-space distance in a shared pre-trained network transfers to downstream fine-tuned models almost as effectively as white-box attacks.

Pith tools