Name
Abstract | ||
|---|---|---|
Modern deep neural networks(DNNs) are vulnerable to adversarial samples. Sparse adversarial samples are a special branch of adversarial samples that can fool the target model by only perturbing a few pixels. The existence of the sparse adversarial attack points out that DNNs are much more vulnerable than people believed, which is also a new aspect for analyzing DNNs. However, current sparse adversarial attack methods still have some shortcomings on both sparsity and invisibility. In this paper, we propose a novel two-stage distortion-aware greedy-based method dubbed as âÂÂGreedyFool". Specifically, it first selects the most effective candidate positions to modify by considering both the gradient(for adversary) and the distortion map(for invisibility), then drops some less important points in the reduce stage. Experiments demonstrate that compared with the start-of-the-art method, we only need to modify $3\times$ fewer pixels under the same sparse perturbation setting. For target attack, the success rate of our method is 9.96\% higher than the start-of-the-art method under the same pixel budget. Code can be found at https://github.com/LightDXY/GreedyFool. |
Year | Venue | DocType |
|---|---|---|
2020 | NIPS 2020 | Conference |
Volume | Citations | PageRank |
33 | 0 | 0.34 |
References | Authors | |
0 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| X. Dong | 1 | 33 | 8.20 |
| Dongdong Chen | 2 | 52 | 19.10 |
| Jianmin Bao | 3 | 22 | 5.76 |
| Chuan Qin | 4 | 953 | 56.63 |
| Lu Yuan | 5 | 801 | 48.29 |
| Weiming Zhang | 6 | 1104 | 88.72 |
| Nenghai Yu | 7 | 2238 | 183.33 |
| Dong Chen | 8 | 681 | 32.51 |