Multi-objective Evolutionary Search of Variable-length Composite Semantic Perturbations
Deep neural networks have proven to be vulnerable to adversarial attacks in the form of adding specific perturbations on images to make wrong outputs. Designing stronger adversarial attack methods can help more reliably evaluate the robustness of DNN models. To release the harbor burden and improve the attack performance, auto machine learning (AutoML) has recently emerged as one successful technique to help automatically find the near-optimal adversarial attack strategy. However, existing works about AutoML for adversarial attacks only focus on $L_{\infty}$-norm-based perturbations. In fact, semantic perturbations attract increasing attention due to their naturalnesses and physical realizability. To bridge the gap between AutoML and semantic adversarial attacks, we propose a novel method called multi-objective evolutionary search of variable-length composite semantic perturbations (MES-VCSP). Specifically, we construct the mathematical model of variable-length composite semantic perturbations, which provides five gradient-based semantic attack methods. The same type of perturbation in an attack sequence is allowed to be performed multiple times. Besides, we introduce the multi-objective evolutionary search consisting of NSGA-II and neighborhood search to find near-optimal variable-length attack sequences. Experimental results on CIFAR10 and ImageNet datasets show that compared with existing methods, MES-VCSP can obtain adversarial examples with a higher attack success rate, more naturalness, and less time cost.
Code (0)
등록된 구현이 없습니다.
Tasks
Adversarial AttackAutoMLMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
EmoDM: A Diffusion Model for Evolutionary Multi-objective Optimization
Evolutionary algorithms have been successful in solving multi-objective optimization problems (MOPs). However, as a class of population-based search methodology, evolutionary algorithms require a large number of evaluati…
Computational EfficiencyEvolutionary AlgorithmsGridless Evolutionary Approach for Line Spectral Estimation with Unknown Model Order
Gridless methods show great superiority in line spectral estimation. These methods need to solve an atomic $l_0$ norm (i.e., the continuous analog of $l_0$ norm) minimization problem to estimate frequencies and model ord…
Multiobjective OptimizationTRUST-TAEA: A trustworthiness-guided two-archive evolutionary algorithm with variable-grouping sparse search for large-scale multi-objective optimization
Large-scale multi-objective optimization problems (LSMOPs) remain challenging due to the high-dimensional decision spaces, complex variable interactions, and limited function evaluation budgets, which make it difficult t…
An Evolutionary Algorithm with Probabilistic Annealing for Large-scale Sparse Multi-objective Optimization
Large-scale sparse multi-objective optimization problems (LSMOPs) are prevalent in real-world applications, where optimal solutions typically contain only a few nonzero variables, such as in adversarial attacks, critical…
Variable Division and Optimization for Constrained Multiobjective Portfolio Problems
Variable division and optimization (D\&O) is a frequently utilized algorithm design paradigm in Evolutionary Algorithms (EAs). A D\&O EA divides a variable into partial variables and then optimize them respectively. A co…
Evolutionary Algorithms