A Large-scale Multiple-objective Method for Black-box Attack against Object Detection
Siyuan Liang, Longkang Li, Yanbo Fan, Xiaojun Jia, Jingzhi Li, Baoyuan, Wu, and Xiaochun Cao

TL;DR
This paper introduces GARSDC, a novel large-scale multi-objective optimization method that significantly enhances black-box adversarial attacks on object detectors by efficiently optimizing over millions of variables.
Contribution
It proposes a new multi-objective attack framework with an improved genetic algorithm and gradient-based initialization, achieving better attack performance and efficiency.
Findings
Reduces mean Average Precision (mAP) by 12.0 on average.
Decreases query count by about 1000 times.
Outperforms state-of-the-art attack methods in experiments.
Abstract
Recent studies have shown that detectors based on deep models are vulnerable to adversarial examples, even in the black-box scenario where the attacker cannot access the model information. Most existing attack methods aim to minimize the true positive rate, which often shows poor attack performance, as another sub-optimal bounding box may be detected around the attacked bounding box to be the new true positive one. To settle this challenge, we propose to minimize the true positive rate and maximize the false positive rate, which can encourage more false positive objects to block the generation of new true positive bounding boxes. It is modeled as a multi-objective optimization (MOP) problem, of which the generic algorithm can search the Pareto-optimal. However, our task has more than two million decision variables, leading to low searching efficiency. Thus, we extend the standard…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning
