T3: Tree-Autoencoder Constrained Adversarial Text Generation for Targeted Attack
arXiv:1912.10375
Abstract
Adversarial attacks against natural language processing systems, which perform seemingly innocuous modifications to inputs, can induce arbitrary mistakes to the target models. Though raised great concerns, such adversarial attacks can be leveraged to estimate the robustness of NLP models. Compared with the adversarial example generation in continuous data domain (e.g., image), generating adversarial text that preserves the original meaning is challenging since the text space is discrete and non-differentiable. To handle these challenges, we propose a target-controllable adversarial attack framework T3, which is applicable to a range of NLP tasks. In particular, we propose a tree-based autoencoder to embed the discrete text data into a continuous representation space, upon which we optimize the adversarial perturbation. A novel tree-based decoder is then applied to regularize the syntactic correctness of the generated text and manipulate it on either sentence (T3(Sent)) or word (T3(Word)) level. We consider two most representative NLP tasks: sentiment analysis and question answering (QA). Extensive experimental results and human studies show that T3 generated adversarial texts can successfully manipulate the NLP models to output the targeted incorrect answer without misleading the human. Moreover, we show that the generated adversarial texts have high transferability which enables the black-box attacks in practice. Our work sheds light on an effective and general way to examine the robustness of NLP models. Our code is publicly available at https://github.com/AI-secure/T3/.
Accepted to EMNLP 2020 as a long paper. 17 pages, 4 figures
References in corpus (12)
- Bidirectional Attention Flow for Machine Comprehension
- Robust Physical-World Attacks on Deep Learning Models
- Generating Natural Adversarial Examples
- Deep Text Classification Can be Fooled
- Adversarial Training Methods for Semi-Supervised Text Classification
- Towards Crafting Text Adversarial Samples
- When Are Tree Structures Necessary for Deep Learning of Representations?
- Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailment
- Seq2Sick: Evaluating the Robustness of Sequence-to-Sequence Models with Adversarial Examples
- Non-Monotonic Sequential Text Generation
- Discrete Adversarial Attacks and Submodular Optimization with Applications to Text Classification
- Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagation