Learning-based Memetic Algorithm for Hard-label Textual Attack
Deep neural networks are widely known to be vulnerable to adversarial examples in Natural Language Processing. However, existing textual adversarial attacks usually utilize the gradient or prediction confidence to generate adversarial examples, making it hard to be applied in real-world applications. To this end, we consider a more rigorous setting, namely hard-label attack, in which the attacker could only access the prediction labels. There are only a few hard-label attacks proposed currently, among which the one based on genetic algorithm exhibits high attack performance. It inspires us to design a new hard-label attack for better performance based on a combinatorial optimization approach. In this work, we propose a novel hard-label attack, named Learning-based Memetic Algorithm (LMA), which integrates the word importance learned from the attack history into the search of memetic algorithm to optimize the adversary perturbation. Extensive evaluations for text classification and textual entailment using various datasets and models demonstrate that the proposed LMA significantly outperforms existing hard-label attack regarding attack performance and adversary quality.
Code (0)
등록된 구현이 없습니다.
Tasks
Combinatorial OptimizationHard-label AttackNatural Language Inferencetext-classificationText ClassificationSimilar Papers 제목 키워드 기반
TextHacker: Learning based Hybrid Local Search Algorithm for Text Hard-label Adversarial Attack
Existing textual adversarial attacks usually utilize the gradient or prediction confidence to generate adversarial examples, making it hard to be deployed in real-world applications. To this end, we consider a rarely inv…
Adversarial AttackHard-label AttackNatural Language InferencePrediction+2Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems
Memetic algorithms are popular hybrid search heuristics that integrate local search into the search process of an evolutionary algorithm in order to combine the advantages of rapid exploitation and global optimisation. H…
Evolutionary AlgorithmsLimeAttack: Local Explainable Method for Textual Hard-Label Adversarial Attack
Natural language processing models are vulnerable to adversarial examples. Previous textual adversarial attacks adopt gradients or confidence scores to calculate word importance ranking and generate adversarial examples.…
Adversarial AttackHard-label AttackA Multi-objective Memetic Algorithm for Auto Adversarial Attack Optimization Design
The phenomenon of adversarial examples has been revealed in variant scenarios. Recent studies show that well-designed adversarial defense strategies can improve the robustness of deep learning models against adversarial …
Adversarial AttackAdversarial DefenseA Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem
The Travelling Salesman Problem (TSP) is one of the most popular Combinatorial Optimization Problem. It is well solicited for the large variety of applications that it can solve, but also for its difficulty to find optim…
Combinatorial Optimization