Deep Text Classification Can be Fooled
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
TokenBreak: Bypassing Text Classification Models Through Token Manipulation
Incremental Sequence Classification with Temporal Consistency
Small Language Models in the Real World: Insights from Industrial Text Classification
Token Masking Improves Transformer-Based Text Classification
KDH-MLTC: Knowledge Distillation for Healthcare Multi-Label Text Classification
Towards Robust Few-Shot Text Classification Using Transformer Architectures and Dual Loss Strategies
토론
이 논문과 연결된 포럼 글이 아직 없습니다.