BeamAttack: Generating High-quality Textual Adversarial Examples through Beam Search and Mixed Semantic Spaces
Not on the map. Why?
Abstract (arXiv)
Natural language processing models based on neural networks are vulnerable to adversarial examples. These adversarial examples are imperceptible to human readers but can mislead models to make the wrong predictions. In a black-box setting, attacker can fool the model without knowing model's parameters and architecture. Previous works on word-level attacks widely use single semantic space and greedy search as a search strategy. However, these methods fail to balance the attack success rate, quality of adversarial examples and time consumption. In this paper, we propose BeamAttack, a textual attack algorithm that makes use of mixed semantic spaces and improved beam search to craft high-quality adversarial examples. Extensive experiments demonstrate that BeamAttack can improve attack success rate while saving numerous queries and time, e.g., improving at most 7% attack success rate than greedy search when attacking the examples from MR dataset. Compared with heuristic search, BeamAttack can save at most 85% model queries and achieve a competitive attack success rate. The adversarial examples crafted by BeamAttack are highly transferable and can effectively improve model's robustness during adversarial training. Code is available at https://github.com/zhuhai-ustc/beamattack/tree/master
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 15 of its 26 references that are in the map. First posted on arXiv 9 Mar 2023.
Builds on
15 of 26 references.
References · 15
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2013Intriguing properties of neural networkscited by 5,114
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
- 2015A large annotated corpus for learning natural language inferencecited by 1,837
- 2014Convolutional Neural Networks for Sentence Classificationcited by 1,124
- 2019Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailmentcited by 663
- 2020BERT-ATTACK: Adversarial Attack Against BERT Using BERTcited by 488
- 2018TextBugger: Generating Adversarial Text Against Real-world Applicationscited by 376
- 2018Black-box Generation of Adversarial Text Sequences to Evade Deep Learning Classifierscited by 341
- 2020BAE: BERT-based Adversarial Examples for Text Classificationcited by 316
- 2018Audio Adversarial Examples: Targeted Attacks on Speech-to-Textcited by 268
- 2016Counter-fitting Word Vectors to Linguistic Constraintscited by 138
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2; 2026: 1.
5 papers.
- 2023LimeAttack: Local Explainable Method for Textual Hard-Label Adversarial Attackcited by 9
- 2025Semantic-Preserving Prompt Hijacking: A Black-Box Adversarial Attack on Auto-Prompt Optimizationcited by 2
- 2024Optimal and efficient text counterfactuals using Graph Neural Networkscited by 1
- 2026Augmenting Text to Increase Translation Difficultycited by 1
- 2025Robustness of Misinformation Classification Systems to Adversarial Examples Through BeamAttackcited by 0
- 2026Augmenting Text to Increase Translation Difficulty16 Aug 2026
- 2025Robustness of Misinformation Classification Systems to Adversarial Examples Through BeamAttack30 Jun 2025
- 2025Semantic-Preserving Prompt Hijacking: A Black-Box Adversarial Attack on Auto-Prompt Optimization26 May 2025
- 2024Optimal and efficient text counterfactuals using Graph Neural Networks4 Aug 2024
- 2023LimeAttack: Local Explainable Method for Textual Hard-Label Adversarial Attack1 Aug 2023