Adversary Detection in Neural Networks via Persistent Homology

11/28/2017
by   Thomas Gebhart, et al.
0

We outline a detection method for adversarial inputs to deep neural networks. By viewing neural network computations as graphs upon which information flows from input space to out- put distribution, we compare the differences in graphs induced by different inputs. Specifically, by applying persistent homology to these induced graphs, we observe that the structure of the most persistent subgraphs which generate the first homology group differ between adversarial and unperturbed inputs. Based on this observation, we build a detection algorithm that depends only on the topological information extracted during training. We test our algorithm on MNIST and achieve 98 accuracy with F1-score 0.98.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset