← Lab /AI/ML

Simple rectangular occlusions achieve high black-box attack success with few queries

AI/ML Attack · Simulation · arXiv

The claim

STROKE can reliably fool diverse image classifiers using 1-2% area occlusions with low query counts

Ankit Gupta, Akshat Pandya, Paul Lin, Christoph Adami, Emily Dolson · arXiv Paper PDF

Published as: “STROKE: Simple Sparse Structural Occlusions for Black-Box Adversarial Attacks”

So what

The runtime efficiency enables large-scale robustness testing of vision models that would be impractical with slower patch-based black-box attacks.

The five-minute version

STROKE achieves very high untargeted attack success (up to 98.4% ASR) with low query counts and dramatically faster wall-clock time (0.22 s per image) compared to prior patch attacks. It uses a simple rectangular stroke parameterization and a greedy add-and-refine search, yielding strong performance across CNN and transformer models at 1-2% pixel coverage. Targeted attacks are competitive but not uniformly best, and the method requires confidence scores. The evidence comes from experiments on 500 ImageNet and CIFAR images with baselines IMPACT, Patch-RS, and TPA.

What they found 2

What undercuts it the paper’s own results

Stated limits 2

What’s new here 4

Artifacts & methods 7

Topics

black-box adversarial attacksquery-efficient attackspatch attacksstructured occlusionsgreedy add-and-refine optimizationcoverage-regulated attacksscore-based attackstransformer vulnerability
← Previous Optimized tool descriptions can deceive LLM agents with 92% success