Title: EFFICIENT SUMMARIZATION WITH READ-AGAIN AND COPY MECHANISM

Abstract: Encoder-decoder models have been widely used to solve sequence to sequence prediction tasks. However current approaches suffer from two shortcomings. First, the encoders compute a representation of each word taking into account only the history of the words it has read so far, yielding suboptimal representations. Second, current models utilize large vocabularies in order to minimize the problem of unknown words, resulting in slow decoding times and large storage costs. In this paper we address both shortcomings. Towards this goal, we first introduce a simple mechanism that first reads the input sequence before committing to a representation of each word. Furthermore, we propose a simple copy mechanism that is able to exploit very small vocabularies and handle out-of-vocabulary words. We demonstrate the effectiveness of our approach on the Gigaword dataset and DUC competition outperforming the state-of-the-art.

1. INTRODUCTION:

Encoder-decoder models have been widely used in sequence to sequence tasks such as machine translation (Cho et al. (2014) ; Sutskever et al. (2014) ). They consist of an encoder which represents the whole input sequence with a single feature vector. The decoder then takes this representation and generates the desired output sequence. The most successful models are LSTM and GRU as they are much easier to train than vanilla RNNs.

In this paper we are interested in summarization where the input sequence is a sentence/paragraph and the output is a summary of the text. Several encoding-decoding approaches have been proposed (Rush et al. (2015) ; Hu et al. (2015) ; Chopra et al. (2016) ). Despite their success, it is commonly believed that the intermediate feature vectors are limited as they are created by only looking at previous words. This is particularly detrimental when dealing with large input sequences. Bi-directorial RNNs (Schuster & Paliwal (1997) ; Bahdanau et al. (2014) ) try to address this problem by computing two different representations resulting of reading the input sequence left-to-right and right-to-left. The final vectors are computed by concatenating the two representations. However, the word representations are computed with limited scope.

The decoder employed in all these methods outputs at each time step a distribution over a fixed vocabulary. In practice, this introduces problems with rare words (e.g., proper nouns) which are out of vocabulary. To alleviate this problem, one could potentially increase the size of the decoder vocabulary, but decoding becomes computationally much harder, as one has to compute the soft-max over all possible words. Gulcehre et al. (2016) , Nallapati et al. (2016) and Gu et al. (2016) proposed to use a copy mechanism that dynamically copy the words from the input sequence while decoding. However, they lack the ability to extract proper embeddings of out-of-vocabulary words from the input context. Bahdanau et al. (2014) proposed to use an attention mechanism to emphasize specific parts of the input sentence when generating each word. However the encoder problem still remains in this approach.

In this work, we propose two simple mechanisms to deal with both encoder and decoder problems. We borrowed intuition from human readers which read the text multiple times before generating summaries. We thus propose a 'Read-Again' model that first reads the input sequence before committing to a representation of each word. The first read representation then biases the second read representation and thus allows the intermediate hidden vectors to capture the meaning appropriate for the input text. We show that this idea can be applied to both LSTM and GRU models. Our second contribution is a copy mechanism which allows us to use much smaller vocabulary sizes resulting in much faster decoding and much smaller storage space. Our copy mechanism also allows us to construct a better representation of out-of-vocabulary words. We demonstrate the effectiveness of our approach in the challenging Gigaword dataset and DUC competition showing state-of-the-art performance.

2. RELATED WORK:



2.1. SUMMARIZATION:

In the past few years, there has been a lot of work on extractive summarization, where a summary is created by composing words or sentences from the source text. Notable examples are Neto et al. (2002) , Erkan & Radev (2004) , Wong et al. (2008) , Filippova & Altun (2013) and Colmenares et al. (2015) . As a consequence of their extractive nature the summary is restricted to words (sentences) in the source text.

Abstractive summarization, on the contrary, aims at generating consistent summaries based on understanding the input text. Although there has been much less work on abstractive methods, they can in principle produce much richer summaries. Abstractive summarization is standardized by the DUC2003 and DUC2004 competitions (Over et al. (2007) ). Some of the prominent approaches on this task includes Banko et al. (2000) , Zajic et al. (2004) , Cohn & Lapata (2008) and Woodsend et al. (2010) . Among them, the TOPIARY system (Zajic et al. (2004) ) performs the best in the competitions amongst non neural net based methods.

Very recently, the success of deep neural networks in many natural language processing tasks (Collobert et al. ( 2011)) has inspired new work in abstractive summarization . Rush et al. (2015) propose a neural attention model with a convolutional encoder to solve this task. Hu et al. (2015) build a large dataset for Chinese text summarization and propose to feed all hidden states from the encoder into the decoder. More recently, Chopra et al. (2016 ) extended Rush et al. (2015) 's work with an RNN decoder, and Nallapati et al. (2016) proposed an RNN encoder-decoder architecture for summarization. Both techniques are currently the state-of-the-art on the DUC competition. However, the encoders exploited in these methods lack the ability to encode each word condition on the whole text, as an RNN encodes a word into a hidden vector by taking into account only the words up to that time step.

In contrast, in this work we propose a 'Read-Again' encoder-decoder architecture, which enables the encoder to understand each input word after reading the whole sentence. Our encoder first reads the text, and the results from the first read help represent the text in the second pass over the source text. Our second contribution is a simple copy mechanism that allows us to significantly reduce the decoder vocabulary size resulting in much faster inference times. Furthermore our copy mechanism allows us to handle out-of-vocabulary words in a principled manner. Finally our experiments show state-of-the-art performance on the DUC competition.

2.2. NEURAL MACHINE TRANSLATION:

Our work is also closely related to recent work on neural machine translation, where neural encoderdecoder models have shown promising results (Kalchbrenner & Blunsom (2013) ; Cho et al. (2014) ; Sutskever et al. (2014) ). Bahdanau et al. (2014) further developed an attention mechanism in the decoder in order to pay attention to a specific part of the input at every generating time-step. Our approach also exploits an attention mechanism during decoding.

2.3. OUT-OF-VOCABULARY AND COPY MECHANISM:

Dealing with Out-Of-Vocabulary words (OOVs) is an important issue in sequence to sequence approaches as we cannot enumerate all possible words and learn their embeddings since they might not be part of our training set. Luong et al. (2014) 2016) use a implicit implicit gating operation instead of the explicit gating. This is similar to our decoder. However, our decoder can also extract different OOVs' embedding accordingly from the input text instead of using a single <UNK> embedding to represent all OOVs. This further enhances the model's ability to handle OOVs.

3. THE READ AGAIN MODEL:

Text summarization can be formulated as a sequence to sequence prediction task, where the input is a longer text and the output is a summary of that text. In this paper we develop an encoder-decoder approach to summarization. The encoder is used to represent the input text with a set of continuous vectors, and the decoder is used to generate a summary word by word.

In the following, we first introduce our 'Read-Again' model for encoding sentences. The idea behind our approach is very intuitive and is inspired by how humans do this task. When we create summaries, we first read the text and then we do a second read where we pay special attention to the words that are relevant to generate the summary. Our 'Read-Again' model implements this idea by reading the input text twice and using the information acquired from the first read to bias the second read. This idea can be seamlessly plugged into LSTM and GRU models. Our second contribution is a copy mechanism used in the decoder. It allows us to reduce the decoder vocabulary size dramatically and can be used to extract a better embedding for OOVs. Fig. 1 (a) gives an overview of our model.

3.1. ENCODER:

We first review the typical encoder used in machine translation (e.g., Sutskever et al. (2014) ; Bahdanau et al. ( 2014)). Let x = {x 1 , x 2 , • • • , x n } be the input sequence of words. An encoder sequentially reads each word and creates the hidden representation h i by exploting a recurrent neural network (RNN)

EQUATION

where x i is the word embedding of x i . The hidden vectors h = {h 1 , h 2 , • • • , h n } are then treated as the feature representations for the whole input sentence and can be used by another RNN to decode and generate a target sentence. Although RNNs have been shown to be useful in modeling sequences, one of the major drawback is that h i depends only on past information i.e., {x 1 ,

• • • , x i }.

However, it is hard (even for humans) to have a proper representation of a word without reading the whole input sentence.

Following this intuition, we propose our 'Read-Again' model where the encoder reads the input sentence twice. In particular, the first read is used to bias the second more attentive read. We apply

x 1 x 2 h 1 init h 1 1 h 1 2 h 1 n x n ↵1 ↵2 ↵n x 1 x 2 x n h 2 1 h 2 2 h 2 n h 2 init ↵1 (1 ↵1) (1 ↵2) ↵2 ↵n (1 ↵n) • • • • • • • • • • • • re-weight re-weight re-weight Decoder Decoder Decoder GRU 1 GRU 1 GRU 1 GRU 2 GRU 2 GRU 2 (a) GRU Read-Again Encoder x 1 x 2 h 1 init h 1 1 h 1 2 h 1 n x n x 1 x 2 x n h 2 1 h 2 2 h 2 n h 2 init • • • • • • • • • • • • Decoder Decoder Decoder LST M 1 LST M 1 LST M 1 LST M 2 LST M 2 LST M 2 (b) LSTM Read-Again Encoder

Figure 2 : Read-Again Model this idea to two popular RNN architectures, i.e. GRU and LSTM, resulting in better encodings of the input text. Note that although other alternatives, such as bidirectional RNN exist, the hidden states from the forward RNN lack direct interactions with the backward RNN, and thus forward/backward hidden states still cannot utilize the whole sequence. Besides, although we only use our model in a uni-directional manner, it can also be easily adapted to the bidirectional case. We now describe the two variants of our model.

3.1.1. GRU READ-AGAIN:

We read the input sentence {x 1 , x 2 , • • • , x n } for the first-time using a standard GRU

EQUATION

where the function GRU 1 is defined as,

z i = σ(W z [x i , h 1 i-1 ]) (3) r i = σ(W r [x i , h 1 i-1 ]) h 1 i = tanh(W h [x i , r i h 1 i-1 ]) h 1 i = (1 -z i ) h 1 i-1 + z i h 1 i

It consists of two gatings z i , r i , controlling whether the current hidden state h 1 i should be directly copied from h 1 i-1 or should pass through a more complex path h 1 i . Given the sentence feature vector h 1 n , we then compute an importance weight vector α i of each word for the second reading. We put the importance weight α i on the skip-connections as shown in Fig. 2(a ) to bias the two information flows: If the current word x i has a very small weight α i , then the second read hidden state h 2 i will mostly take the information directly from the previous state h 2 i-1 , ignoring the influence of the current word. If α i is close to 1 then it will be similar to a standard GRU, which is only influenced from the current word. Thus the second reading has the following update rule

EQUATION

where means element-wise product. We compute the importance weights by attending h 1 i with h 1 n as follows

EQUATION

where W e , U e , V e are learnable parameters. Note that α i is a vector representing the importance of each dimension in the word embedding. Empirically, we find that using a vector is better than a scalar gating. We hypothesize that this is because different dimensions represent different semantic meanings, and a scalar gating mechanism lacks the ability to capture the variances among these dimensions.

x 1 x 2

h 1 init h 1 1 h 1 2 h 1 n x n x 1 x 2 x n h 2 1 h 2 2 h 2 n h 2 init • • • • • • • • • • • • Decoder Decoder Decoder hglobal hglobal hglobal • • • • • • • • • • • • Decoder Decoder Decoder hglobal hglobal hglobal x 0 1 x 0 2 x 0 m x 0 1 x 0 2 x 0 m h 01 init h 01 1 h 01 2 h 01 m h 02 init h 02 2 h 02 1 h 02 m hglobal RN N 1 RN N 1 RN N 1 RN N 1 RN N 1 RN N 1 RNN 2 RNN 2 RN N 2 RN N 2 RN N 2 RN N 2 sentence1 sentence2

Figure 3 : Hierachical Read-Again

Combining this with the standard GRU update rule

GRU 2 (x i , h 2 i-1 ) = (1 -z i ) h 2 i-1 + z i h 2 i ,

we can simplify the updating rule Eq. (4) to get

h 2 i = (1 -α i z i ) h 2 i-1 + (α i z i ) h 2 i (6)

This equations shows that our 'read-again' model on GRU is equivalent to replace the GRU cell with a more general gating mechanism that also depends on the feature representation of the whole sentence computed from the first reading pass. We argue that adding this global information could help direct the information flow for the forward pass resulting in a better encoder.

3.1.2. LSTM READ-AGAIN:

We now apply the 'Read-Again' idea to the LSTM architecture as shown in Fig. 2 (b). Our first reading is performed by an LST M 1 defined as

f i = σ(W f [x i , h i-1 ]) (7) i i = σ(W i [x i , h i-1 ]) o i = σ(W o [x i , h i-1 ]) C i = tanh(W C [x i , h i-1 ]) C i = f t C i-1 + i i C i h i = o i tanh(C i )

Different from the GRU architecture, LSTM calculates the hidden state by applying a non-linear activation function to the cell state C i , instead of a linear combination of two paths used in the GRU. Thus for our second read, instead of using skip-connections, we make the gating functions explicitly depend on the whole sentence vector computed from the first reading pass. We argue that this helps the encoding of the second reading LST M 2 , as all gating and updating increments are also conditioned on the whole sequence feature vector (h

EQUATION

3.1.3. READING MULTIPLE SENTENCES:

In this section we extend our 'Read-Again' model to the case where the input sequence has more than one sentence. Towards this goal, we propose to use a hierarchical representation, where each sentence has its own feature vector from the first reading pass. We then combine them into a single vector to bias the second reading pass. We illustrate this in the context of two input sentences, but it is easy to generalize to more sentences. Let {x 1 , x 2 , • • • , x n } and {x 1 , • • • , x m } be the two input sentences. The first RNN reads these two sentences independently to get two sentence feature vectors h 1 n and h 1 m respectively. Here we investigate two different ways to handle multiple sentences. Our first option is to simply concatenate the two feature vectors to bias our second reading pass:

EQUATION

h 2 i = RNN 2 ([x i , h 1 i , h 1 n , h 1 m ], h 2 i-1

) where h 2 0 and h 2 0 are initialized as zero vectors. Feeding h 1 n , h 1 m into the second RNN provides more global information explicitly and helps acquire long term dependencies.

The second option we explored is shown in Fig. 3 . In particular, we use a non-linear transformation to get a single feature vector h global from both sentence feature vectors:

h global = tanh(W r h 1 n + U r h 1 m + v r ) (10)

The second reading pass is then

EQUATION

h 2 i = RNN 2 ([x i , h 1 i , h 1 m , h global ], h 2 i-1

) Note that this is more easily scalable to more sentences. In our experiments both approaches perform similarly.

3.2. DECODER WITH COPY MECHANISM:

In this paper we argue that only a small number of common words are needed for generating a summary in addition to the words that are present in the source text. We can consider this as a hybrid approach which combines extractive and abstractive summarization. This has two benefits: first it allow us to use a very small vocabulary size, speeding up inference. Furthermore, we can create summaries which contain OOVs if they are present in the source text.

Our decoder reads the vector representations of the input text using an attention mechanism, and generates the target summary word by word. We use an LSTM as our decoder, with a fixed-size vocabulary dictionary Y and learnable word embeddings Y ∈ R |Y |×dim . At time-step t the LSTM generates a summary word y t by first computing the current hidden state s t from the previous hidden state s t-1 , previous summary word y t-1 and current context vector c t s t = LST M ([y t-1 , c t ], s t-1 ), (12) where the context vector c t is computed with an attention mechanism on the encoder hidden states:

EQUATION

)

The attention score β it at time-step t on the i-th word is computed via a soft-max over o it , where

o it = att(s t-1 , h 2 i ) = v T a tanh(W a s t-1 + U a h 2 i ), (14) with v a , W a , U a learnable parameters.

A typical way to treat OOVs is to encode them with a single shared embedding. However, different OOVs can have very different meanings, and thus using a single embedding for all OOVs will confuse the model. This is particularly detrimental when using small vocabulary sizes. Here we address this issue by deriving the representations of OOVs from their corresponding context in the input text. Towards this goal, we change the update rule of y t-1 . In particular, if y t-1 belongs to a word that is in our decoder vocabulary we take its representation from the word embedding, otherwise if it appears in the input sentence as x i we use

y t-1 = p i = tanh(W c h 2 i + b c ) (15)

where W c and b c are learnable parameters. Since h 2 i encodes useful context information of the source word x i , p i can be interpreted as the semantics of this word extracted from the input sentence. Furthermore, if y t-1 does not appear in the input text, nor in Y , then we represent y t-1 using the <UNK> embedding.

Given the current decoder's hidden state s t , we can generate the target summary word y t . As shown in Fig. 1(b) , at each time step during decoding, the decoder outputs a distribution over generating words from Y , as well as over copying a specific word x i from the source sentence.

3.3. LEARNING:

We jointly learn our encoder and decoder by maximizing the likelihood of decoding the correct word at each time step. We refer the reader to the experimental evaluation for more details.

4. EXPERIMENTAL EVALALUATION:

In this section, we show results of abstractive summarization on Gigaword (Graff & Cieri (2003) ; Napoles et al. (2012) ) and DUC2004 (Over et al. (2007) ) datasets. Our model can learn a meaningful re-reading weight distribution for each word in the input text, putting more emphasis on important verb and nous, while ignoring common words such as prepositions. As for the decoder, we demonstrate that our copy mechanism can successfully reduce the typical vocabulary size by a factor 5 while achieving much better performance than the state-of-the-art, and by a factor of 30 while maintaining the same level of performance. In addition, we provide an analysis and examples of which words are copied during decoding.

Dataset and Evaluation Metric::

We use the Gigaword corpus to train and evaluate our models. Gigaword is a news corpus where the title is employed as a proxy for the summary of the article. We follow the same pre-processing steps of Rush et al. ( 2015), which include filtering, PTB tokenization, lower-casing, replacing digit characters with #, replacing low-frequency words with UNK and extracting the first sentence in each article. This results in a training set of 3.8M articles, a validation set and a test set each containing 400K articles. The average sentence length is 31.3 words for the source, and 8.3 words for the summaries. Following the standard protocol we evaluate ROUGE score on 2000 random samples from the test set. As for evaluation metric, we use full-length F1 score on Rouge-1, Rouge-2 and Rouge-L, following Chopra et al. (2016) and Nallapati et al. (2016) , since these metrics are less bias to the outputs' length than full-length recall scores.

Implemetation Details: We implement our model in Tensorflow and conduct all experiments on a NVIDIA Titan X GPU. Our models converged after 2-3 days of training, depending on model size. Our RNN cells in all models have 1 layer, 512-dimensional hidden states, and 512-dimensional word embeddings. We use dropout rate of 0.2 in all activation layers. All parameters, except the biases are initialized uniformly with a range of 3/d, where d is the dimension of the hidden state (Sussillo & Abbott (2014) ). The biases are initialized to 0.1. We use plain SGD to train the model with gradient clipped at 10. We start with an initial learning rate of 2, and halve it every epoch after first 5 epochs. Our max epoch for training is 10. We use a mini-batch size of 64, which is shuffled during training. Ours-Opt-1 and Ours-Opt-2 are the models described in section 3.1.3. Size denotes the size of decoder vocabulary in a model.

Results on Gigaword::

We compare the performances of different architectures and report ROUGE scores in Table 1 . Our baselines include the ABS model of Rush et al. (2015) with its proposed vocabulary size as well as an attention encoder-decoder model with uni-directional GRU encoder. We allow the decoder to generate variable length summaries. As shown in Table 1 our Read-Again models outperform the baselines on all ROUGE scores, when using both 15K and 69K sized vocabularies. We also observe that adding the copy mechanism further helps to improve performance: Even though the decoder vocabulary size of our approach with copy (15K) is much smaller than ABS (69K) and GRU (69K), it achieves a higher ROUGE score. Besides, our Multiple-Sentences model achieves the best performance.

Models Size:

Rouge-1 Rouge-2 Rouge-L ZOPIARY (Zajic et al. (2004) Following the convention, we also use ROUGE limited-length recall as our evaluation metric, and set the capping length to 75 characters. We generate summaries with 15 words using beam-size of 10. As shown in Table 2 , our method outperforms all previous methods on Rouge-1 and Rouge-L, and is comparable on Rouge-2. Furthermore, our model only uses 15k decoder vocabulary, while previous methods use 69k or 200k.

Importance Weight Visualization: As we described in the section before, α i is a high-dimension vector representing the importance of each word x i . While the importance of a word is different over each dimension, by averaging we can still look at general trends of which word is more relevant. Fig. 4 depicts sample sentences with the importance weight α i over input words. Words such as the, a, 's, have small α i , while words such as aeronautics, resettled, impediments, which carry more information have higher values. This shows that our read-again technique indeed extracts useful information from the first reading to help bias the second reading results. Table 3 shows the effect on our model of decreasing the decoder vocabulary size. We can see that when using the copy mechanism, we are able to reduce the decoder vocabulary size from 69K to 2K, with only 2-3 points drop on ROUGE score. This contrasts the models that do not use the copy mechanism. Equipped with a copy mechanism, our model is able to generate OOVs as summary words, and thus maintains its expressive ability even with a small decoder vocabulary size. We also observe from Table 4 that the copy mechanism help us to decrease the encoder vocabulary size as well. The model without copy suffers from severe OOV problem when encoder size is small, since a single shared <UNK> embedding cannot depict many different OOVs. This makes it difficult for the encoder to understand the input text. Meanwhile, our copy model can extract an OOV's meaning accordingly from its context in the input text, and thus it is sufficient to learn and store only the high-frequency words embeddings using our model, which in turn save the storage. We also notice that shrinking the encoder vocabulary to 15k achieves better result. One possible reason is that long tail words can not learn efficient embeddings during training, and representing them with extracted embedding from our model performs better. 6 provides some examples of visualization of the copy mechanism. Note that we are able to copy key words from source sentences to improve the summary. From these examples we can see that our model is able to copy different types of rare words, such as special entities' names in case 1 and 2, rare nouns in case 3 and 4, adjectives in case 5 and 6, and even rare verbs in the last example. Note that in the third example, when the copy model's decoder uses the embedding of headmaster as its first input, which is extracted from the source sentence, it generates the same following sentence as the no-copy model. This probably means that the extracted embedding of headmaster is closely related to the learned embedding of teacher.

:



Figures and Tables:

Evaluation on DUC2004: DUC 2004(Over et al. (2007)) is a commonly used benchmark on summarization task consisting of 500 news articles. Each article is paired with 4 different humangenerated reference summaries, capped at 75 characters. This dataset is evaluation-only. Similar to Rush et al. (2015), we train our neural model on the Gigaword training set, and show the models' performances on DUC2004.

indonesia has moved #.# million people and resettled them in #,### villages in a national transmigration scheme over the past ## years , president suharto said here monday . state-owned domestic carrier merpati nusantara airlines will lease ## aircraft from the united states , the official antara news agency reported here thursday .

Figure 4: Weight Visualization. Black indicates high weight

address this issue by annotating words on the source, and aligning OOVs in the target with those source words. Recently,Vinyals et al. (2015)

Table content: <table><tr><td/><td/><td/><td/><td/><td/><td/><td/><td>y t</td></tr><tr><td/><td/><td/><td/><td/><td>s t 1</td><td>Decoder</td><td>s t</td></tr><tr><td/><td/><td/><td colspan="2">y1, y2, • • • , &lt; eos &gt;</td><td>Decoder Word Embedding</td><td>y t 1</td><td/><td>Decoder Word</td></tr><tr><td>Encoder 1</td><td>re-weight</td><td>Encoder 2</td><td>attention</td><td>Decoder</td><td>Copied Word Embedding</td><td>c t</td><td/><td>Copied Word</td></tr><tr><td>x1, x2, x3, • • • , xn read 1 st</td><td/><td>x1, x2, x3, • • • , xn 2 nd read</td><td>copy</td><td/><td/><td/><td/></tr><tr><td/><td/><td/><td/><td>h 2 1</td><td>p 1 h 2 2</td><td>p 2</td><td>h 2 n</td><td>p n</td></tr><tr><td/><td/><td/><td/><td>Enc2</td><td>Enc2</td><td/><td>Enc2</td></tr><tr><td/><td colspan="3">(a) Overall Model</td><td/><td colspan="3">(b) Decoder</td></tr><tr><td/><td/><td colspan="5">Figure 1: Read-Again Summarization Model</td><td/></tr><tr><td colspan="9">propose Pointer Networks, which calculate a probability distribution over the input sequence instead</td></tr><tr><td colspan="9">of predicting a token from a pre-defined dictionary. Cheng &amp; Lapata (2016) develop a neural-based</td></tr><tr><td colspan="9">extractive summarization model, which predicts the targets from the input sequences. Gulcehre et al.</td></tr><tr><td colspan="9">(2016); Nallapati et al. (2016) use explicit gating to decide adaptively wether to generate a target</td></tr><tr><td colspan="8">word from the fixed-size dictionary or from the input sequence. Gu et al. (</td></tr></table>

Different Read-Again Model. Ours denotes Read-Again models. C denotes copy mechanism.

Table content: <table><tr><td colspan="2">4.1 QUANTITATIVE EVALUATION</td><td/><td/><td/></tr><tr><td colspan="2">#Input Model</td><td colspan="3">Size Rouge-1 Rouge-2 Rouge-L</td></tr><tr><td/><td>ABS (baseline)</td><td>69K 24.12</td><td>10.24</td><td>22.61</td></tr><tr><td/><td colspan="2">GRU (baseline) 69K 26.79</td><td>12.03</td><td>25.14</td></tr><tr><td/><td>Ours-GRU</td><td>69K 27.26</td><td>12.28</td><td>25.48</td></tr><tr><td/><td>Ours-LSTM</td><td>69K 27.82</td><td>12.74</td><td>26.01</td></tr><tr><td>1 sent</td><td colspan="2">GRU (baseline) 15K 24.67</td><td>11.30</td><td>23.28</td></tr><tr><td/><td>Ours-GRU</td><td>15K 25.04</td><td>11.40</td><td>23.47</td></tr><tr><td/><td>Ours-LSTM</td><td>15K 25.30</td><td>11.76</td><td>23.71</td></tr><tr><td/><td>Ours-GRU (C)</td><td>15K 27.41</td><td>12.58</td><td>25.74</td></tr><tr><td/><td colspan="2">Ours-LSTM (C) 15K 27.37</td><td>12.64</td><td>25.69</td></tr><tr><td>2 sent</td><td>Ours-Opt-1 (C) Ours-Opt-2 (C)</td><td>15K 27.95 15K 27.96</td><td>12.65 12.65</td><td>26.10 26.18</td></tr></table>

Rouge-N limited-length recall on DUC2004. Size denotes the size of decoder vocabulary in a model.

Table content: <table><tr><td>)</td><td>-</td><td>25.12</td><td>6.46</td><td>20.12</td></tr><tr><td>ABS (Rush et al. (2015))</td><td>69K</td><td>26.55</td><td>7.06</td><td>23.49</td></tr><tr><td>ABS+ (Rush et al. (2015))</td><td>69K</td><td>28.18</td><td>8.49</td><td>23.81</td></tr><tr><td>RAS-LSTM (Chopra et al. (2016))</td><td>69K</td><td>27.41</td><td>7.69</td><td>23.06</td></tr><tr><td>RAS-Elman (Chopra et al. (2016))</td><td>69K</td><td>28.97</td><td>8.26</td><td>24.06</td></tr><tr><td colspan="2">big-words-lvt2k-1sent (Nallapati et al. (2016)) 69K</td><td>28.35</td><td>9.46</td><td>24.59</td></tr><tr><td colspan="3">big-words-lvt5k-1sent (Nallapati et al. (2016)) 200K 28.61</td><td>9.42</td><td>25.24</td></tr><tr><td>Ours-GRU (C)</td><td>15K</td><td>29.08</td><td>9.20</td><td>25.25</td></tr><tr><td>Ours-LSTM (C)</td><td>15K</td><td>29.89</td><td>9.37</td><td>25.93</td></tr><tr><td>Ours-Opt-2 (C)</td><td>15K</td><td>29.74</td><td>9.44</td><td>25.94</td></tr></table>

ROUGE Evaluation for Models with Different Encoder Size and 15k Decoder Size. Ours denotes Read-Again. C denotes copy mechanism.

Table content: <table/>

shows the decoding time as a function of vocabulary size. As computing the soft-max is usually the bottleneck for decoding, reducing vocabulary size dramatically reduces the decoding time from 0.38 second per sentence to 0.08 second.

Table content: <table><tr><td>Decoder-Size</td><td>2k</td><td>5k</td><td>15k</td><td>30k</td><td>69k</td></tr><tr><td>Ours-LSTM</td><td colspan="5">0.076 0.081 0.111 0.161 0.356</td></tr><tr><td colspan="6">Ours-LSTM (C) 0.084 0.090 0.123 0.171 0.376</td></tr></table>

Decoding Time (s) per Sentence of Models with Different Decoder Size Table

Table content: <table/>

Peer review (iclr2017):
Summary: This paper proposes a read-again attention-based representation of the document with the copy mechanism for the summarization task. The model reads each sentence in the input document twice and creates a hierarchical representation of it instead of a bidirectional RNN. During the decoding, it uses the representation of the document obtained via the read-again mechanism and points the words that are OOV in the source document. The model does abstractive summarization. The authors show improvements on DUC 2004 dataset and provide an analysis of their model with different configurations. Contributions: The main contribution of this paper is the read-again attention mechanism where the model reads the same sentence twice and obtains a better representation of the document. Writing: The text of this paper needs more work. There are several typos and the explanations of the model/architecture are not really clear, some parts of the paper feel somewhat bloated. Pros: - The proposed model is a simple extension to the model to the model proposed in [2] for summarization. - The results are better than the baselines. Cons: - The improvements are not that large. - Justifications are not strong enough. - The paper needs a better writeup. Several parts of the text are not using a clear/precise language and the paper needs a better reorganization. Some parts of the text is somewhat informal. - The paper is very application oriented. Question: - How does the training speed when compared to the regular LSTM? Some Criticisms: A similar approach to the read again mechanism which is proposed in this paper has already been explored in [1] in the context of algorithmic learning and I wouldn’t consider the application of that on the summarization task a significant contribution. The justification behind the read-again mechanism proposed in this paper is very weak. It is not really clear why additional gating alpha_i is needed for the read again stage. As authors also suggest, pointer mechanism for the unknown/rare words [2] and it is adopted for the read-again attention mechanism. However, in the paper, it is not clear where the real is the gain coming from, whether from “read-again” mechanism or the use of “pointing”. The paper is very application focused, the contributions of the paper in terms of ML point of view is very weak. It is possible to try this read-again mechanism on more tasks other than summarization, such as NMT, in order to see whether if those improvements are The writing of this paper needs more work. In general, it is not very well-written. Minor comments: Some of the corrections that I would recommend fixing, On page 4: “… better than a single value … ” —> “… scalar gating …” On page 4: “… single value lacks the ability to model the variances among these dimensions.” —> “… scalar gating couldn’t capture the ….” On page 6: “ … where h_0^2 and h_0^*2 are initial zero vectors … “ —> “… h_0^2 and h_0^*2 are initialized to a zero vector in the beginning of each sequence …* There are some inconsistencies for example parts of the paper refer to Tab. 1 and some parts of the paper refer to Table 2. Better naming of the models in Table 1 is needed. The location of Table 1 is a bit off. [1] Zaremba, Wojciech, and Ilya Sutskever. *Reinforcement learning neural Turing machines.* arXiv preprint arXiv:1505.00521 362 (2015). [2] Gulcehre, Caglar, et al. *Pointing the Unknown Words.* arXiv preprint arXiv:1603.08148 (2016).