SOTAVerified

Generating Textual Adversaries with Minimal Perturbation

2022-11-12Code Available0· sign in to hype

Xingyi Zhao, Lu Zhang, Depeng Xu, Shuhan Yuan

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Many word-level adversarial attack approaches for textual data have been proposed in recent studies. However, due to the massive search space consisting of combinations of candidate words, the existing approaches face the problem of preserving the semantics of texts when crafting adversarial counterparts. In this paper, we develop a novel attack strategy to find adversarial texts with high similarity to the original texts while introducing minimal perturbation. The rationale is that we expect the adversarial texts with small perturbation can better preserve the semantic meaning of original texts. Experiments show that, compared with state-of-the-art attack approaches, our approach achieves higher success rates and lower perturbation rates in four benchmark datasets.

Tasks

Reproductions