Abstract

In black-box scenarios, the adversarial attack algorithms based on iterative optimization perform best. But it may give a false sense of model robustness due to the design of inefficient queries. The adversarial attack algorithm based on multi-objective evolution optimization has been proven to be very effective for the low-dimensional images. However, when the attack space dramatically increases for the high-dimensional color images, the evolutionary efficiency is limited, and it needs more inefficient queries to generate adversarial examples. In this paper, we propose an efficient black-box adversarial attack approach for high dimensional images based on multi-objective optimization (MOO-HD), which includes some novel strategies to solve the above problems. We also propose the strategy of “The transformation of the pixel block with a random step size” to reduce the attack space. The experimental results on three image datasets with different dimensions show that our algorithm can achieve a higher success rate with fewer queries.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call