Name
Abstract | ||
|---|---|---|
Recently, Kannan et al. [2018] proposed several logit regularization methods to improve the adversarial robustness of classifiers. We show that the computationally fast methods they propose - Clean Logit Pairing (CLP) and Logit Squeezing (LSQ) - just make the gradient-based optimization problem of crafting adversarial examples harder without providing actual robustness. We find that Adversarial Logit Pairing (ALP) may indeed provide robustness against adversarial examples, especially when combined with adversarial training, and we examine it in a variety of settings. However, the increase in adversarial accuracy is much smaller than previously claimed. Finally, our results suggest that the evaluation against an iterative PGD attack relies heavily on the parameters used and may result in false conclusions regarding robustness of a model. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Learning | Logit,Mathematical optimization,Robustness (computer science),Pairing,Regularization (mathematics),Artificial intelligence,Optimization problem,Machine learning,Mathematics,Adversarial system |
DocType | Volume | Citations |
Journal | abs/1810.12042 | 4 |
PageRank | References | Authors |
0.39 | 14 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marius Mosbach | 1 | 4 | 4.79 |
| Andriushchenko, Maksym | 2 | 46 | 4.46 |
| Thomas Alexander Trost | 3 | 4 | 1.41 |
| Matthias A. Hein | 4 | 222 | 23.19 |
| dietrich klakow | 5 | 756 | 98.76 |