DiGradPatch: Black-Box Patch Attacks via Diffusion-Based Double Gradient and Sensitive Distribution Guidance

Deep neural networks have demonstrated vulnerabilities to black-box adversarial patch attacks in image analysis tasks, raising concerns about their robustness in safety-critical applications. Current methods typically rely on randomized search strategies to determine patch locations and apply unrestricted pixel perturbations in the patch area, leading to high query costs and significant visual distortions that reduce imperceptibility. To address these limitations, we propose Black-Box Patch Attacks via Diffusion-Based Double Gradient and Sensitive Distribution Guidance (DiGradPatch), a novel method designed to generate highly imperceptible adversarial samples with minimal query cost. Our approach leverages the prior sensitive distribution of a surrogate model to efficiently locate the patch by maximizing the joint probability distribution between the global model prediction and selected image regions. Furthermore, we introduce the diffusion model into the black-box patch attack framework for the first time. The prior gradient from the diffusion model, in conjunction with the estimated gradient of the target model, is used to guide the direction of perturbations. This allows the generation of adversarial perturbations within the patch area that align with the distribution of natural samples, effectively reducing perceptual distortions. Extensive experiments on the ImageNet dataset show that DiGradPatch achieves superior imperceptibility with significantly reduced query costs, maintaining a high attack success rate. Compared to existing methods, our approach requires fewer than 10 queries and achieves an L<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</inf> norm that is only 1/10 of state-of-the-art techniques, while maintaining the highest attack success rate.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10887692
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DiGradPatch: Black-Box Patch Attacks via Diffusion-Based Double Gradient and Sensitive Distribution Guidance

Jing Liu, Yang Wu
Adversarial Robustness in Machine Learning
article

DiGradPatch: Black-Box Patch Attacks via Diffusion-Based Double Gradient and Sensitive Distribution Guidance

Jing Liu, Yang Wu
article en

Abstract

Deep neural networks have demonstrated vulnerabilities to black-box adversarial patch attacks in image analysis tasks, raising concerns about their robustness in safety-critical applications. Current methods typically rely on randomized search strategies to determine patch locations and apply unrestricted pixel perturbations in the patch area, leading to high query costs and significant visual distortions that reduce imperceptibility. To address these limitations, we propose Black-Box Patch Attacks via Diffusion-Based Double Gradient and Sensitive Distribution Guidance (DiGradPatch), a novel method designed to generate highly imperceptible adversarial samples with minimal query cost. Our approach leverages the prior sensitive distribution of a surrogate model to efficiently locate the patch by maximizing the joint probability distribution between the global model prediction and selected image regions. Furthermore, we introduce the diffusion model into the black-box patch attack framework for the first time. The prior gradient from the diffusion model, in conjunction with the estimated gradient of the target model, is used to guide the direction of perturbations. This allows the generation of adversarial perturbations within the patch area that align with the distribution of natural samples, effectively reducing perceptual distortions. Extensive experiments on the ImageNet dataset show that DiGradPatch achieves superior imperceptibility with significantly reduced query costs, maintaining a high attack success rate. Compared to existing methods, our approach requires fewer than 10 queries and achieves an L<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</inf> norm that is only 1/10 of state-of-the-art techniques, while maintaining the highest attack success rate.

Inner Mongolia University (CN)
Natural Science Foundation of Inner Mongolia
Climate action
Openalex Percentile: Top 98%
Adversarial Robustness in Machine Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.