ADSAttack: An Adversarial Attack Algorithm via Searching Adversarial Distribution in Latent Space

5Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Deep neural networks are susceptible to interference from deliberately crafted noise, which can lead to incorrect classification results. Existing approaches make less use of latent space information and conduct pixel-domain modification in the input space instead, which increases the computational cost and decreases the transferability. In this work, we propose an effective adversarial distribution searching-driven attack (ADSAttack) algorithm to generate adversarial examples against deep neural networks. ADSAttack introduces an affiliated network to search for potential distributions in image latent space for synthesizing adversarial examples. ADSAttack uses an edge-detection algorithm to locate low-level feature mapping in input space to sketch the minimum effective disturbed area. Experimental results demonstrate that ADSAttack achieves higher transferability, better imperceptible visualization, and faster generation speed compared to traditional algorithms. To generate 1000 adversarial examples, ADSAttack takes (Formula presented.) and, on average, achieves a success rate of (Formula presented.).

Cite

CITATION STYLE

APA

Wang, H., Zhu, C., Cao, Y., Zhuang, Y., Li, J., & Chen, X. (2023). ADSAttack: An Adversarial Attack Algorithm via Searching Adversarial Distribution in Latent Space. Electronics (Switzerland), 12(4). https://doi.org/10.3390/electronics12040816

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free