Title: AUTOMATIC RULE EXTRACTION FROM LONG SHORT TERM MEMORY NETWORKS

Abstract: Although deep learning models have proven effective at solving problems in natural language processing, the mechanism by which they come to their conclusions is often unclear. As a result, these models are generally treated as black boxes, yielding no insight of the underlying learned patterns. In this paper we consider Long Short Term Memory networks (LSTMs) and demonstrate a new approach for tracking the importance of a given input to the LSTM for a given output. By identifying consistently important patterns of words, we are able to distill state of the art LSTMs on sentiment analysis and question answering into a set of representative phrases. This representation is then quantitatively validated by using the extracted phrases to construct a simple, rule-based classifier which approximates the output of the LSTM.

1. INTRODUCTION:

Neural network language models, especially recurrent neural networks (RNN), are now standard tools for natural language processing. Amongst other things, they are used for translation Sutskever et al. (2014) , language modelling Jozefowicz et al. (2016) , and question answering Hewlett et al. (2016) . In particular, the Long Short Term Memory (LSTM) Hochreiter & Schmidhuber (1997) architecture has become a basic building block of neural NLP. Although LSTM's are regularly used in state of the art systems, their operation is not well understood. Besides the basic desire from a scientific viewpoint to clarify their workings, it is often the case that it is important to understand why a machine learning algorithm made a particular choice. Moreover, LSTM's are computationally intensive compared to discrete models with lookup tables and pattern matching.

In this work, we describe a novel method for visualizing the importance of specific inputs for determining the output of an LSTM. We then demonstrate that, by searching for phrases which are consistently important, the importance scores can be used to extract simple phrase patterns consisting of one to five words from a trained LSTM. The phrase extraction is first done in a general document classification framework on two different sentiment analysis datasets. We then demonstrate that it can also be specialized to more complex models by applying it to WikiMovies, a recently introduced question answer dataset. To concretely validate the extracted patterns, we use them as input to a rules-based classifier which approximates the performance of the original LSTM.

2. RELATED WORK:

There are two lines of related work on visualizing LSTMs. First, Hendrik et al. (2016) and Karpathy et al. (2016) analyse the movement of the raw gate activations over a sequence. Karpathy et al. (2016) is able to identify co-ordinates of c t that correspond to semantically meaningful attributes such as whether the text is in quotes and how far along the sentence a word is. However, most of the cell co-ordinates are harder to interpret, and in particular, it is often not obvious from their activations which inputs are important for specific outputs.

Another approach that has emerged in the literature Alikaniotis et al. (2016 ) Denil et al. (2015 ) Bansal et al. (2016) is for each word in the document, looking at the norm of the derivative of the loss function with respect to the embedding parameters for that word. This bridges the gap between high-dimensional cell state and low-dimensional outputs. These techniques are general-they are applicable to visualizing the importance of sets of input coordinates to output coordinates of any differentiable function. In this work, we describe techniques that are designed around the structure of LSTM's, and show that they can give better results in that setting.

A recent line of work Li et al. (2016 ) Hewlett et al. (2016) Rajpurkar et al. (2016 ) Miller et al. (2016) has focused on neural network techniques for extracting answers directly from documents. Previous work had focused on Knowledge Bases (KBs), and techniques to map questions to logical forms suitable for querying them. Although they are effective within their domain, KBs are inevitably incomplete, and are thus an unsatisfactory solution to the general problem of question-answering. Wikipedia, in contrast, has enough information to answer a far broader array of questions, but is not as easy to query. Originally introduced in Miller et al. (2016) , the WikiMovies dataset consists of questions about movies paired with Wikipedia articles.

3. WORD IMPORTANCE SCORES IN LSTMS:

We present a novel decomposition of the output of an LSTM into a product of factors, where each term in the product can be interpreted as the contribution of a particular word. Thus, we can assign importance scores to words according to their contribution to the LSTM's prediction

3.1. LONG SHORT TERM MEMORY NETWORKS:

Over the past few years, LSTMs have become an important part of neural NLP systems. Given a sequence of word embeddings x 1 , ..., x T ∈ R d , an LSTM processes one word at a time, keeping track of cell and state vectors (c 1 , h 1 ), ..., (c T , h T ) which contain information in the sentence up to word i. h t and c t are computed as a function of x t , c t-1 using the below updates

EQUATION

As initial values, we define c 0 = h 0 = 0. After processing the full sequence, a probability distribution over C classes is specified by p, with

EQUATION

where W i is the i'th row of the matrix W

3.2. DECOMPOSING THE OUTPUT OF A LSTM:

We now show that we can decompose the numerator of p i in Equation 7 into a product of factors, and interpret those factors as the contribution of individual words to the predicted probability of class i. Define

β i,j = exp (W i (o T (tanh(c j ) -tanh(c j-1 ))) , (8) so that exp(W i h T ) = exp   T j=1 W i (o T (tanh(c j ) -tanh(c j-1 ))   = T j=1 β i,j .

As tanh(c j ) -tanh(c j-1 ) can be viewed as the update resulting from word j, so β i,j can be interpreted as the multiplicative contribution to p i by word j.

3.3. AN ADDITIVE DECOMPOSITION OF THE LSTM CELL:

We will show below that the β i,j capture some notion of the importance of a word to the LSTM's output. However, these terms fail to account for how the information contributed by word j is affected by the LSTM's forget gates between words j and T . Consequently, we empirically found that the importance scores from this approach often yield a considerable amount of false positives. A more nuanced approach is obtained by considering the additive decomposition of c T in equation ( 9), where each term e j can be interpreted as the contribution to the cell state c T by word j. By iterating the equation c t = f t c t-1 + i t ct , we get that

EQUATION

This suggests a natural definition of an alternative score to the β i,j , corresponding to augmenting the c j terms with products of forget gates to reflect the upstream changes made to c j after initially processing word j.

EQUATION

4. PHRASE EXTRACTION FOR DOCUMENT CLASSIFICATION:

We now introduce a technique for using our variable importance scores to extract phrases from a trained LSTM. To do so, we search for phrases which consistently provide a large contribution to the prediction of a particular class relative to other classes. The utility of these patterns is validated by using them as input for a rules based classifier. For simplicity, we focus on the binary classification case.

4.1. PHRASE EXTRACTION:

A phrase can be reasonably described as predictive if, whenever it occurs, it causes a document to both be labelled as a particular class, and not be labelled as any other. As our importance scores introduced above correspond to the contribution of particular words to class predictions, they can be used to score potential patterns by looking at a pattern's average contribution to the prediction of a given class relative to other classes. More precisely, given a collection of D documents

{{x i,j } N d i=1 } D j=1

, for a given phrase w 1 , ..., w k we can compute scores S 1 , S 2 for classes 1 and 2, as well as a combined score S and class C as

EQUATION

EQUATION

where β i,j,k denotes β i,j applied to document k.

The numerator of S 1 denotes the average contribution of the phrase to the prediction of class 1 across all occurrences of the phrase. The denominator denotes the same statistic, but for class 2. Thus, if S 1 is high, then w 1 , ..., w k is a strong signal for class 1, and likewise for S 2 . We propose to use S as a score function in order to search for high scoring, representative, phrases which provide insight into the trained LSTM, and C to denote the class corresponding to a phrase.

In practice, the number of phrases is too large to feasibly compute the score of them all. Thus, we approximate a brute force search through a two step procedure. First, we construct a list of candidate phrases by searching for strings of consecutive words j with importance scores β i,j > c for any i and some threshold c; in the experiments below we use c = 1.1. Then, we score and rank the set of candidate phrases, which is much smaller than the set of all phrases.

4.2. RULES BASED CLASSIFIER:

The extracted patterns from Section 4.1 can be used to construct a simple, rules-based classifier which approximates the output of the original LSTM. Given a document and a list of patterns sorted by descending score given by S, the classifier sequentially searches for each pattern within the document using simple string matching. Once it finds a pattern, the classifier returns the associated class given by C, ignoring the lower ranked patterns. The resulting classifier is interpretable, and despite its simplicity, retains much of the accuracy of the LSTM used to build it.

5. EXPERIMENTS:

We now present the results of our experiments.

5.1. TRAINING DETAILS:

We implemented all models in Torch using default hyperparameters for weight initializations. For WikiMovies, all documents and questions were pre-processed so that multiple word entities were concatenated into a single word. For a given question, relevant articles were found by first extracting from the question the rarest entity, then returning a list of Wikipedia articles containing any of those words. We use the pre-defined splits into train, validation and test sets, containing 96k, 10k and 10k questions, respectively. The word and hidden representations of the LSTM were both set to dimension 200 for WikiMovies, 300 and 512 for Yelp, and 300 and 150 for Stanford Sentiment Treebank. All models were optimized using Adam Kingma & Ba (2015) with the default learning rate of 0.001 using early stopping on the validation set. For rule extraction using gradient scores, the product in the reward function is replaced by a sum. In both datasets, we found that normalizing the gradient scores by the largest gradient improved results.

5.2. SENTIMENT ANALYSIS:

We first applied the document classification framework to two different sentiment analysis datasets.

Originally introduced in Zhang et al. (2015) , the Yelp review polarity dataset was obtained from the Yelp Dataset Challenge and has train and test sets of size 560,000 and 38,000. The task is binary prediction for whether the review is positive (four or five stars) or negative (one or two stars).

The reviews are relatively long, with an average length of 160.1 words. We also used the binary classification task from the Stanford Sentiment Treebank (SST) Socher et al. (2013) , which has less data with train/dev/test sizes of 6920/872/1821, and is done at a sentence level, so has much shorter document lengths.

We report results in Table 1 for seven different models. We report state of the art results from prior work using convolutional neural networks; Kim (2014) for SST and Zhang et al. (2015) for Yelp. We also report our LSTM baselines, which are competitive with state of the art, along with the three different pattern matching models described above. For SST, we also report prior results using bag of words features with Naive Bayes.

The additive cell decomposition pattern equals or outperforms the cell-difference patterns, which handily beat the gradient results. This coincides with our empirical observations regarding the information contained within the importance measures, and validates our introduced measure. The differences between measures become more pronounced in Yelp, as the longer document sizes provide more opportunities for false positives. Although our pattern matching algorithms underperform other methods, we emphasize that pure performance is not our goal, nor would we expect more from such a simple model. Rather, the fact that our method provides reasonable accuracy is one piece of evidence, in addition to the qualitative evidence given later, that our word importance scores and extracted patterns contain useful information for understanding the actions of a LSTM.

Model:



5.3. WIKIMOVIES:

Although document classification comprises a sizeable portion of current research in natural language processing, much recent work focuses on more complex problems and models. In this section, we examine WikiMovies, a recently introduced question answer dataset, and show that with some simple modifications our approach can be adapted to this problem.

5.3.1. DATASET:

WikiMovies is a dataset consisting of more than 100,000 questions about movies, paired with relevant Wikipedia articles. It was constructed using the pre-existing dataset MovieLens, paired with templates extracted from the SimpleQuestions dataset Bordes et al. (2015) , a open-domain question answering dataset based on Freebase. They then selected a set of Wikipedia articles about movies by identifying a set of movies from OMDb that had an associated article by title match, and kept the title and first section for each article.

For a given question, the task is to read through the relevant articles and extract the answer, which is contained somewhere within the text. The dataset also provides a list of 43k entities containing all possible answers.

5.3.2. LSTMS FOR WIKIMOVIES:

We propose a simplified version of recent work Li et al. (2016) . Given a pair of question x q 1 , ..., x q N and document x d 1 , ..., x d T , we first compute an embedding for the question using a LSTM. Then, for each word t in the document, we augment the word embedding x t with the computed question embedding. This is equivalent to adding an additional term which is linear in the question embedding into the gate equations 3-6, allowing the patterns an LSTM absorbs to be directly conditioned upon the question at hand.

EQUATION

)

EQUATION

Having run the above model over the document while conditioning on a question, we are given contextual representations h 1 , . we use p t to conduct a binary prediction for whether or not the entity is the answer. At test time, we return the entity with the highest probability as the answer.

p t = SoftMax(W h t ) (19)

We now introduce some simple modifications that were useful in adapting our pattern extraction framework to this specific task. First, in order to define the set of classifications problems to search over, we treat each entity t within each document as a separate binary classification task with corresponding predictor p t . Given this set of classification problems, rather than search over the space of all possible phrases, we restrict ourselves to those ending at the entity in question. We also distinguish patterns starting at the beginning of the document with those that do not and introduce an entity character into our pattern vocabulary, which can be matched by any entity. Template examples can be seen below, in Table 4 . Once we have extracted a list of patterns, in the rules-based classifier we only search for positive examples, and return as the answer the entity matched to the highest ranked positive pattern.

5.3.4. RESULTS:

We report results on six different models in Tables 2 and 3 . We show the results from Miller et al. (2016) , which fit a key-value memory network (KV-MemNN) on representations from information extraction (IE) and raw text (Doc). Next, we report the results of the LSTM described in Section 5.3.2. Finally, we show the results of using three variants of the pattern matching algorithm described in Section 5.3.3: using patterns extracted using the additive decomposition (cell decomposition), difference in cells approaches (cell-difference) and gradient importance scores (gradient), as discussed in Section 2. Performance is reported using the accuracy of the top hit over all possible answers (all entities), i.e. the hits@1 metric.

As shown in Table 2 , our LSTM model surpasses the prior state of the art by nearly 4%. Moreover, our automatic pattern matching model approximates the LSTM with less than 6% error, which is surprisingly small for such a simple model, and falls within 2% of the prior state of the art. Similarly to sentiment analysis, we observe a clear ordering of the results across question categories, with our cell decomposition scores providing the best performance, followed by the cell difference and gradient scores.

6. DISCUSSION:



6.1. LEARNED PATTERNS:

We present extracted patterns for both sentiment tasks, and some WikiMovies question categories in Table 4 . These patterns are qualitatively sensible, providing further validation of our approach. The increased size of the Yelp dataset allowed for longer phrases to be extracted relative to SST.

Sentiment Pattern Sentence:



Negative gets the job done:

Still, it gets the job done -a sleepy afternoon rental Negative is a great This is a great subject for a movie, but Hollywood has squandered the opportunity, using is as a prop for a warmed-over melodrama and the kind of choreographed mayhem that director John Woo has built his career on.

Negative happy ending:

The story loses its bite in a last-minute happy ending that's even less plausible than the rest of the picture.

Negative witty dialogue:

An often-deadly boring, strange reading of a classic whose witty dialogue is treated with a baffling casual approach.

Positive mess:

The film is just a big, gorgeous, mind-blowing, breath-taking mess Although our approach is able to extract sensible patterns and achieve reasonable performance, there is still an approximation gap between our algorithm and the LSTM. In Table 5 we present some examples of instances where the LSTM was able to correctly classify a sentence, and our algorithm was not, along with the pattern used by our algorithm. At first glance, the extracted patterns are sensible, as "gets the job done" or "witty dialogue" are phrases you'd expect to see in a positive review of a movie. However, when placed in the broader context of these particular reviews, they cease to be predictive. This demonstrates that, although our work is useful as a firstorder approximation, there are still additional relationships that an LSTM is able to learn from data.

6.3. COMPARISON BETWEEN WORD IMPORTANCE MEASURES:

While the prediction accuracy of our rules-based classifier provides quantitative validation of the relative merits of our visualizations, the qualitative differences are also insightful. In Table 6 , we provide a side-by-side comparison between the different measures. As discussed before, the difference in cells technique fails to account for how the updates resulting from word j are affected by the LSTM's forget gates between when the word is initially processed and the answer. Consequently, we empirically found that without the interluding forget gates to dampen cell movements, the variable importance scores were far noisier than in additive cell decomposition approach. Under the additive cell decomposition, it identifies the phrase 'it stars', as well as the actor's name Aqib Khan as being important, a sensible conclusion. Moreover, the vast majority of words are labelled with an importance score of 1, corresponding to irrelevant. On the other hand, the difference in cells approach yields widely changing importance scores, which are challenging to interpret. In terms of noise, the gradient measures seem to lie somewhere in the middle. These patterns are broadly consistent with what we have observed, and provide qualitative validation of our metrics.

7. CONCLUSION:

In this paper, we introduced a novel method for visualizing the importance of specific inputs in determining the output of an LSTM. By searching for phrases which consistently provide large contributions, we are able to distill trained, state of the art, LSTMs into an ordered set of representative phrases. We quantitatively validate the extracted phrases through their performance in a simple, rules-based classifier. Results are shown in a general document classification framework, then specialized to a more complex, recently introduced, question answer dataset. Our introduced measures provide superior predictive ability and cleaner visualizations relative to prior work. We believe that this represents an exciting new paradigm for analysing the behaviour of LSTM's. 

Additive cell decomposition:



:



Figures and Tables:

Test accuracy on sentiment analysis. See section 5.2 for further descriptions of the models.

Table content: <table><tr><td/><td>Yelp Polarity</td><td>Stanford Sentiment</td></tr><tr><td/><td/><td>Treebank</td></tr><tr><td>Large word2vec CNN</td><td>95.4</td><td>-</td></tr><tr><td>Zhang et al. (2015)</td><td/><td/></tr><tr><td>CNN-multichannel</td><td>-</td><td>88.1</td></tr><tr><td>Kim (2014)</td><td/><td/></tr><tr><td>Naive Bayes Socher</td><td>-</td><td>82.6</td></tr><tr><td>et al. (2013)</td><td/><td/></tr><tr><td>LSTM</td><td>95.3</td><td>87.3</td></tr><tr><td>Cell Decomposition</td><td>86.5</td><td>76.2</td></tr><tr><td>Pattern Matching</td><td/><td/></tr><tr><td>Cell-Difference Pat-</td><td>81.2</td><td>77.4</td></tr><tr><td>tern Matching</td><td/><td/></tr><tr><td>Gradient Pattern</td><td>65.0</td><td>68.0</td></tr><tr><td>Matching</td><td/><td/></tr></table>

Test results on WikiMovies, measured in % hits@1. See Section 5.3.4 for further descriptions of the models.

Table content: <table><tr><td>Model</td><td>Test accuracy</td></tr><tr><td>KV-MemNN IE</td><td>68.3</td></tr><tr><td>KV-MemNN Doc</td><td>76.2</td></tr><tr><td>LSTM</td><td>80.1</td></tr><tr><td>Cell Decomposition</td><td>74.3</td></tr><tr><td>Pattern Matching</td><td/></tr><tr><td>Cell-Difference Pattern</td><td>69.4</td></tr><tr><td>Matching</td><td/></tr><tr><td>Gradient Pattern</td><td>57.4</td></tr><tr><td>Matching</td><td/></tr></table>

Examples from Stanford sentiment treebank which are correctly labelled by our LSTM and incorrectly labelled by our rules-based classifier. The matched pattern is highlighted 6.2 APPROXIMATION ERROR BETWEEN LSTM AND PATTERN MATCHING

Table content: <table/>

Comparison of importance scores acquired by three different approaches, conditioning on the question "the film west is west starred which actors?". Bigger and darker means more important.8 APPENDIX -HEAT MAPSWe provide an example heat map using the cell decomposition metric for each class in both sentiment analysis datasets, and selected WikiMovie question categories Negative call me spoiled ...this sushi is gross and the orange chicken , well it was so thin i don 't think it had chicken in it. go somewhereelse

Table content: <table><tr><td/><td>Difference in cell values</td><td>Gradient</td></tr><tr><td>west is west is a 2010 british comedy -drama film , which is a sequel to the 1999 comedy " east is east " . itstars aqib khan</td><td>west is west is a 2010 british comedy -drama film , which is a sequel to the 1999 com-edy"e ast is east " . it stars aqib</td><td>west is west is a 2010 british comedy -drama film , which is a sequel to the 1999com-edy " east is east " .itstars aqib khan</td></tr><tr><td/><td>khan</td><td/></tr></table>

Peer review (iclr2017):
EDIT: the revisions made to this paper are very thorough and address many of my concerns, and the paper is also easier to understand. i recommend the latest version of this paper for acceptance and have increased my score. This paper presents a way of interpreting LSTM models, which are notable for their opaqueness. In particular, the authors propose decomposing the LSTM*s predictions for a QA task into importance scores for words, which are then used to generate patterns that are used to find answers with a simple matching algorithm. On the WikiMovies dataset, the extracted pattern matching method achieves accuracies competitive with a normal LSTM, which shows the power of the proposed approach. I really like the motivation of the paper, as interpreting LSTMs is definitely still a work-in-progress, and the high performance of the pattern matching was surprising. However, several details of the pattern extraction process are not very clear, and the evaluation is conducted on a very specific task, where predictions are made at every word. As such, I recommend the paper in its current form as a weak accept but hope that the authors clarify their approach, as I believe the proposed method is potentially useful for NLP researchers. Comments: - Please introduce in more detail the specific QA tasks you are applying your models on before section 3.3, as it*s not clear at that point that the answer is an entity within the document. - 3.3: is the softmax predicting a 0/1 value (e.g., is this word the answer or not?) - 3.3: what are the P and Q vectors? do you just mean that you are transforming the hidden state into a 2-dimensional vector for binary prediction? - how does performance of the pattern matching change with different cutoff constant values? - 5.2: are there questions whose answers are not entities? - how could the proposed approach be used when predictions aren*t made at every word? is there any extension for, say, sentence-level sentiment classification?