Benchmarking Adversarial Patch Selection and Location

Shai Kimhi, Avi Mendlson, Moshe Kimhi
8/3/2025
cs.CVcs.CRcs.LG

No confident code implementation found for this paper.

Abstract

Adversarial patch attacks threaten the reliability of modern vision models. We present PatchMap, the first spatially exhaustive benchmark of patch placement, built by evaluating over 1.5e8 forward passes on ImageNet validation images. PatchMap reveals systematic hot-spots where small patches (as little as 2% of the image) induce confident misclassifications and large drops in model confidence. To demonstrate its utility, we propose a simple segmentation guided placement heuristic that leverages off the shelf masks to identify vulnerable regions without any gradient queries. Across five architectures-including adversarially trained ResNet50, our method boosts attack success rates by 8 to 13 percentage points compared to random or fixed placements. We publicly release PatchMap and the code implementation. The full PatchMap bench (6.5B predictions, multiple backbones) will be released soon to further accelerate research on location-aware defenses and adaptive attacks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kimhi2025benchmarking,
  title  = {Benchmarking Adversarial Patch Selection and Location},
  author = {Shai Kimhi and Avi Mendlson and Moshe Kimhi},
  year   = {2025},
  eprint = {2508.01676},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.01676v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.01676.svg)](https://codeofpaper.com/paper/2508.01676)

Discussion