Adversarial Examples for k-Nearest Neighbor Classifiers Based on Higher-Order Voronoi DiagramsDownload PDF

21 May 2021, 20:43 (modified: 26 Oct 2021, 07:31)NeurIPS 2021 PosterReaders: Everyone
Keywords: adversarial examples, k-nearest neighbors, robustness, Voronoi diagram
TL;DR: We propose GeoAdEx, an algorithm for finding adversarial examples on k-NN classifiers that leverage the structure of Voronoi diagrams for efficient approximations and speedup.
Abstract: Adversarial examples are a widely studied phenomenon in machine learning models. While most of the attention has been focused on neural networks, other practical models also suffer from this issue. In this work, we propose an algorithm for evaluating the adversarial robustness of $k$-nearest neighbor classification, i.e., finding a minimum-norm adversarial example. Diverging from previous proposals, we propose the first geometric approach by performing a search that expands outwards from a given input point. On a high level, the search radius expands to the nearby higher-order Voronoi cells until we find a cell that classifies differently from the input point. To scale the algorithm to a large $k$, we introduce approximation steps that find perturbation with smaller norm, compared to the baselines, in a variety of datasets. Furthermore, we analyze the structural properties of a dataset where our approach outperforms the competition.
Supplementary Material: pdf
Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
Code: zip
18 Replies

Loading