paper-with-me

Papers

Universal Adversarial Attack Using Very Few Test Examples

2019-09-25 · Amit Deshpande, Sandesh Kamath, K V Subrahmanyam

Adversarial attacks such as Gradient-based attacks, Fast Gradient Sign Method (FGSM) by Goodfellow et al.(2015) and DeepFool by Moosavi-Dezfooli et al. (2016) are input-dependent, small pixel-wise perturbations of images which fool state of the art neural networks into misclassifying images but are unlikely to fool any human. On the other hand a universal adversarial attack is an input-agnostic perturbation. The same perturbation is applied to all inputs and yet the neural network is fooled on a large fraction of the inputs. In this paper, we show that multiple known input-dependent pixel-wise perturbations share a common spectral property. Using this spectral property, we show that the top singular vector of input-dependent adversarial attack directions can be used as a very simple universal adversarial attack on neural networks. We evaluate the error rates and fooling rates of three universal attacks, SVD-Gradient, SVD-DeepFool and SVD-FGSM, on state of the art neural networks. We show that these universal attack vectors can be computed using a small sample of test inputs. We establish our results both theoretically and empirically. On VGG19 and VGG16, the fooling rate of SVD-DeepFool and SVD-Gradient perturbations constructed from observing less than 0.2% of the validation set of ImageNet is as good as the universal attack of Moosavi-Dezfooli et al. (2017a). To prove our theoretical results, we use matrix concentration inequalities and spectral perturbation bounds. For completeness, we also discuss another recent approach to universal adversarial perturbations based on (p, q)-singular vectors, proposed independently by Khrulkov & Oseledets (2018), and point out the simplicity and efficiency of our universal attack as the key difference.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Adversarial Attack

Similar Papers 제목 키워드 기반

Universalization of any adversarial attack using very few test examples

2020-05-18 · Sandesh Kamath, Amit Deshpande, K V Subrahmanyam, Vineeth N Balasubramanian

Deep learning models are known to be vulnerable not only to input-dependent adversarial attacks but also to input-agnostic or universal adversarial attacks. Dezfooli et al. \cite{Dezfooli17,Dezfooli17anal} construct univ…

Adversarial Attack

TREATED:Towards Universal Defense against Textual Adversarial Attacks

2021-09-13 · Bin Zhu, Zhaoquan Gu, Le Wang, Zhihong Tian

Recent work shows that deep neural networks are vulnerable to adversarial examples. Much work studies adversarial example generation, while very little work focuses on more critical adversarial defense. Existing adversar…

Adversarial Defense

Effective Universal Unrestricted Adversarial Attacks using a MOE Approach

2021-02-27 · A. E. Baia, G. Di Bari, V. Poggioni

Recent studies have shown that Deep Leaning models are susceptible to adversarial examples, which are data, in general images, intentionally modified to fool a machine learning classifier. In this paper, we present a mul…

On Universalized Adversarial and Invariant Perturbations

2020-06-08 · Sandesh Kamath, Amit Deshpande, K V Subrahmanyam

Convolutional neural networks or standard CNNs (StdCNNs) are translation-equivariant models that achieve translation invariance when trained on data augmented with sufficient translations. Recent work on equivariant mode…

Translation

Regional Homogeneity: Towards Learning Transferable Universal Adversarial Perturbations Against Defenses

2019-04-01 · ECCV 2020 8 · Yingwei Li, Song Bai, Cihang Xie, Zhenyu Liao 외

This paper focuses on learning transferable adversarial examples specifically against defense models (models to defense adversarial attacks). In particular, we show that a simple universal perturbation can fool a series …

object-detectionObject DetectionSemantic Segmentation