Title: ADVERSARIAL EXAMPLES FOR NATURAL LANGUAGE CLASSIFICATION PROBLEMS

Abstract: Modern machine learning algorithms are often susceptible to adversarial examples -maliciously crafted inputs that are undetectable by humans but that fool the algorithm into producing undesirable behavior. In this work, we show that adversarial examples exist in natural language classification: we formalize the notion of an adversarial example in this setting and describe algorithms that construct such examples. Adversarial perturbations can be crafted for a wide range of tasks -including spam filtering, fake news detection, and sentiment analysis -and affect different models -convolutional and recurrent neural networks as well as linear classifiers to a lesser degree. Constructing an adversarial example involves replacing 10-30% of words in a sentence with synonyms that don't change its meaning. Up to 90% of input examples admit adversarial perturbations; furthermore, these perturbations retain a degree of transferability across models. Our findings demonstrate the existence of vulnerabilities in machine learning systems and hint at limitations in our understanding of classification algorithms.

1. INTRODUCTION:

Modern machine learning algorithms are often susceptible to adversarial examples -maliciously crafted inputs that are undetectable by humans but that fool the algorithm into producing undesirable behavior. Adversarial examples arise in image classification (Szegedy et al., 2014) , speech recognition (Carlini et al., 2016) , reinforcement learning (Behzadan & Munir, 2017) and in other domains. The existence of adversarial inputs has obvious security implications and also reveals important shortcomings in our understanding of modern machine learning algorithms.

In this work, we study adversarial perturbations in the context of natural language, and show that common text classification algorithms are affected by adversarially crafted inputs. Our work formalizes the notion of an adversarial example in natural language classification and proposes algorithms for constructing such examples. We also investigate reasons that give rise to adversarial examples, and identify two distinct factors affecting the vulnerability of a model; the first originates in the embedding layer of a neural network classifier, while the second originates in the hidden layers.

Constructing adversarial inputs typically involves replacing 10-30% of words in a sentence with synonyms that don't change its original meaning. Our experiments suggest that such inputs can be consistently constructed across multiple domains -including spam classification, fake news detection, and sentiment analysis -and in different models -convolutional and recurrent neural networks as well as linear classifiers to a lesser degree. Up to 90% of input examples admit adversarial perturbations; furthermore, these perturbations retain a degree of transferability across models.

Our findings suggest the existence of vulnerabilities in text classification systems and hint at limitations in our understanding of these systems. More generally, our work highlights the need to further investigate adversarial inputs in natural language tasks as well as in classification problems over discrete inputs.

Task: Spam filtering. Classifier: LSTM. Original label: 100% Spam. New label: 89% Non-Spam. Text: your application petition has been accepted recognized thank you for your loan borrower request petition , which we recieved yesterday , your refinance subprime application petition has been accepted recognized good credit or not , we are ready to give you a $ oov loan , after further review , our lenders have established the lowest monthly payments . approval process will take only 1 minute . please visit the confirmation link below and fill-out our short 30 second secure web-form . http : oov Task: Sentiment analysis. Classifier: CNN. Original label: 81% Positive. New label: 100% Negative. Text: i went moved to wing wednesday which is all-you-can-eat wings for $ oov even though they raise the prices it 's still ever really great deal . you can eat as many wings you want to get all the different flavors tastes and have a good time enjoying the atmosphere . the girls are smoking hot ! all the types of sauces dressings are awesome ! and i had at least 25 wings in one sitting . i would definitely certainly go again just simply not every wednesday friday maybe once a month .

Task: Fake news detection. Classifier: Naive Bayes. Original label: 97% Fake. New label: 100% Real Text: trump supporter whose brutal ferocious beating by black mob gangsta was caught on video tape asks demands : " what happened to america ? " [ video ] , " david oov , a 49 year old former chicago rochester man who was brutally beaten by a mob lowlife of black democrats asks demands , " what happened to america ? " here is his very sad disappointing story Figure 1 : Adversarial examples for three natural language classification tasks. Replacing a fraction of the words in a document with adversarially-chosen synonyms fools classifiers into predicting an incorrect label. The new document is classified correctly by humans, and preserves most of the original meaning, although it contains small factual and grammatical errors.

2. BACKGROUND:

We study classification problems, in which the goal is to learn a mapping f : X → Y from an input x ∈ X to a target label y ∈ Y, which lies in some finite set of K classes Y = {y 1 , y 2 , ..., y K }. The classifier f associates a score f y k (x) to each class y k and outputs the class with the highest score. In this paper, f will be parametrized by a deep neural network or a linear model.

2.1. ADVERSARIAL EXAMPLES AND IMAGE CLASSIFICATION:

Despite recent successes, modern classification algorithms based on deep neural networks are susceptible to adversarial examples (Szegedy et al., 2014) , which are maliciously crafted inputs that are indistinguishable from real examples by humans, but that cause the algorithm to misbehave.

In the context of image classification, given a classifier f , we say that x is an adversarial perturbation of x targeting class y (distinct from the true class y of x) if f (x ) = y and x -x ≤ .

(1) The norm • captures the notion of an imperceptible perturbation; popular choices include the 2 or the ∞ norms. For simplicity, we refer to x as an adversarial example for f . Adversarial examples can be obtained by solving an optimization problem of the form max

EQUATION

in which the objective J(x ) measures the extent to which x is adversarial and may be a function of a target class y = y, e.g. J(x ) = f y (x ). Algorithms for solving the above objective include the Fast Gradient Sign method or iterative methods based on constrained gradient descent (Goodfellow et al., 2014; Papernot et al., 2016) .

2.2. CLASSIFYING NATURAL LANGUAGE UTTERANCES:

Text classification problems arise in varous domains, including biomedical (Aggarwal & Zhai, 2012), spam filtering (Androutsopoulos et al., 2000) , and financial (Schumaker & Chen, 2009 ).

Linear classifiers with n-gram features often perform surprisingly well on text classification benchmarks (Wang & Manning, 2012) . In recent years, variants of recurrent networks -especially classifiers based on long short-term memory (Hochreiter & Schmidhuber, 1997) -have helped improve state-of-the-art accuracy; most recently, convolutional neural networks have been shown to be competitive with recurrent methods (Kim, 2014; Zhang et al., 2015) Natural language classification problems distinguish themselves from image classification by their discrete nature (the inputs x consist of discrete symbols such as characters or words) and by their higher dimensionality, which is typically proportional to vocabulary size. Furthermore, natural language representations are in a sense "higher-level" than image pixels, since they raw words encode significantly more meaning than raw pixel values. These differences pose natural constraints on the notion of an adversarial example, which our work explores.

3. ADVERSARIAL EXAMPLES FOR NATURAL LANGUAGE CLASSIFICATION:

This work explores adversarial examples in the context of natural language classification. Defining adversarial inputs for text classifiers is complicated by two problems: first, there is no simple notion of metric between utterances (making it difficult to define an imperceptible perturbation); second, discrete inputs are not amenable to gradient-based methods and thus require new optimization algorithms.

In this section, we first propose a general notion of adversarial perturbation that applies to both continuous and discrete inputs. Then, we instantiate this notion in the context of language classification. Finally, we propose a general optimization algorithm for constructing adversarial inputs; the following section examines our approach experimentally.

3.1. ALTERED ADVERSARIAL EXAMPLES:

A large class of adversarial inputs are formed by adding imperceptible perturbations to ordinary dataset samples. We propose to refer to this general type of adversarial attack as altered adversarial examples.

Given a classifier f , we say that x is an adversarial alteration of x targeting class y if

EQUATION

for some domain-specific constraint function c : X × X → R L + and a vector of bounds γ ∈ R L that capture the notion of imperceptible alteration via L ≥ 1 constraints. For example, in the context of chemical molecules, we may use c to capture the edit distance between x and x or the similarity of the molecules' three-dimensional structure. In the context of image classification, we recover the original notion of adversarial examples by taking c to be an 2 or ∞ norm constraint.

Our definition in contrast to other types of adversarial inputs explored in the literature. These include obfuscated examples (Carlini et al., 2016) -in which the input appears as white noise but triggers unwanted behavior (e.g., audio that turns on a smartphone) -and concatenative examples (Jia & Liang, 2017) -in which the input is combined with a distracting sequence that contains irrelevant information. Altered examples, on the other hand, encompass the original notion of adversarial perturbation, and apply in arguably more common settings, such as in classification.

In a natural language context, we would intuitively like the altered examples x to retain the same meaning as the original x .In some settings, it may also be sufficient to generate examples that humans and machines classify into different classes, without requiring that they exactly paraphrase the initial input.

To capture the above intuition, we propose to use a specially-crafted constraint function c(x, x ); the goal of this function is to ensure that both utterances share the same meaning and retain common syntactic properties (e.g. the style of writing should remain similar). Specifically, the function c is comprised on two constraints that capture sentence similarity on two levels.

Semantic similarity. We propose capturing the meaning of an utterance using the notion of a thought vector (Bengio et al., 2003; Mikolov et al., 2013) . A thought vector can be seen as a mapping from sentences to a vector space, in which sentences with similar meanings are close to each other. In this context, our constraint is defined as

v -v 2 < γ 1 (4)

where v and v are thought vectors associated with x and x , respectively, and γ 1 is a hyperparameter.

There exist many ways of computing thought vectors for sentences, most of which will be compatible with our optimization algorithm. In the rest of the paper, we will restrict our attention to thought vectors that are averages of the vectors for individual words.

Syntactic similarity. Generally, thought vectors do not capture the syntactic validity of a sentence; for example, rearranging all the words in a sentence will produce the same word vector average. To ensure that adversarial sentences are well-formed, we introduce a syntactic constraint, which relies on a language model P : X → [0, 1]. Specifically, we require that the language model probability be similar between the perturbed and the original example.

| log P (x ) -log P (x)| < γ 2 (5)

We suggest training a language model on the same dataset as f ; this allows the model to capture the extent to which x "looks like" a spam message or a movie review. We also require that the language model probabilities of x and x be similar: thus if x is an ungrammatical sentence (i.e. a review uses incorrect English), then x should retain a similar level of correctness.

3.3. GREEDY CONSTRUCTION OF ALTERED ADVERSARIAL EXAMPLES:

Altered adversarial examples can be obtained by solving an optimization problem of the form

EQUATION

in which the objective J(x ) measures the extent to which x is adversarial and may be a function of a target class y = y, e.g. J(x ) = f y (x ). We propose solving this optimization problem approximately using a greedy heuristic outlined as Algorithm 1.

In brief, we propose an iterative procedure that considers at each step all valid one-word changes to a sentence (i.e. which satisfy our constraints) and chooses the one that improves the objective the most. This procedure effectively replaces individual words with their synonyms, resulting in a new sentence of the same length that approximately preserves the original meaning.

Algorithm 1: Greedy Optimization Strategy for Finding Adversarial Examples Data: Datapoint x, termination threshold τ , neighborhood size N , parameters γ 1 , γ 2 , δ.

We initialize the algorithm at the uncorrupted data point: x ← x ; while Objective is below the threshold J(x ) < τ and fraction of words replaced is less than δ do Create a working set W = ∅ ; for each word w in x do for each word w among the N closest to w and different from w do substitute w with w to get x and if x satisfies Equ. (5), then W ← W ∪ {x }; Choose highest scoring world replacement x ← arg max x∈W J(x) or if W = ∅, then break ; return x ; Algorithm inputs. Algorithm 1 requires access to a target classifier f ; it transforms x into x by optimizing the objective J. We assume that x is a set of n discrete symbols called words and denoted by w i for i = 1, 2, ..., n. Although we define our algorithm in the context of natural language, it easily extends to general discrete problems as well. (Mrkšić et al., 2016) .

Optimization strategies. First, we place a bound δ on the fraction of words that can be substituted, i.e. n i=1 I{w i = w i } ≤ δ • n; this enables us to "give up" on an example when it clearly does not admit an adversarial alteration. We also set a minimum threshold τ on the objective (e.g. the minimum desired score of the target label) and terminate when we reach it.

Word replacement. We replace words with their nearest neighbors in a suitable word vector space, and consider the N closest neighbors. Thus, the neighbors are normally words that are likely to occur in the same context as the original word. To ensure that the replacements are also synonyms, we use the GloVE word vectors post-processed by with the method of Mrkšić et al. (2016) ; this ensures that the vectors satisfy linguistic constraints imposed by known synonym relations, and ensures that words with a similar meaning appear close to each other in the vector space (see Table 1 ).

4. EXPERIMENTS:



4.1. TASKS:

We study adversarial examples on three natural language classification tasks, summarized in Table 2. We held out 10% of the training set for validation; all adversarial examples are generated and evaluated on the test set. Likewise, we trained a trigram language model on the training set of each task and we instantiated the semantic constraint with the word vectors of Mrkšić et al. (2016) . We describe our three classification tasks below. emails. We preprocess the data by removing all meta data and HTML tags. There is no standard split for this dataset, so we randomly pick 10% as a test set.

Dataset:

Sentiment analysis. The Yelp Review Polarity dataset (Yelp; Zhang et al., 2015) consists of almost 600,000 customer reviews from Yelp, covering primarily restaurant reviews. Each review is labeled as either positive or negative.

Fake news detection. The News dataset (McIntire, 2017) contains 6,336 articles scraped from online sources, and includes both real and fake news. Each article contains a headline and body text (which we concatenated before classification) and is associated with a binary label.

4.2. MODELS:

We study adversarial example on a range of models that are widely used for classification; these include both linear classifiers and state-of-the-art deep learning algorithms.

Naive Bayes. This linear model has a long history in text classification and it is still popular for its simplicity. We convert each document into a bag-of-words representation, and following Wang & Manning (2012), we binarize the word features and use a multinomial model for classification.

Long short-term memory. Long-short term memory (LSTM; Hochreiter & Schmidhuber, 1997) is widely used in sequence modeling. We built a single-layer LSTM with 512 hidden units as in Zhang et al. (2015) . The input to the LSTM is first transformed to a 300-dimensional vector using pretrained word2vec embeddings (Mikolov et al., 2013) . We then average the outputs of the LSTM at each timestep to obtain a feature vector for a final logistic regression to predict the sentiment.

Shallow word-level convolutional networks. An alternative approach to text classification are convolutional neural networks (CNNs; Kim, 2014) We train a CNN with an embedding layer (as in the LSTM) a temporal convolutional layer, followed by max-pooling over time, and a fully connected layer for classification. We use a uniform filter size of 3 in each convolutional feature map; all other settings are identical to those of Kim (2014) .

Deep character-level convolutional networks. We implement the character-level network of Conneau et al. (2016) , which includes 4 stages. Each stage has 2 convolutional layers with batch normalization and 1 max-pooling layer; convolutional and pooling layers have strides of 1 and 2, respectively and filters of size 3. We start with 64 feature maps, and double the amount after each pooling step, concluding with k-max pooling layer with k = 8. The resulting activations in R 4096 are classified by 3 fully connected layers. Table 3 shows the accuracy of each classification model on the three datasets as well as on adversarial inputs generated using Algorithm 1. We manually selected the optimization settings that led to a reasonable tradeoff between the strength and the coherence of the adversarial examples. Specifically, in all experiments, we used a target of τ = 0.7, a neighborhood size of N = 15, and parameters γ 1 = 0.2 and δ = 0.5; we set the syntactic bound to γ 2 = 2 nats for sentiment analysis and fake news detection and γ 2 = ∞ for spam; spam messages were often malformed an the language model was no longer useful. We also compare against random perturbations obtained by replacing the arg max in Algorithm 1 with random sampling.

4.3. MAIN EXPERIMENTS:

All models are susceptible to adversarial examples to a certain degree, which depends in part on the task. Certain problems, such as spam filtering seem easier to classify and are less amenable to adversarial inputs; conversely, it is easier to fool the models on more difficult tasks, such as fake news detection. All methods are equally robust to random perturbations (just as image classifiers typically are), suggesting that adversarial inputs reside in very specific directions off the manifold of normal samples.

4.4. HUMAN EVALUATION:



Input Trec07p Yelp News:

Original 87% 93% 64% Adversarial 93% 87% 58% We verified the quality and the coherence of our examples via human experiments on Amazon Mechanical Turk. First, we subsampled a 100 random test set examples and asked human evaluators to assign labels (e.g. positive or negative review) to both the original data points, and their adversarially altered versions. We averaged the opinions of five different evaluations for each query. We found that human evaluators achieved similar accuracies on both types of inputs, suggesting that our adversarial alterations preserved key semantics sufficiently well to be recognized by a human. Human accuracy generally falls below that of the algorithms: the fake news task is inherently difficult, while non-spam email is often misclassified since there is no standard definition for "ham" emails; on sentiment analysis, both accuracies are within a reasonable margin of error.

Next, we asked human annotators to rate the "writing quality" of the same set of examples on a scale of one to five, with five being the highest possible quality and likely generated by a human, and one being the lowest quality, likely generated by a machine. Table 5 shows that humans tend to assign similar scores to both sets of samples. Although our adversarial examples were not perfectly formed, these results suggest that they were of comparable quality to the original examples (which also contained multiple spelling and grammar errors). We found that our adversarial examples exhibit three kinds of errors: syntactic, semantic, and factual. Syntactic errors are ungrammatical word substitutions; these include replacing "isis claim responsibility for shooting" with "isis petition responsibility for shooting" and "never before has an fbi director" to "never until has an fbi director"; the first error is due to multiple word meanings, while the latter is due to the words being unrelated (and far in word vector space).

4.5. ERROR ANALYSIS:

Semantic errors arise when the meaning of a sentence is altered. Most often, this is due to multiple word senses -e.g., "isis claim responsibility for shooting" to "isis claim responsibility for filming" -or due to word embedding errors -e.g., "isis claim responsibility for ceasefire". Factual errors are a special case when the sentence becomes obviously false, e.g. when chainging "Monday, March 16" changed to "Thursday, March 16", or "FBI assistant director james kallstrom" to "Pentagon assistant director james kallstrom", or "republicans backing Trump" to "republicans backing Obama". These may not be an issue with fake reviews or fake news, and may be remedied via specialized techniques, e.g. by performing Named Entity Recognition. An intriguing property of image classification models is that adversarial examples generated for one classifier are likely to be misclassified by ther classifiers. We also examined whether adversarial texts transfer between the four models, focusing on the Yelp dataset. As seen in Table 6 , there is a moderate degree of transferability between models. Interestingly, adversarial examples for three word level models (NB, LSTM, WCNN) do not generalize as well to the character level deep CNN as to other word level models, which suggests that the choice of input representation (character or word) is a factor that affects transferability.

4.7. EXPLAINING ADVERSARIAL EXAMPLES:

We attribute the existence of adversarial examples to two factors, which we refer to as embeddingbased and representation-based. A neural network classifier for text contains two stages: first, an embedding layer maps discrete words into continuous vectors; then, the embeddings are classified via convolutional or fully-connected layers.

Representation-based errors arise in the higher layers of the network; these layers are very similar to those of image classifiers and are therefore susceptible to the same types of attacks. In other words, by replacing a word, we may adversarially push the embedding representation off the learned manifold into an adversarial region, causing a mislabel. Representation-level adversarial perturbations have been studied by Miyato et al. (2017) in the context of adversarial training, and we observed them in our experiments as well.

On the other hand, embedding-based errors can be attributed to the inherently high dimensionality of the vocabulary, and can be studied by looking at linear classifiers. For example, a perturbation for Naive Bayes implies that words which we consider equivalent (e.g., definitely and certainly) occur with different frequencies among the two classes. This, in turn, can happen for two reasons: firstly, since the vocabulary is large, such words will arise due to statistical noise, unless the dataset is also very large; secondly, two words may truly have different conditional class probabilities, either because of multiple meanings (e.g., awfully great deal and awfully bad) or because of hidden patterns that we don't understand (dogs are truly mentioned more often in spam than cats). On the other hand, adversarial inputs can also improve algorithms via adversarial training (Shrivastava et al., 2016) by serving as extra data and thus increasing performance and robustness to adversarial attacks. Miyato et al. (2017) showed that adversarial perturbations to word embeddings are useful for semi-supervised learning; our findings hint at the possibility of adversarial training in the space of words.

5. DISCUSSION:



5.2. COMPARISON TO OTHER DOMAINS:

We found that adversarial examples are somewhat less abundant than in computer vision, especially on "easy" tasks such as spam classification. Interestingly, they affect linear models more; this smaller gap can be explained by the fact that text classification models are relatively shallow and word inputs are in a sense "higher-level" than pixels: they are more susceptible to perturbations and leave less work to the rest of the network. Although defining a metric between utterance is nontrivial, it is also somewhat more forgiving: in many domains (such as spam) grammatical errors are common, and the meaning does not get lost (or seem unnatural) with errors.

Finally, it's interesting to note that language-based problems have more direct access to the system being attacked; adversarial images are typically processed by real-world sensors, which affects their strength Kurakin et al. (2016) ; language-based examples are fed into the system directly, which could make them more potent.

5.3. FUTURE WORK:

Our results demonstrate the existence of natural-language adversarial perturbations. However, our simple perturbations could be improved via a more sophisticated algorithm that takes advantage of language processing technologies, such as syntactic parsing, named entity recognition, or paraphrasing, or that could be assisted by humans. Furthermore, the existing search procedure naturally generalizes to beam search, and could modify phrases rather than words. Interesting extensions apply to character-based substitutions, targeting both word-and character-based systems.

6. CONCLUSION:

We generalize the concept of adversarial examples to natural language classification by proposing a simple yet effective similarity metric for text. Then evaluate our approach on several classification tasks and show that a simple greedy algorithm is effective at finding adversarial examples in each setting. Text: urgent : your paypal account has expired ! paypal body , td protect your account ¡oov¿ sure you never provide your password to fraudulent bogus websites . for more information on protecting yourself from fraud , please review our security tips at https : ¡oov¿ your ¡oov¿ should never give your paypal password to anyone , including paypal employees gov . upgrade your information dear member lawmakers , it has come to our attention that your paypal billing legislation information is out of date . therefore we have had to put a limit your paypal account . we require you to update your billing legislation information on or before 4th june 2007. failure to update your records may result in a suspension of your account . to update your paypal billing invoices information click the link below , login to your account with your email address and password and read the on screen instructions : http : //www.paypal.com/cgi-bin/webscr ? ¡oov¿ this security measure helps us continue to offer paypal as a secure and cost-effective payment service . we appreciate your cooperation and assistance . sincerely , the paypal team please do not reply to this email . this mailbox is not monitored oversight and you will not Task: Spam Classification. Classifier: WordCNN. Original label: 98% Spam. New label: 68% Spam.

Text: this job offer is just for you ! dear pricey sirs gentlemen , aegis sponsorship capital group llc ( aegis ) is a specialty expert investment capital firm managing private equity fairness and venture enterprise capital funds with into a national nationalist focus on small businesses and the social benefits advantages of supporting entrepreneurs corporations and enhancing reinforcing local job creation introduction . we would should like to stress , that our company enterprise pays special peculiar attention concentration to customer support of private particular customers subscribers , though we also have the corresponding business plans for the bigger companies as well correctly . a more wider detailed information about our company enterprise you may obtain at our official formal website venue . due to the necessity for expansion enlargement of our company enterprise , we have announced some additional openings for new employees officials . we are glad contented to offer supply you one of the vacant positions in our company business team a position stance of the ; account accountant manager admin .you will have the responsibility for the following duties obligations : fulfillment implementation of orders commandments given by the company enterprise , operations with the bank banco transfers assignments ( direct deposits filings and wires threads ) from into customers subscribers , implementation of calculations computations 

:



Figures and Tables:

Figure 4: Examples of adversarial text generated for Spam Classification

Nearest neighbors in word vector space

Table content: <table><tr><td>bad</td><td>delicious</td><td>enjoy</td></tr><tr><td>inclement</td><td>yummy</td><td>enjoying</td></tr><tr><td>mala</td><td>scrumptious</td><td>enjoys</td></tr><tr><td>naughty</td><td>appetizing</td><td>experience</td></tr><tr><td>rotten</td><td>tasty</td><td>savor</td></tr><tr><td>amiss</td><td>delectable</td><td>savoring</td></tr></table>

Summary of datasets and tasks

Table content: <table><tr><td/><td/><td/><td/><td>Spam filtering. The TREC 2007 Public</td></tr><tr><td/><td>Task</td><td colspan="2">#Train #Test</td><td>Spam Corpus (Trec07p) contains 50,199 spam emails and 25,220 ham (non-spam)</td></tr><tr><td>Trec07p</td><td>Spam filtering</td><td>67.9k</td><td>7.5k</td></tr><tr><td>Yelp</td><td>Sentiment analysis</td><td>560k</td><td>38k</td></tr><tr><td>News</td><td>Fake news detection</td><td>5.3k</td><td>1.0k</td></tr></table>



Table content: <table><tr><td colspan="2">Data</td><td colspan="3">NB LSTM WCNN VDCNN</td></tr><tr><td/><td colspan="2">CLN 97.1% 99.1%</td><td>99.7%</td></tr><tr><td/><td colspan="2">RND 97.7% 98.6%</td><td>99.6%</td></tr><tr><td/><td colspan="2">ADV 15.1% 39.8%</td><td>64.5%</td></tr><tr><td/><td colspan="2">CLN 87.9% 95.3%</td><td>94.9%</td><td>95.1%</td></tr><tr><td>Yelp</td><td colspan="2">RND 86.8% 94.5%</td><td>94.7%</td><td>93.1%</td></tr><tr><td/><td>ADV</td><td>9.0% 24.0%</td><td>39.0%</td><td>53.0%</td></tr><tr><td/><td colspan="2">CLN 91.0% 93.0%</td><td>96.0%</td><td>93.4%</td></tr><tr><td>News</td><td colspan="2">RND 84.0% 94.6%</td><td>93.3%</td><td>92.7%</td></tr><tr><td/><td>ADV</td><td>9.0% 37.0%</td><td>71.0%</td><td>11.0%</td></tr></table>

Human classification accuracy on adversarial examples for the LSTM model.

Table content: <table/>

Transferability of adversarial examples on the Yelp dataset. Row i and column j show the accuracy of adversarial samples generated for model i evaluated on model j.

Table content: <table><tr><td colspan="3">4.6 TRANSFERABILITY</td><td/><td/></tr><tr><td/><td colspan="4">NB LSTM WCNN VDCNN</td></tr><tr><td>NB</td><td>20%</td><td>77%</td><td>75%</td><td>88%</td></tr><tr><td colspan="2">LSTM 67%</td><td>17%</td><td>64%</td><td>83%</td></tr><tr><td colspan="2">WCNN 63%</td><td>64%</td><td>17%</td><td>84%</td></tr><tr><td colspan="2">VDCNN 77%</td><td>85%</td><td>87%</td><td>23%</td></tr></table>

5.1 APPLICATIONS OF LANGUAGE-BASED ADVERSARIAL EXAMPLESOur work demonstrates the existence of adversarial examples in state-of-the-art models for spam and sentiment classification (the fake news state-of-the-art is not yet established). The existence and transferability of such examples (obtained with very simple methods), hint at the existence of vulnerabilities in a number of systems; thes include text filtering systems (e.g., spam, racism), online ranking algorithms, speech command processors, and others. More generally, together with the work ofJia & Liang (2017), our observations lend further evidence to the prevalence of adversarial attacks in the natural language domain.

Table content: <table/>

The presence of adversarial examples for text classification poses threat to real-world machine learning systems. We further study of adversarial examples for text classification with help defend these systems and improve the accuracy of classification algorithms via adversarial training. Sida Wang and Christopher D Manning. Baselines and bigrams: Simple, good sentiment and topic classification. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers-Volume 2, pp. 90-94. Association for Computational Linguistics, 2012. Xiang Zhang, Junbo Zhao, and Yann LeCun. Character-level convolutional networks for text classification. In Advances in Neural Information Processing Systems, pp. 649-657, 2015. Naive Bayes. Original label: 99% Spam. New label: 0% Spam. Text: wondercum is a wonderful combination of fine herbs weed extract that are well known for centuries we do not have any branched or stores storing located anywhere whenever . http : oov Classifier: LSTM. Original label: 73% Spam. New label: 0% Spam. Text: view viewpoint pics images of christian protestant singles in your area realm meet cater christian protestant singles with oov values in your area realm . oov this email mailroom is a commercial advertisement publicity sent forwarded in compliance with the oov act of 2003. we have no desire volition to send you information that is not wanted , therefore similarly , if you wish to be excluded from future mailings , please use the link at the bottom of the page Task: Spam Classification. Classifier: WordCNN. Original label: 89% Spam. New label: 0% Spam. Text: your loan borrower application apps is waiting hoping dear pricey homeowner landowner are you still paying too much for your current mortgage subprime ? refinaance us best rate cadence . your approval ratification is waiting expecting . please respond cater oov http myspace : oov helen edith gay lendingtree department administration

Table content: <table/>

Peer review (iclr2018):
 This paper proposes a method to generate adversarial examples for text classification problems. They do this by iteratively replacing words in a sentence with words that are close in its embedding space and which cause a change in the predicted class of the text. To preserve correct grammar, they only change words that don*t significantly change the probability of the sentence under a language model. The approach seems incremental and very similar to existing work such as Papernot et. al. The paper also states in the discussion in section 5.1 that they generate adversarial examples in state-of-the-art models, however, they ignore some state of the art models entirely such as Miyato et. al. The experiments are solely missing comparisons to existing text adversarial generation approaches such as Papernot et. al and a comparison to adversarial training for text classification in Miyato et. al which might already mitigate this attack. The experimental section also fails to describe what kind of language model is used, (what kind of trigram LM is used? A traditional (non-neural) LM? Does it use backoff?). Finally, algorithm 1 does not seem to enforce the semantic constraints in Eq. 4 despite it being mentioned in the text. This can be seen in section 4.5 where the algorithm is described as choosing words that were far in word vector space. The last sentence in section 6 is also unfounded. Nicolas Papernot, Patrick McDaniel, Ian Goodfellow, Somesh Jha, Z.Berkay Celik, and Ananthram Swami Practical Black-Box Attacks against Machine Learning. Proceedings of the 2017 ACM Asia Conference on Computer and Communications Security Takeru Miyato, Andrew M. Dai and Ian Goodfellow Adversarial Training Methods for Semi-Supervised Text Classification. International Conference on Learning Representation (ICLR), 2017 * I increased the score in response to the additional experiments done with Miyato et. al. However, the lack of a more extensive comparison with Papernot et. al. is still needed. The venue for that paper might not be well known but it was submitted to arXiv computer science too and the paper seems very related to this work. It*s hard to say if Papernot et. al produces more perceptible samples without doing a proper comparison. I find the lack of a quantitative comparison to any existing adversarial example technique problematic.