REVIEW 3 cited by
Deep Text Classification Can be Fooled
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 3 Pith papers
-
Vulnerability of Natural Language Classifiers to Evolutionary Generated Adversarial Text
GAversary, a black-box genetic algorithm with GloVe-based mutations, generates adversarial examples that reduce NLP model accuracy more than BAE or A2T on benchmarks while perturbing more words.
-
Natural Adversarial Sentence Generation with Gradient-based Perturbation
Gradient-based perturbation of sentence embeddings, followed by a trained decoder, produces adversarial sentences that fool sentiment classifiers and transfer to Amazon Comprehend.
-
Cross-Entropy Attacks to Language Models via Rare Event Simulation
A cross-entropy optimization attack (CEA) with sememe- and MLM-based candidate words improves black-box adversarial attacks on classifiers and machine translation models.
Discussion (0). Continue with ORCID to comment.