Graph-based methods coupled with specific distributional distances for adversarial attack detection

Dwight Nwaigwe

doi:10.1016/j.neunet.2023.10.007

Graph-based methods coupled with specific distributional distances for adversarial attack detection

2024-01-01

1

OA

AI

DOI：10.1016/j.neunet.2023.10.007

Original

Save

View PDF

Abstract

En 中文

Artificial neural networks are prone to being fooled by carefully perturbed inputs which cause an egregious misclassification. These adversarial attacks have been the focus of extensive research. Likewise, there has been an abundance of research in ways to detect and defend against them. We introduce a novel approach of detection and interpretation of adversarial attacks from a graph perspective. For an input image, we compute an associated sparse graph using the layer-wise relevance propagation algorithm (Bach et al., 2015). Specifically, we only keep edges of the neural network with the highest relevance values. Three quantities are then computed from the graph which are then compared against those computed from the training set. The result of the comparison is a classification of the image as benign or adversarial. To make the comparison, two classification methods are introduced: (1) an explicit formula based on Wasserstein distance applied to the degree of node and (2) a logistic regression. Both classification methods produce strong results which lead us to believe that a graph-based interpretation of adversarial attacks is valuable.

Keywords:

Artificial neural network

Graph theory

Deep learning

Machine learning

Wasserstein

Bio-inspired

Graph-based methods coupled with specific distributional distances for adversarial attack detection

Abstract

AI Summary

Journal

Organization