arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.11293cs.CVcs.LG

Adversarial Ranking Attack and Defense

Xidian University(西安电子科技大学);Alibaba DAMO MIIL(阿里巴巴达摩院);Xi’an Jiaotong University(西安交通大学);HERE Technologies(HERE技术公司);Wormpex AI Research(Wormpex人工智能研究院)

Mo Zhou, Zhenxing Niu, Le Wang, Qilin Zhang, Gang Hua

英文摘要:

Deep Neural Network (DNN) classifiers are vulnerable to adversarial attack, where an imperceptible perturbation could result in misclassification. However, the vulnerability of DNN-based image ranking systems remains under-explored. In this paper, we propose two attacks against deep ranking systems, i.e., Candidate Attack and Query Attack, that can raise or lower the rank of chosen candidates by adversarial perturbations. Specifically, the expected ranking order is first represented as a set of inequalities, and then a triplet-like objective function is designed to obtain the optimal perturbation. Conversely, a defense method is also proposed to improve the ranking system robustness, which can mitigate all the proposed attacks simultaneously. Our adversarial ranking attacks and defense are evaluated on datasets including MNIST, Fashion-MNIST, and Stanford-Online-Products. Experimental results demonstrate that a typical deep ranking system can be effectively compromised by our attacks. Meanwhile, the system robustness can be moderately improved with our defense. Furthermore, the transferable and universal properties of our adversary illustrate the possibility of realistic black-box attack.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑