English

Deep Text Classification Can be Fooled

Cryptography and Security 2019-01-08 v2 Machine Learning

Abstract

In this paper, we present an effective method to craft text adversarial samples, revealing one important yet underestimated fact that DNN-based text classifiers are also prone to adversarial sample attack. Specifically, confronted with different adversarial scenarios, the text items that are important for classification are identified by computing the cost gradients of the input (white-box attack) or generating a series of occluded test samples (black-box attack). Based on these items, we design three perturbation strategies, namely insertion, modification, and removal, to generate adversarial samples. The experiment results show that the adversarial samples generated by our method can successfully fool both state-of-the-art character-level and word-level DNN-based text classifiers. The adversarial samples can be perturbed to any desirable classes without compromising their utilities. At the same time, the introduced perturbation is difficult to be perceived.

Keywords

Cite

@article{arxiv.1704.08006,
  title  = {Deep Text Classification Can be Fooled},
  author = {Bin Liang and Hongcheng Li and Miaoqiang Su and Pan Bian and Xirong Li and Wenchang Shi},
  journal= {arXiv preprint arXiv:1704.08006},
  year   = {2019}
}

Comments

8 pages

R2 v1 2026-06-22T19:28:09.943Z