Towards query-efficient black-box adversary with zeroth-order natural gradient descent

28Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

Abstract

Despite the great achievements of the modern deep neural networks (DNNs), the vulnerability/robustness of state-of-the-art DNNs raises security concerns in many application domains requiring high reliability. Various adversarial attacks are proposed to sabotage the learning performance of DNN models. Among those, the black-box adversarial attack methods have received special attentions owing to their practicality and simplicity. Black-box attacks usually prefer less queries in order to maintain stealthy and low costs. However, most of the current black-box attack methods adopt the first-order gradient descent method, which may come with certain deficiencies such as relatively slow convergence and high sensitivity to hyper-parameter settings. In this paper, we propose a zeroth-order natural gradient descent (ZO-NGD) method to design the adversarial attacks, which incorporates the zeroth-order gradient estimation technique catering to the black-box attack scenario and the second-order natural gradient descent to achieve higher query efficiency. The empirical evaluations on image classification datasets demonstrate that ZO-NGD can obtain significantly lower model query complexities compared with state-of-the-art attack methods.

Cite

CITATION STYLE

APA

Zhao, P., Chen, P. Y., Wang, S., & Lin, X. (2020). Towards query-efficient black-box adversary with zeroth-order natural gradient descent. In AAAI 2020 - 34th AAAI Conference on Artificial Intelligence (pp. 6909–6916). AAAI press. https://doi.org/10.1609/aaai.v34i04.6173

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free