U Berkeley, Chawin Sitawarin, Evgenios Kornaropoulos, David Wagner
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2011.09719")
get_code_for_paper("2011.09719")
have("2011.09719")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2011.09719.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2011.09719)
Connect an agent — have() is free.