Name
Abstract | ||
|---|---|---|
We investigate conditions under which test statistics exist that can reliably detect examples, which have been adversarially manipulated in a white-box attack. These statistics can be easily computed and calibrated by randomly corrupting inputs. They exploit certain anomalies that adversarial attacks introduce, in particular if they follow the paradigm of choosing perturbations optimally under p-norm constraints. Access to the log-odds is the only requirement to defend models. We justify our approach empirically, but also provide conditions under which detectability via the suggested test statistics is guaranteed to be effective. In our experiments, we show that it is even possible to correct test time predictions for adversarial attacks with high accuracy. |
Year | Venue | Field |
|---|---|---|
2019 | arXiv: Learning | Computer science,Artificial intelligence,Odds,Machine learning,Statistical hypothesis testing,Adversarial system |
DocType | Volume | Citations |
Journal | abs/1902.04818 | 1 |
PageRank | References | Authors |
0.34 | 20 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roth, Kevin | 1 | 44 | 3.66 |
| Yannic Kilcher | 2 | 8 | 4.28 |
| Thomas Hofmann | 3 | 10064 | 1001.83 |