| { |
| "paper_id": "P17-1013", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T08:17:34.961709Z" |
| }, |
| "title": "Deep Neural Machine Translation with Linear Associative Unit", |
| "authors": [ |
| { |
| "first": "Mingxuan", |
| "middle": [], |
| "last": "Wang", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Tencent Technology Co", |
| "location": { |
| "settlement": "Ltd" |
| } |
| }, |
| "email": "wangmingxuan@ict.ac.cn" |
| }, |
| { |
| "first": "Zhengdong", |
| "middle": [], |
| "last": "Lu", |
| "suffix": "", |
| "affiliation": {}, |
| "email": "" |
| }, |
| { |
| "first": "Jie", |
| "middle": [], |
| "last": "Zhou", |
| "suffix": "", |
| "affiliation": {}, |
| "email": "" |
| }, |
| { |
| "first": "Qun", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "", |
| "affiliation": {}, |
| "email": "" |
| }, |
| { |
| "first": "Deeplycurious", |
| "middle": [], |
| "last": "Ai", |
| "suffix": "", |
| "affiliation": {}, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "Deep Neural Networks (DNNs) have provably enhanced the state-of-the-art Neural Machine Translation (NMT) with their capability in modeling complex functions and capturing complex linguistic structures. However NMT systems with deep architecture in their encoder or decoder RNNs often suffer from severe gradient diffusion due to the non-linear recurrent activations, which often make the optimization much more difficult. To address this problem we propose novel linear associative units (LAU) to reduce the gradient propagation length inside the recurrent unit. Different from conventional approaches (LSTM unit and GRU), LAUs utilizes linear associative connections between input and output of the recurrent unit, which allows unimpeded information flow through both space and time direction. The model is quite simple, but it is surprisingly effective. Our empirical study on Chinese-English translation shows that our model with proper configuration can improve by 11.7 BLEU upon Groundhog and the best reported results in the same setting. On WMT14 English-German task and a larger WMT14 English-French task, our model achieves comparable results with the state-of-the-art.", |
| "pdf_parse": { |
| "paper_id": "P17-1013", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "Deep Neural Networks (DNNs) have provably enhanced the state-of-the-art Neural Machine Translation (NMT) with their capability in modeling complex functions and capturing complex linguistic structures. However NMT systems with deep architecture in their encoder or decoder RNNs often suffer from severe gradient diffusion due to the non-linear recurrent activations, which often make the optimization much more difficult. To address this problem we propose novel linear associative units (LAU) to reduce the gradient propagation length inside the recurrent unit. Different from conventional approaches (LSTM unit and GRU), LAUs utilizes linear associative connections between input and output of the recurrent unit, which allows unimpeded information flow through both space and time direction. The model is quite simple, but it is surprisingly effective. Our empirical study on Chinese-English translation shows that our model with proper configuration can improve by 11.7 BLEU upon Groundhog and the best reported results in the same setting. On WMT14 English-German task and a larger WMT14 English-French task, our model achieves comparable results with the state-of-the-art.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "Neural Machine Translation (NMT) is an endto-end learning approach to machine transla-tion which has recently shown promising results on multiple language pairs (Luong et al., 2015; Shen et al., 2015; Wu et al., 2016; Tu et al., 2016; Zhang and Zong, 2016; Jean et al., 2015; Meng et al., 2015) . Unlike conventional Statistical Machine Translation (SMT) systems (Koehn et al., 2003; Chiang, 2005; Xiong et al., 2006; Mi et al., 2008) which consist of multiple separately tuned components, NMT aims at building upon a single and large neural network to directly map input text to associated output text. Typical NMT models consists of two recurrent neural networks (RNNs), an encoder to read and encode the input text into a distributed representation and a decoder to generate translated text conditioned on the input representation .", |
| "cite_spans": [ |
| { |
| "start": 161, |
| "end": 181, |
| "text": "(Luong et al., 2015;", |
| "ref_id": "BIBREF13" |
| }, |
| { |
| "start": 182, |
| "end": 200, |
| "text": "Shen et al., 2015;", |
| "ref_id": "BIBREF20" |
| }, |
| { |
| "start": 201, |
| "end": 217, |
| "text": "Wu et al., 2016;", |
| "ref_id": "BIBREF26" |
| }, |
| { |
| "start": 218, |
| "end": 234, |
| "text": "Tu et al., 2016;", |
| "ref_id": "BIBREF24" |
| }, |
| { |
| "start": 235, |
| "end": 256, |
| "text": "Zhang and Zong, 2016;", |
| "ref_id": "BIBREF30" |
| }, |
| { |
| "start": 257, |
| "end": 275, |
| "text": "Jean et al., 2015;", |
| "ref_id": "BIBREF9" |
| }, |
| { |
| "start": 276, |
| "end": 294, |
| "text": "Meng et al., 2015)", |
| "ref_id": "BIBREF15" |
| }, |
| { |
| "start": 363, |
| "end": 383, |
| "text": "(Koehn et al., 2003;", |
| "ref_id": "BIBREF11" |
| }, |
| { |
| "start": 384, |
| "end": 397, |
| "text": "Chiang, 2005;", |
| "ref_id": "BIBREF2" |
| }, |
| { |
| "start": 398, |
| "end": 417, |
| "text": "Xiong et al., 2006;", |
| "ref_id": "BIBREF27" |
| }, |
| { |
| "start": 418, |
| "end": 434, |
| "text": "Mi et al., 2008)", |
| "ref_id": "BIBREF16" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Driven by the breakthrough achieved in computer vision Srivastava et al., 2015) , research in NMT has recently turned towards studying Deep Neural Networks (DNNs). Wu et al. (2016) and Zhou et al. (2016) found that deep architectures in both the encoder and decoder are essential for capturing subtle irregularities in the source and target languages. However, training a deep neural network is not as simple as stacking layers. Optimization often becomes increasingly difficult with more layers. One reasonable explanation is the notorious problem of vanishing/exploding gradients which was first studied in the context of vanilla RNNs (Pascanu et al., 2013b) . Most prevalent approaches to solve this problem rely on short-cut connections between adjacent layers such as residual or fastforward connections Srivastava et al., 2015; Zhou et al., 2016) . Differ-ent from previous work, we choose to reduce the gradient path inside the recurrent units and propose a novel Linear Associative Unit (LAU) which creates a fusion of both linear and nonlinear transformations of the input. Through this design, information can flow across several steps both in time and in space with little attenuation. The mechanism makes it easy to train deep stack RNNs which can efficiently capture the complex inherent structures of sentences for NMT. Based on LAUs, we also propose a NMT model , called DEEPLAU, with deep architecture in both the encoder and decoder.", |
| "cite_spans": [ |
| { |
| "start": 55, |
| "end": 79, |
| "text": "Srivastava et al., 2015)", |
| "ref_id": "BIBREF21" |
| }, |
| { |
| "start": 164, |
| "end": 180, |
| "text": "Wu et al. (2016)", |
| "ref_id": "BIBREF26" |
| }, |
| { |
| "start": 185, |
| "end": 203, |
| "text": "Zhou et al. (2016)", |
| "ref_id": "BIBREF31" |
| }, |
| { |
| "start": 637, |
| "end": 660, |
| "text": "(Pascanu et al., 2013b)", |
| "ref_id": "BIBREF19" |
| }, |
| { |
| "start": 809, |
| "end": 833, |
| "text": "Srivastava et al., 2015;", |
| "ref_id": "BIBREF21" |
| }, |
| { |
| "start": 834, |
| "end": 852, |
| "text": "Zhou et al., 2016)", |
| "ref_id": "BIBREF31" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Although DEEPLAU is fairly simple, it gives remarkable empirical results. On the NIST Chinese-English task, DEEPLAU with proper settings yields the best reported result and also a 4.9 BLEU improvement over a strong NMT baseline with most known techniques (e.g, dropout) incorporated. On WMT English-German and English-French tasks, it also achieves performance superior or comparable to the state-of-the-art.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "A typical neural machine translation system is a single and large neural network which directly models the conditional probability p(y|x) of translating a source sentence", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Neural machine translation", |
| "sec_num": "2" |
| }, |
| { |
| "text": "x = {x 1 , x 2 , \u2022 \u2022 \u2022 , x Tx } to a target sentence y = {y 1 , y 2 , \u2022 \u2022 \u2022 , y Ty }.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Neural machine translation", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Attention-based NMT, with RNNsearch as its most popular representative, generalizes the conventional notion of encoder-decoder in using an array of vectors to represent the source sentence and dynamically addressing the relevant segments of them during decoding. The process can be explicitly split into an encoding part, a decoding part and an attention mechanism. The model first encodes the source sentence x into a sequence of vectors c", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Neural machine translation", |
| "sec_num": "2" |
| }, |
| { |
| "text": "= {h 1 , h 2 , \u2022 \u2022 \u2022 , h Tx }.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Neural machine translation", |
| "sec_num": "2" |
| }, |
| { |
| "text": "In general, h i is the annotation of x i from a bi-directional RNN which contains information about the whole sentence with a strong focus on the parts of x i . Then, the RNNsearch model decodes and generates the target translation y based on the context c and the partial traslated sequence y <t by maximizing the probability of p(y i |y <i , c). In the atten-tion model, c is dynamically obtained according to the contribution of the source annotation made to the word prediction. This is called automatic alignment or attention mechanism (Luong et al., 2015) , but it is essentially reading with content-based addressing defined in (Graves et al., 2014) . With this addressing strategy the decoder can attend to the source representation that is most relevant to the stage of decoding.", |
| "cite_spans": [ |
| { |
| "start": 541, |
| "end": 561, |
| "text": "(Luong et al., 2015)", |
| "ref_id": "BIBREF13" |
| }, |
| { |
| "start": 635, |
| "end": 656, |
| "text": "(Graves et al., 2014)", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Neural machine translation", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Deep neural models have recently achieved a great success in a wide range of problems. In computer vision, models with more than 100 convolutional layers have outperformed shallow ones by a big margin on a series of image tasks Srivastava et al., 2015) . Following similar ideas of building deep CNNs, some promising improvements have also been achieved on building deep NMT systems. Zhou et al. (2016) proposed a new type of linear connections between adjacent layers to simplify the training of deeply stacked RNNs. Similarly, Wu et al. (2016) introduced residual connections to their deep neural machine translation system and achieve great improvements. However the optimization of deep RNNs is still an open problem due to the massive recurrent computation which makes the gradient propagation path extremely tortuous.", |
| "cite_spans": [ |
| { |
| "start": 228, |
| "end": 252, |
| "text": "Srivastava et al., 2015)", |
| "ref_id": "BIBREF21" |
| }, |
| { |
| "start": 384, |
| "end": 402, |
| "text": "Zhou et al. (2016)", |
| "ref_id": "BIBREF31" |
| }, |
| { |
| "start": 529, |
| "end": 545, |
| "text": "Wu et al. (2016)", |
| "ref_id": "BIBREF26" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Neural machine translation", |
| "sec_num": "2" |
| }, |
| { |
| "text": "In this section, we discuss Linear Associative Unit (LAU) to ease the training of deep stack of RNNs. Based on this idea, we further propose DEEPLAU, a neural machine translation model with a deep encoder and decoder.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Model Description", |
| "sec_num": "3" |
| }, |
| { |
| "text": "A recurrent neural network (Williams and Zipser, 1989 ) is a class of neural network that has recurrent connections and a state (or its more sophisticated memory-like extension). The past information is built up through the recurrent connections. This makes RNN applicable for sequential prediction tasks of arbitrary length. Given a sequence of vectors ", |
| "cite_spans": [ |
| { |
| "start": 27, |
| "end": 53, |
| "text": "(Williams and Zipser, 1989", |
| "ref_id": "BIBREF25" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Recurrent Layers", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "x = {x 1 , x 2 , \u2022 \u2022 \u2022 , x T }", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Recurrent Layers", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "h t = \u03c6(x t , h t\u22121 ) (1)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Recurrent Layers", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "\u03c6 is usually a nonlinear function such as composition of a logistic sigmoid with an affine transformation.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Recurrent Layers", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "It is difficult to train RNNs to capture longterm dependencies because the gradients tend to either vanish (most of the time) or explode. The effect of long-term dependencies is dropped exponentially with respect to the gradient propagation length. The problem was explored in depth by (Hochreiter and Schmidhuber, 1997; Pascanu et al., 2013b) . A successful approach is to design a more sophisticated activation function than a usual activation function consisting of gating functions to control the information flow and reduce the propagation path. There is a long thread of work aiming to solve this problem, with the long short-term memory units (LSTM) being the most salient examples and gated recurrent unit (GRU) being the most recent one (Hochreiter and Schmidhuber, 1997; . RNNs employing either of these recurrent units have been shown to perform well in tasks that require capturing long-term dependencies. GRU can be viewed as a slightly more dramatic variation on LSTM with fewer parameters. The activation function is armed with two specifically designed gates called update and reset gates to control the flow of information inside each hidden unit. Each hidden state at time-step t is computed as follows", |
| "cite_spans": [ |
| { |
| "start": 286, |
| "end": 320, |
| "text": "(Hochreiter and Schmidhuber, 1997;", |
| "ref_id": "BIBREF8" |
| }, |
| { |
| "start": 321, |
| "end": 343, |
| "text": "Pascanu et al., 2013b)", |
| "ref_id": "BIBREF19" |
| }, |
| { |
| "start": 746, |
| "end": 780, |
| "text": "(Hochreiter and Schmidhuber, 1997;", |
| "ref_id": "BIBREF8" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Gated Recurrent Unit", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "h t = (1 \u2212 z t ) h t\u22121 + z t h t (2)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Gated Recurrent Unit", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "where is an element-wise product, z t is the update gate, andh t is the candidate activation.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Gated Recurrent Unit", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "h t = tanh(W xh x t + W hh (r t h t\u22121 )) (3)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Gated Recurrent Unit", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "where r t is the reset gate. Both reset and update gates are computed as :", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Gated Recurrent Unit", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "r t = \u03c3(W xr x t + W hr h t\u22121 ) (4) z t = \u03c3(W xz x t + W hz h t\u22121 )", |
| "eq_num": "(5)" |
| } |
| ], |
| "section": "Gated Recurrent Unit", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "This procedure of taking a linear sum between the existing state and the newly computed state is similar to the LSTM unit.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Gated Recurrent Unit", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "GRU can actually be viewed as a non-linear activation function with gating mechanism. Here we propose LAU which extends GRU by having an additional linear transformation of the input in its dynamics. More formally, the state update function becomes", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Linear Associative Unit", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "h t =((1 \u2212 z t ) h t\u22121 + z t h t ) (1 \u2212 g t ) + g t H(x t ).", |
| "eq_num": "(6)" |
| } |
| ], |
| "section": "Linear Associative Unit", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "Here the updated h t has three sources: 1) the direct transfer from previous state h t\u22121 , 2) the candidate updateh t , and 3) a direct contribution from the input H(x t ). More specifically, h t contains the nonlinear information of the input and the previous hidden state.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Linear Associative Unit", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "h t = tanh(f t (W xh x t ) + r t (W hh h t\u22121 )),", |
| "eq_num": "(7)" |
| } |
| ], |
| "section": "Linear Associative Unit", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "where f t and r t express how much of the nonlinear abstraction are produced by the input x t and previous hidden state h t , respectively. For simplicity, we set f t = 1 \u2212 r t in this paper and find that this works well in our experiments. The term H(x t ) is usually an affine linear transformation of the input x t to mach the dimensions of h t , where", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Linear Associative Unit", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "H(x t ) = W x x t .", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Linear Associative Unit", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "The associated term g t (the input gate) decides how much of the linear transformation of the input is carried to the hidden state and then the output. The gating function r t (reset gate) and z t (update gate) are computed following Equation (4) and (5) while g t is computed as", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Linear Associative Unit", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "g t = \u03c3(W xg x t + W hg h t\u22121 ).", |
| "eq_num": "(8)" |
| } |
| ], |
| "section": "Linear Associative Unit", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "The term g t H(x t ) therefore offers a direct way for input x t to go to later hidden layers, which can eventually lead to a path to the output layer when applied recursively. This mechanism is potentially very useful for translation where the input, no matter whether it is the source word or the attentive reading (context), should sometimes be directly carried to the next stage of processing without any substantial composition or nonlinear transformation. To understand this, imagine we want to translate a English sentence containing a relative rare entity name such as \"Bahrain\" to Chinese: LAU is potentially able to retain the embedding of this word in its hidden state, which will otherwise be prone to serious distortion due to the scarcity of training instances for it. Kalchbrenner et al. (2015) proposed to make a full connection of all the RNN hidden layers. In this work we employ vertical stacking where only the output of the previous layer of RNN is fed to the current layer as input. The input at recurrent layer (denoted as x t ) is exactly the output of the same time step at layer \u2212 1 (denoted as h \u22121 t ). Additionally, in order to learn more temporal dependencies, the sequences can be processed in different directions. More formally, given an input sequence", |
| "cite_spans": [ |
| { |
| "start": 783, |
| "end": 809, |
| "text": "Kalchbrenner et al. (2015)", |
| "ref_id": "BIBREF10" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Linear Associative Unit", |
| "sec_num": "3.3" |
| }, |
| { |
| "text": "\u2022\u2022\u2022 \u2022\u2022\u2022 \u2022\u2022\u2022 \u2022\u2022\u2022 \u2022\u2022\u2022 \u2022\u2022\u2022 1 2 <s> 1 Attention \u2022\u2022\u2022 \u2022\u2022\u2022 \u2022\u2022\u2022 softmax 1 2 </s>", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "x = (x 1 , ..., x T ), the output on layer is h ( ) t = x t , = 1 \u03c6 (h ( ) t+d , h ( \u22121) t ), > 1 (9) where \u2022 h ( ) t", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "gives the output of layer at location t.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "\u2022 \u03c6 is a recurrent function and we choose LAUs in this work.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "\u2022 The directions are marked by a direction term d \u2208 {\u22121, 1}. If we fixed d to \u22121, the input will be processed in forward direction, otherwise backward direction.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "The deep architecture of DEEPLAU, as shown in Figure 1 , consists of three parts: a stacked LAU-based encoder, a stacked LAUbased decoder and an improved attention model.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 46, |
| "end": 54, |
| "text": "Figure 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "Encoder One shortcoming of conventional RNNs is that they are only able to make use of previous context. In machine translation, where whole source utterances are transcribed at once, there is no reason not to exploit future context as well. Thus bi-directional RNNs are proposed to integrate information from the past and the future. The typical bidirectional approach processes the raw input in backward and forward direction with two separate layers, and then concatenates them together. Following Zhou et al. 2016, we choose another bidirectional approach to process the sequence in order to learn more temporal dependencies in this work. Specifically, an RNN layer processes the input sequence in forward direction. The output of this layer is taken by an upper RNN layer as input, processed in reverse direction. Formally, following Equation (9), we set d = (\u22121) . This approach can easily build a deeper network with the same number of parameters compared to the classical approach. The final encoder consists of L enc layers and produces the output h Lenc to compute the conditional input c to the decoder.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "Attention Model The alignment model \u03b1 t,j scores how well the output at position t matches the inputs around position j based on", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "s 1 t\u22121 and h Lenc j where h Lenc j", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "is the top-most layer of the encoder at step j and s 1 t\u22121 is the first layer of decoder at step t \u2212 1. It is intuitively beneficial to exploit the information of y t\u22121 when reading from the source sentence representation, which is missing from the implementation of attention-based NMT in . In this work, we build a more effective alignment path by feeding both the previous hidden state s 1 t\u22121 and the context word y t\u22121 to the attention model, inspired by the recent implementation of attention-based NMT 1 . The conditional input c j is a weighted sum of attention score \u03b1 t,j and encoder output h Lenc . Formally, the calculation of c j is", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "c j = t=Lx t=1 \u03b1 t,j h Lenc t (10) where e t,j = v T a \u03c3(W a s 1 t\u22121 + U a h Lenc j + W y y t\u22121 )", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "\u03b1 t,j = softmax(e t,j ).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "(11) \u03c3 is a nonlinear function with the information of y t\u22121 (its word embedding being y t\u22121 ) added. In our preliminary experiments, we found that GRU works slightly better than tanh function, but we chose the latter for simplicity.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "Decoder The decoder follows Equation 9with fixed direction term d = \u22121. At the first layer, we use the following input:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "x t = [c t , y t\u22121 ]", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "where y t\u22121 is the target word embedding at time step t, c t is dynamically obtained follows Equation (10). There are L dec layers of RNNs armed with LAUs in the decoder. At inference stage, we only utilize the top-most hidden states s L dec to make the final prediction with a softmax layer:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "p(y i |y <i , x) = softmax(W o s L dec i )", |
| "eq_num": "(12)" |
| } |
| ], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": ".", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "DEEPLAU", |
| "sec_num": "3.4" |
| }, |
| { |
| "text": "We mainly evaluated our approaches on the widely used NIST Chinese-English translation task. In order to show the usefulness of our approaches, we also provide results on other two translation tasks: English-French, English-German. The evaluation metric is BLEU 2 (Papineni et al., 2002) .", |
| "cite_spans": [ |
| { |
| "start": 264, |
| "end": 287, |
| "text": "(Papineni et al., 2002)", |
| "ref_id": "BIBREF17" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Setup", |
| "sec_num": "4.1" |
| }, |
| { |
| "text": "For Chinese-English, our training data consists of 1.25M sentence pairs extracted from LDC corpora 3 , with 27.9M Chinese words and 34.5M English words respectively. We choose NIST 2002 (MT02) dataset as our development set, and the NIST 2003 (MT03), 2004 (MT04) 2005 (MT05) and 2006 (MT06) datasets as our test sets.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Setup", |
| "sec_num": "4.1" |
| }, |
| { |
| "text": "For English-German, to compare with the results reported by previous work (Luong et al., 2015; Zhou et al., 2016; Jean et al., 2015) , we used the same subset of the WMT 2014 training corpus that contains 4.5M sentence pairs with 91M English words and 87M German words. The concatenation of news-test 2012 and news-test 2013 is used as the validation set and news-test 2014 as the test set.", |
| "cite_spans": [ |
| { |
| "start": 74, |
| "end": 94, |
| "text": "(Luong et al., 2015;", |
| "ref_id": "BIBREF13" |
| }, |
| { |
| "start": 95, |
| "end": 113, |
| "text": "Zhou et al., 2016;", |
| "ref_id": "BIBREF31" |
| }, |
| { |
| "start": 114, |
| "end": 132, |
| "text": "Jean et al., 2015)", |
| "ref_id": "BIBREF9" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Setup", |
| "sec_num": "4.1" |
| }, |
| { |
| "text": "To evaluate at scale, we also report the results of English-French. To compare with the results reported by previous work on end-toend NMT Jean et al., 2015; Luong et al., 2014; Zhou et al., 2016) , we used the same subset of the WMT 2014 training corpus that contains 12M sentence pairs with 304M English words and 348M French words. The concatenation of news-test 2012 and news-test 2013 serves as the validation set and news-test 2014 as the test set.", |
| "cite_spans": [ |
| { |
| "start": 139, |
| "end": 157, |
| "text": "Jean et al., 2015;", |
| "ref_id": "BIBREF9" |
| }, |
| { |
| "start": 158, |
| "end": 177, |
| "text": "Luong et al., 2014;", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 178, |
| "end": 196, |
| "text": "Zhou et al., 2016)", |
| "ref_id": "BIBREF31" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Setup", |
| "sec_num": "4.1" |
| }, |
| { |
| "text": "Our training procedure and hyper parameter choices are similar to those used by . In more details, we limit the source and target vocabularies to the most frequent 30K words in both Chinese-English and English-French. For English-German, we set the source and target vocabularies size to 120K and 80K, respectively.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Training details", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "For all experiments, the dimensions of word embeddings and recurrent hidden states are both set to 512. The dimension of c t is also of size 512. Note that our network is more narrow than most previous work where hidden states of dimmention 1024 is used. we initialize parameters by sampling each element from the Gaussian distribution with mean 0 and variance 0.04 2 .", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Training details", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "Parameter optimization is performed using stochastic gradient descent. 2012) is used to automatically adapt the learning rate of each parameter ( = 10 \u22126 and \u03c1 = 0.95). To avoid gradient explosion, the gradients of the cost function which had 2 norm larger than a predefined threshold \u03c4 were normalized to the threshold (Pascanu et al., 2013a) . We set \u03c4 to 1.0 at the beginning and halve the threshold until the BLEU score does not change much on the development set. Each SGD is a mini-batch of 128 examples. We train our NMT model with the sentences of length up to 80 words in the training data, while for the Moses system we use the full training data. Translations are generated by a beam search and log-likelihood scores are normalized by sentence length. We use a beam width of 10 in all the experiments. Dropout was also applied on the output layer to avoid over-fitting. The dropout rate is set to 0.5. Except when otherwise mentioned, NMT systems are have 4 layers encoders and 4 layers decoders. Table 1 shows BLEU scores on Chinese-English datasets. Clearly DEEPLAU leads to a remarkable improvement over their competitors. Compared to DEEPGRU, DEEPLAU is +4.89 BLEU score higher on average four test sets, showing the modeling power gained from the liner associative connections. We suggest it is because LAUs apply adaptive gate function conditioned on the input which make it able to automatically decide how much linear information should be transferred to the next step.", |
| "cite_spans": [ |
| { |
| "start": 320, |
| "end": 343, |
| "text": "(Pascanu et al., 2013a)", |
| "ref_id": "BIBREF18" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 1008, |
| "end": 1015, |
| "text": "Table 1", |
| "ref_id": "TABREF1" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Training details", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "To show the power of DEEPLAU, we also make a comparison with previous work. Our best single model outperforms both a phrasedbased MT system (Moses) as well as an open source attention-based NMT system (Groundhog) by +7.3 and +6.8 BLEU points respectively on average. The result is also better than some other state-of-the-art variants of attention-based NMT mode with big margins. After PosUnk and ensemble, DEEPLAU seizes another notable gain of +4.38 BLEU and outperform Moses by +11.68 BLEU.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Results on Chinese-English Translation", |
| "sec_num": "4.3" |
| }, |
| { |
| "text": "The results on English-German translation are presented in Table 2 . We compare our NMT systems with various other systems including the winning system in WMT14 (Buck et al., 2014) , a phrase-based system whose language models were trained on a huge monolingual text, the Common Crawl corpus. For end-toend NMT systems, to the best of our knowledge, Wu et al. (2016) is currently the SOTA system and about 4 BLEU points on top of previously best reported results even though Zhou et al. (2016) used a much deeper neural network 4 . Following Wu et al. (2016) , the BLEU score represents the averaged score of 8 models we trained. Our approach achieves comparable results with SOTA system. As can be seen from the Table 2 , DeepLAU performs better than the word based model and even not much worse than the best wordpiece models achieved by Wu et al. (2016) ple and easy to implement, as opposed to previous models reported in Wu et al. (2016) , which dependends on some external techniques to achieve their best performance, such as their introduction of length normalization, coverage penalty, fine-tuning and the RL-refined model.", |
| "cite_spans": [ |
| { |
| "start": 161, |
| "end": 180, |
| "text": "(Buck et al., 2014)", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 350, |
| "end": 366, |
| "text": "Wu et al. (2016)", |
| "ref_id": "BIBREF26" |
| }, |
| { |
| "start": 475, |
| "end": 493, |
| "text": "Zhou et al. (2016)", |
| "ref_id": "BIBREF31" |
| }, |
| { |
| "start": 542, |
| "end": 558, |
| "text": "Wu et al. (2016)", |
| "ref_id": "BIBREF26" |
| }, |
| { |
| "start": 840, |
| "end": 856, |
| "text": "Wu et al. (2016)", |
| "ref_id": "BIBREF26" |
| }, |
| { |
| "start": 926, |
| "end": 942, |
| "text": "Wu et al. (2016)", |
| "ref_id": "BIBREF26" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 59, |
| "end": 66, |
| "text": "Table 2", |
| "ref_id": "TABREF3" |
| }, |
| { |
| "start": 713, |
| "end": 720, |
| "text": "Table 2", |
| "ref_id": "TABREF3" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Results on English-German Translation", |
| "sec_num": "4.4" |
| }, |
| { |
| "text": "SYSTEM BLEU Enc-Dec (Luong et al., 2014) 30.4 RNNsearch 28.5 RNNsearch-LV (Jean et al., 2015) 32.7 Deep-Att (Zhou et al., 2016) 35.9 DEEPLAU 35.1 Table 3 : English-to-French task: BLEU scores of single neural models.", |
| "cite_spans": [ |
| { |
| "start": 20, |
| "end": 40, |
| "text": "(Luong et al., 2014)", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 74, |
| "end": 93, |
| "text": "(Jean et al., 2015)", |
| "ref_id": "BIBREF9" |
| }, |
| { |
| "start": 108, |
| "end": 127, |
| "text": "(Zhou et al., 2016)", |
| "ref_id": "BIBREF31" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 146, |
| "end": 153, |
| "text": "Table 3", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Results on English-French Translation", |
| "sec_num": "4.5" |
| }, |
| { |
| "text": "To evaluate at scale, we also show the results on an English-French task with 12M sentence pairs and 30K vocabulary in Table 3 . Luong et al. (2014) achieves BLEU score of 30.4 with a six layers deep Encoder-Decoder model. The two attention models, RNNSearch and RNNsearch-LV achieve BLEU scores of 28.5 and 32.7 respectively. The previous best single NMT Deep-Att model with an 18 layers encoder and 7 layers decoder achieves BLEU score of 35.9. For DEEPLAU, we obtain the BLEU score of 35.1 with a 4 layers encoder and 4 layers decoder, which is on par with the SOTA system in terms of BLEU. Note that Zhou et al. (2016) utilize a much larger depth as well as external alignment model and extensive regularization to achieve their best results.", |
| "cite_spans": [ |
| { |
| "start": 129, |
| "end": 148, |
| "text": "Luong et al. (2014)", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 604, |
| "end": 622, |
| "text": "Zhou et al. (2016)", |
| "ref_id": "BIBREF31" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 119, |
| "end": 126, |
| "text": "Table 3", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Results on English-French Translation", |
| "sec_num": "4.5" |
| }, |
| { |
| "text": "Then we will study the main factors that influence our results on NIST Chinese-English translation task. We also compare our approach with two SOTA topologies which were used in building deep NMT systems.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Analysis", |
| "sec_num": "4.6" |
| }, |
| { |
| "text": "\u2022 Residual Networks (ResNet) are among the pioneering works (Szegedy et al., 2016; He et al., 2016) that utilize extra identity connections to enhance information flow such that very deep neural networks can be effectively optimized. Share the similar idea, Wu et al. (2016) introduced to leverage residual connections to train deep RNNs.", |
| "cite_spans": [ |
| { |
| "start": 60, |
| "end": 82, |
| "text": "(Szegedy et al., 2016;", |
| "ref_id": "BIBREF23" |
| }, |
| { |
| "start": 83, |
| "end": 99, |
| "text": "He et al., 2016)", |
| "ref_id": "BIBREF7" |
| }, |
| { |
| "start": 258, |
| "end": 274, |
| "text": "Wu et al. (2016)", |
| "ref_id": "BIBREF26" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Analysis", |
| "sec_num": "4.6" |
| }, |
| { |
| "text": "\u2022 Fast Forward (F-F) connections were proposed to reduce the propagation path length which is the pioneer work to simplify the training of deep NMT model (Zhou et al., 2016) . The work can be viewed as a parametric ResNet with short cut connections between adjacent layers. The procedure takes a linear sum between the input and the newly computed state. Table 4 : BLEU scores of DEEPLAU and DEEPGRU with different model sizes. the average BLEU scores achieved by DEEP-GRU and DEEPLAU are 34.68 and 37.65, respectively. LAU can bring an improvement of 2.97 in terms of BLEU. After increasing the model depth to 4 (row 4 and row 6), the improvement is enlarged to 4.91. When DEEP-GRU is trained with larger depth (say, 4), the training becomes more difficult and the performance falls behind its shallow partner. While for DEEPLAU, as can be see in row 9, with increasing the depth even to L Enc = 8 and L Dec = 6 we can still obtain growth by 0.04 BLEU score. Compared to previous shortcut connection methods (row 5 and row 6), The LAU still achieve meaningful improvements over F-F connections and Residual connections by +1.35 and +2.57 BLEU points respectively.", |
| "cite_spans": [ |
| { |
| "start": 154, |
| "end": 173, |
| "text": "(Zhou et al., 2016)", |
| "ref_id": "BIBREF31" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 355, |
| "end": 362, |
| "text": "Table 4", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Analysis", |
| "sec_num": "4.6" |
| }, |
| { |
| "text": "DEEPLAU introduces more parameters than DEEPGRU. In order to figure out the effect of DEEPLAU comparing models with the same parameter size, we increase the hidden size of DEEPGRU model. Row 3 shows that, after using a twice larger GRU layer, the BLEU score is 34.68, which is still worse than the corresponding DEEPLAU model with fewer parameters.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LAU vs. GRU", |
| "sec_num": null |
| }, |
| { |
| "text": "Depth vs. Width Next we will study the model size. In Table 4 , starting from L Enc = 2 and L Dec = 2 and gradually increasing the model depth, we can achieve substantial improvements in terms of BLEU. With L Enc = 8 and L Dec = 6, our DEEPLAU model yields the best BLEU score. We tried to increase the model depth with the same hidden size but failed to see further improvements.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 54, |
| "end": 61, |
| "text": "Table 4", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "LAU vs. GRU", |
| "sec_num": null |
| }, |
| { |
| "text": "We then tried to increase the hidden size. By comparing row 2 and row 3, we find the improvements is relative small with a wider hidden size. It is also worth mentioning that a deep and thin network with fewer parameters can still achieve comparable results with its shallow partner. This suggests that depth plays a more important role in increasing the complexity of neural networks than width and our deliberately designed LAU benefit from the optimizing of such a deep model. Figure 2 : The BLEU scores of generated translations on the merged four test sets with respect to the lengths of source sentences.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 480, |
| "end": 488, |
| "text": "Figure 2", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "LAU vs. GRU", |
| "sec_num": null |
| }, |
| { |
| "text": "About Length A more detailed comparison between DEEPLAU (4 layers encoder and 4 layers decoder), DEEPLAU(2 layer encoder and 2 layer decoder) and DEEPGRU (4 layers encoder and 4 layers decoder), suggest that with deep architectures are essential to the superior performance of our system. In particular, we test the BLEU scores on sentences longer than {10, 20, 30, 40, 50, 60} on the merged test set. Clearly, in all curves, performance degrades with increased sentence length. However, DEEPLAU models yield consistently higher BLEU scores than the DEEPGRU model on longer sentences. These observations are consistent with our intuition that very deep RNN model is especially good at modeling the nested latent structures on relatively complicated sentences and LAU plays an important role on optimizing such a complex deep model.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LAU vs. GRU", |
| "sec_num": null |
| }, |
| { |
| "text": "We propose a Linear Associative Unit (LAU) which makes a fusion of both linear and nonlinear transformation inside the recurrent unit. On this way, gradients decay much slower compared to the standard deep networks which enable us to build a deep neural network for machine translation. Our empirical study shows that it can significantly improve the performance of NMT.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "5" |
| }, |
| { |
| "text": "We sincerely thank the anonymous reviewers for their thorough reviewing and valuable suggestions. ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "acknowledge", |
| "sec_num": "6" |
| }, |
| { |
| "text": "github.com/nyu-dl/dl4mt-tutorial/ tree/master/session22 For Chinese-English task, we apply case-insensitive NIST BLEU. For other tasks, we tokenized the reference and evaluated the performance with multi-bleu.pl. The metrics are exactly the same as in previous work.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "The corpora include LDC2002E18, LDC2003E07, LDC2003E14, Hansards portion of LDC2004T07, LDC2004T08 and LDC2005T06.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "It is also worth mentioning that the result reported byZhou et al. (2016) does not include PosUnk, and this comparison is not fair enough.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Neural machine translation by jointly learning to align and translate", |
| "authors": [ |
| { |
| "first": "Dzmitry", |
| "middle": [], |
| "last": "Bahdanau", |
| "suffix": "" |
| }, |
| { |
| "first": "Kyunghyun", |
| "middle": [], |
| "last": "Cho", |
| "suffix": "" |
| }, |
| { |
| "first": "Yoshua", |
| "middle": [], |
| "last": "Bengio", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1409.0473" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. 2014. Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473 .", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "N-gram counts and language models from the common crawl", |
| "authors": [ |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "Buck", |
| "suffix": "" |
| }, |
| { |
| "first": "Kenneth", |
| "middle": [], |
| "last": "Heafield", |
| "suffix": "" |
| }, |
| { |
| "first": "Bas", |
| "middle": [], |
| "last": "Van Ooyen", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "LREC. Citeseer", |
| "volume": "2", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Christian Buck, Kenneth Heafield, and Bas Van Ooyen. 2014. N-gram counts and language models from the common crawl. In LREC. Cite- seer, volume 2, page 4.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "A hierarchical phrase-based model for statistical machine translation", |
| "authors": [ |
| { |
| "first": "David", |
| "middle": [], |
| "last": "Chiang", |
| "suffix": "" |
| } |
| ], |
| "year": 2005, |
| "venue": "Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "263--270", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "David Chiang. 2005. A hierarchical phrase-based model for statistical machine translation. In Pro- ceedings of the 43rd Annual Meeting on Associ- ation for Computational Linguistics. Association for Computational Linguistics, pages 263-270.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Learning phrase representations using rnn encoder-decoder for statistical machine translation", |
| "authors": [ |
| { |
| "first": "Kyunghyun", |
| "middle": [], |
| "last": "Cho", |
| "suffix": "" |
| }, |
| { |
| "first": "Bart", |
| "middle": [], |
| "last": "Van Merri\u00ebnboer", |
| "suffix": "" |
| }, |
| { |
| "first": "Caglar", |
| "middle": [], |
| "last": "Gulcehre", |
| "suffix": "" |
| }, |
| { |
| "first": "Dzmitry", |
| "middle": [], |
| "last": "Bahdanau", |
| "suffix": "" |
| }, |
| { |
| "first": "Fethi", |
| "middle": [], |
| "last": "Bougares", |
| "suffix": "" |
| }, |
| { |
| "first": "Holger", |
| "middle": [], |
| "last": "Schwenk", |
| "suffix": "" |
| }, |
| { |
| "first": "Yoshua", |
| "middle": [], |
| "last": "Bengio", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1406.1078" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kyunghyun Cho, Bart Van Merri\u00ebnboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. 2014. Learning phrase representations using rnn encoder-decoder for statistical machine transla- tion. arXiv preprint arXiv:1406.1078 .", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Generating sequences with recurrent neural networks", |
| "authors": [ |
| { |
| "first": "Alex", |
| "middle": [], |
| "last": "Graves", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1308.0850" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Alex Graves. 2013. Generating sequences with recurrent neural networks. arXiv preprint arXiv:1308.0850 .", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Neural turing machines", |
| "authors": [ |
| { |
| "first": "Alex", |
| "middle": [], |
| "last": "Graves", |
| "suffix": "" |
| }, |
| { |
| "first": "Greg", |
| "middle": [], |
| "last": "Wayne", |
| "suffix": "" |
| }, |
| { |
| "first": "Ivo", |
| "middle": [], |
| "last": "Danihelka", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1410.5401" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Alex Graves, Greg Wayne, and Ivo Danihelka. 2014. Neural turing machines. arXiv preprint arXiv:1410.5401 .", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Deep residual learning for image recognition", |
| "authors": [ |
| { |
| "first": "Kaiming", |
| "middle": [], |
| "last": "He", |
| "suffix": "" |
| }, |
| { |
| "first": "Xiangyu", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Shaoqing", |
| "middle": [], |
| "last": "Ren", |
| "suffix": "" |
| }, |
| { |
| "first": "Jian", |
| "middle": [], |
| "last": "Sun", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1512.03385" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. 2015. Deep residual learning for image recognition. arXiv preprint arXiv:1512.03385 .", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "Deep residual learning for image recognition", |
| "authors": [ |
| { |
| "first": "Kaiming", |
| "middle": [], |
| "last": "He", |
| "suffix": "" |
| }, |
| { |
| "first": "Xiangyu", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Shaoqing", |
| "middle": [], |
| "last": "Ren", |
| "suffix": "" |
| }, |
| { |
| "first": "Jian", |
| "middle": [], |
| "last": "Sun", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition", |
| "volume": "", |
| "issue": "", |
| "pages": "770--778", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. 2016. Deep residual learning for image recognition. In Proceedings of the IEEE Confer- ence on Computer Vision and Pattern Recogni- tion. pages 770-778.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Long short-term memory", |
| "authors": [ |
| { |
| "first": "Sepp", |
| "middle": [], |
| "last": "Hochreiter", |
| "suffix": "" |
| }, |
| { |
| "first": "J\u00fcrgen", |
| "middle": [], |
| "last": "Schmidhuber", |
| "suffix": "" |
| } |
| ], |
| "year": 1997, |
| "venue": "Neural computation", |
| "volume": "9", |
| "issue": "8", |
| "pages": "1735--1780", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural computation 9(8):1735-1780.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "On using very large target vocabulary for neural machine translation", |
| "authors": [ |
| { |
| "first": "S\u00e9bastien", |
| "middle": [], |
| "last": "Jean", |
| "suffix": "" |
| }, |
| { |
| "first": "Kyunghyun", |
| "middle": [], |
| "last": "Cho", |
| "suffix": "" |
| }, |
| { |
| "first": "Roland", |
| "middle": [], |
| "last": "Memisevic", |
| "suffix": "" |
| }, |
| { |
| "first": "Yoshua", |
| "middle": [], |
| "last": "Bengio", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "1--10", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "S\u00e9bastien Jean, Kyunghyun Cho, Roland Memise- vic, and Yoshua Bengio. 2015. On using very large target vocabulary for neural machine trans- lation. In Proceedings of the 53rd Annual Meet- ing of the Association for Computational Lin- guistics and the 7th International Joint Con- ference on Natural Language Processing (Vol- ume 1: Long Papers). Association for Compu- tational Linguistics, Beijing, China, pages 1-10. http://www.aclweb.org/anthology/P15-1001.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Grid long short-term memory", |
| "authors": [ |
| { |
| "first": "Nal", |
| "middle": [], |
| "last": "Kalchbrenner", |
| "suffix": "" |
| }, |
| { |
| "first": "Ivo", |
| "middle": [], |
| "last": "Danihelka", |
| "suffix": "" |
| }, |
| { |
| "first": "Alex", |
| "middle": [], |
| "last": "Graves", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1507.01526" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nal Kalchbrenner, Ivo Danihelka, and Alex Graves. 2015. Grid long short-term memory. arXiv preprint arXiv:1507.01526 .", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "Statistical phrase-based translation", |
| "authors": [ |
| { |
| "first": "Philipp", |
| "middle": [], |
| "last": "Koehn", |
| "suffix": "" |
| }, |
| { |
| "first": "Franz", |
| "middle": [ |
| "Josef" |
| ], |
| "last": "Och", |
| "suffix": "" |
| }, |
| { |
| "first": "Daniel", |
| "middle": [], |
| "last": "Marcu", |
| "suffix": "" |
| } |
| ], |
| "year": 2003, |
| "venue": "Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology", |
| "volume": "1", |
| "issue": "", |
| "pages": "48--54", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Philipp Koehn, Franz Josef Och, and Daniel Marcu. 2003. Statistical phrase-based translation. In Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology-Volume 1. Association for Computa- tional Linguistics, pages 48-54.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Treeto-string alignment template for statistical machine translation", |
| "authors": [ |
| { |
| "first": "Yang", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| }, |
| { |
| "first": "Qun", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| }, |
| { |
| "first": "Shouxun", |
| "middle": [], |
| "last": "Lin", |
| "suffix": "" |
| } |
| ], |
| "year": 2006, |
| "venue": "Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics. Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "609--616", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Yang Liu, Qun Liu, and Shouxun Lin. 2006. Tree- to-string alignment template for statistical ma- chine translation. In Proceedings of the 21st International Conference on Computational Lin- guistics and the 44th annual meeting of the As- sociation for Computational Linguistics. Associ- ation for Computational Linguistics, pages 609- 616.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Effective approaches to attention-based neural machine translation", |
| "authors": [ |
| { |
| "first": "Minh-Thang", |
| "middle": [], |
| "last": "Luong", |
| "suffix": "" |
| }, |
| { |
| "first": "Hieu", |
| "middle": [], |
| "last": "Pham", |
| "suffix": "" |
| }, |
| { |
| "first": "Christopher D", |
| "middle": [], |
| "last": "Manning", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1508.04025" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Minh-Thang Luong, Hieu Pham, and Christo- pher D Manning. 2015. Effective approaches to attention-based neural machine translation. arXiv preprint arXiv:1508.04025 .", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "Addressing the rare word problem in neural machine translation", |
| "authors": [ |
| { |
| "first": "Minh-Thang", |
| "middle": [], |
| "last": "Luong", |
| "suffix": "" |
| }, |
| { |
| "first": "Ilya", |
| "middle": [], |
| "last": "Sutskever", |
| "suffix": "" |
| }, |
| { |
| "first": "V", |
| "middle": [], |
| "last": "Quoc", |
| "suffix": "" |
| }, |
| { |
| "first": "Oriol", |
| "middle": [], |
| "last": "Le", |
| "suffix": "" |
| }, |
| { |
| "first": "Wojciech", |
| "middle": [], |
| "last": "Vinyals", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Zaremba", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1410.8206" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Minh-Thang Luong, Ilya Sutskever, Quoc V Le, Oriol Vinyals, and Wojciech Zaremba. 2014. Addressing the rare word problem in neural machine translation. arXiv preprint arXiv:1410.8206 .", |
| "links": null |
| }, |
| "BIBREF15": { |
| "ref_id": "b15", |
| "title": "Neural transformation machine: A new architecture for sequenceto-sequence learning", |
| "authors": [ |
| { |
| "first": "Fandong", |
| "middle": [], |
| "last": "Meng", |
| "suffix": "" |
| }, |
| { |
| "first": "Zhengdong", |
| "middle": [], |
| "last": "Lu", |
| "suffix": "" |
| }, |
| { |
| "first": "Zhaopeng", |
| "middle": [], |
| "last": "Tu", |
| "suffix": "" |
| }, |
| { |
| "first": "Hang", |
| "middle": [], |
| "last": "Li", |
| "suffix": "" |
| }, |
| { |
| "first": "Qun", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Fandong Meng, Zhengdong Lu, Zhaopeng Tu, Hang Li, and Qun Liu. 2015. Neural transforma- tion machine: A new architecture for sequence- to-sequence learning. CoRR abs/1506.06442. http://arxiv.org/abs/1506.06442.", |
| "links": null |
| }, |
| "BIBREF16": { |
| "ref_id": "b16", |
| "title": "Forest-based translation", |
| "authors": [ |
| { |
| "first": "Haitao", |
| "middle": [], |
| "last": "Mi", |
| "suffix": "" |
| }, |
| { |
| "first": "Liang", |
| "middle": [], |
| "last": "Huang", |
| "suffix": "" |
| }, |
| { |
| "first": "Qun", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| } |
| ], |
| "year": 2008, |
| "venue": "ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "192--199", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Haitao Mi, Liang Huang, and Qun Liu. 2008. Forest-based translation. In ACL. pages 192- 199.", |
| "links": null |
| }, |
| "BIBREF17": { |
| "ref_id": "b17", |
| "title": "Bleu: a method for automatic evaluation of machine translation", |
| "authors": [ |
| { |
| "first": "Kishore", |
| "middle": [], |
| "last": "Papineni", |
| "suffix": "" |
| }, |
| { |
| "first": "Salim", |
| "middle": [], |
| "last": "Roukos", |
| "suffix": "" |
| }, |
| { |
| "first": "Todd", |
| "middle": [], |
| "last": "Ward", |
| "suffix": "" |
| }, |
| { |
| "first": "Wei-Jing", |
| "middle": [], |
| "last": "Zhu", |
| "suffix": "" |
| } |
| ], |
| "year": 2002, |
| "venue": "Proceedings of the 40th annual meeting on association for computational linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "311--318", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kishore Papineni, Salim Roukos, Todd Ward, and Wei-Jing Zhu. 2002. Bleu: a method for auto- matic evaluation of machine translation. In Pro- ceedings of the 40th annual meeting on associ- ation for computational linguistics. Association for Computational Linguistics, pages 311-318.", |
| "links": null |
| }, |
| "BIBREF18": { |
| "ref_id": "b18", |
| "title": "How to construct deep recurrent neural networks", |
| "authors": [ |
| { |
| "first": "Razvan", |
| "middle": [], |
| "last": "Pascanu", |
| "suffix": "" |
| }, |
| { |
| "first": "Caglar", |
| "middle": [], |
| "last": "Gulcehre", |
| "suffix": "" |
| }, |
| { |
| "first": "Kyunghyun", |
| "middle": [], |
| "last": "Cho", |
| "suffix": "" |
| }, |
| { |
| "first": "Yoshua", |
| "middle": [], |
| "last": "Bengio", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1312.6026" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Razvan Pascanu, Caglar Gulcehre, Kyunghyun Cho, and Yoshua Bengio. 2013a. How to con- struct deep recurrent neural networks. arXiv preprint arXiv:1312.6026 .", |
| "links": null |
| }, |
| "BIBREF19": { |
| "ref_id": "b19", |
| "title": "On the difficulty of training recurrent neural networks", |
| "authors": [ |
| { |
| "first": "Razvan", |
| "middle": [], |
| "last": "Pascanu", |
| "suffix": "" |
| }, |
| { |
| "first": "Tomas", |
| "middle": [], |
| "last": "Mikolov", |
| "suffix": "" |
| }, |
| { |
| "first": "Yoshua", |
| "middle": [], |
| "last": "Bengio", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "ICML", |
| "volume": "28", |
| "issue": "3", |
| "pages": "1310--1318", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Razvan Pascanu, Tomas Mikolov, and Yoshua Ben- gio. 2013b. On the difficulty of training recur- rent neural networks. ICML (3) 28:1310-1318.", |
| "links": null |
| }, |
| "BIBREF20": { |
| "ref_id": "b20", |
| "title": "Minimum risk training for neural machine translation", |
| "authors": [ |
| { |
| "first": "Shiqi", |
| "middle": [], |
| "last": "Shen", |
| "suffix": "" |
| }, |
| { |
| "first": "Yong", |
| "middle": [], |
| "last": "Cheng", |
| "suffix": "" |
| }, |
| { |
| "first": "Zhongjun", |
| "middle": [], |
| "last": "He", |
| "suffix": "" |
| }, |
| { |
| "first": "Wei", |
| "middle": [], |
| "last": "He", |
| "suffix": "" |
| }, |
| { |
| "first": "Hua", |
| "middle": [], |
| "last": "Wu", |
| "suffix": "" |
| }, |
| { |
| "first": "Maosong", |
| "middle": [], |
| "last": "Sun", |
| "suffix": "" |
| }, |
| { |
| "first": "Yang", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1512.02433" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Shiqi Shen, Yong Cheng, Zhongjun He, Wei He, Hua Wu, Maosong Sun, and Yang Liu. 2015. Minimum risk training for neural machine trans- lation. arXiv preprint arXiv:1512.02433 .", |
| "links": null |
| }, |
| "BIBREF21": { |
| "ref_id": "b21", |
| "title": "Training very deep networks", |
| "authors": [ |
| { |
| "first": "K", |
| "middle": [], |
| "last": "Rupesh", |
| "suffix": "" |
| }, |
| { |
| "first": "Klaus", |
| "middle": [], |
| "last": "Srivastava", |
| "suffix": "" |
| }, |
| { |
| "first": "J\u00fcrgen", |
| "middle": [], |
| "last": "Greff", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Schmidhuber", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Advances in neural information processing systems", |
| "volume": "", |
| "issue": "", |
| "pages": "2377--2385", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Rupesh K Srivastava, Klaus Greff, and J\u00fcrgen Schmidhuber. 2015. Training very deep net- works. In Advances in neural information pro- cessing systems. pages 2377-2385.", |
| "links": null |
| }, |
| "BIBREF22": { |
| "ref_id": "b22", |
| "title": "Sequence to sequence learning with neural networks", |
| "authors": [ |
| { |
| "first": "Ilya", |
| "middle": [], |
| "last": "Sutskever", |
| "suffix": "" |
| }, |
| { |
| "first": "Oriol", |
| "middle": [], |
| "last": "Vinyals", |
| "suffix": "" |
| }, |
| { |
| "first": "Quoc V", |
| "middle": [], |
| "last": "Le", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Advances in neural information processing systems", |
| "volume": "", |
| "issue": "", |
| "pages": "3104--3112", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. 2014. Sequence to sequence learning with neu- ral networks. In Advances in neural information processing systems. pages 3104-3112.", |
| "links": null |
| }, |
| "BIBREF23": { |
| "ref_id": "b23", |
| "title": "Inception-v4, inception-resnet and the impact of residual connections on learning", |
| "authors": [ |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "Szegedy", |
| "suffix": "" |
| }, |
| { |
| "first": "Sergey", |
| "middle": [], |
| "last": "Ioffe", |
| "suffix": "" |
| }, |
| { |
| "first": "Vincent", |
| "middle": [], |
| "last": "Vanhoucke", |
| "suffix": "" |
| }, |
| { |
| "first": "Alex", |
| "middle": [], |
| "last": "Alemi", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1602.07261" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Christian Szegedy, Sergey Ioffe, Vincent Van- houcke, and Alex Alemi. 2016. Inception- v4, inception-resnet and the impact of resid- ual connections on learning. arXiv preprint arXiv:1602.07261 .", |
| "links": null |
| }, |
| "BIBREF24": { |
| "ref_id": "b24", |
| "title": "Modeling coverage for neural machine translation", |
| "authors": [ |
| { |
| "first": "Zhaopeng", |
| "middle": [], |
| "last": "Tu", |
| "suffix": "" |
| }, |
| { |
| "first": "Zhengdong", |
| "middle": [], |
| "last": "Lu", |
| "suffix": "" |
| }, |
| { |
| "first": "Yang", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| }, |
| { |
| "first": "Xiaohua", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| }, |
| { |
| "first": "Hang", |
| "middle": [], |
| "last": "Li", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "ArXiv eprints", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Zhaopeng Tu, Zhengdong Lu, Yang Liu, Xiaohua Liu, and Hang Li. 2016. Modeling coverage for neural machine translation. ArXiv eprints, Janu- ary .", |
| "links": null |
| }, |
| "BIBREF25": { |
| "ref_id": "b25", |
| "title": "A learning algorithm for continually running fully recurrent neural networks", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Ronald", |
| "suffix": "" |
| }, |
| { |
| "first": "David", |
| "middle": [], |
| "last": "Williams", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Zipser", |
| "suffix": "" |
| } |
| ], |
| "year": 1989, |
| "venue": "Neural computation", |
| "volume": "1", |
| "issue": "2", |
| "pages": "270--280", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ronald J Williams and David Zipser. 1989. A learning algorithm for continually running fully recurrent neural networks. Neural computation 1(2):270-280.", |
| "links": null |
| }, |
| "BIBREF26": { |
| "ref_id": "b26", |
| "title": "Google's neural machine translation system: Bridging the gap between human and machine translation", |
| "authors": [ |
| { |
| "first": "Yonghui", |
| "middle": [], |
| "last": "Wu", |
| "suffix": "" |
| }, |
| { |
| "first": "Mike", |
| "middle": [], |
| "last": "Schuster", |
| "suffix": "" |
| }, |
| { |
| "first": "Zhifeng", |
| "middle": [], |
| "last": "Chen", |
| "suffix": "" |
| }, |
| { |
| "first": "V", |
| "middle": [], |
| "last": "Quoc", |
| "suffix": "" |
| }, |
| { |
| "first": "Mohammad", |
| "middle": [], |
| "last": "Le", |
| "suffix": "" |
| }, |
| { |
| "first": "Wolfgang", |
| "middle": [], |
| "last": "Norouzi", |
| "suffix": "" |
| }, |
| { |
| "first": "Maxim", |
| "middle": [], |
| "last": "Macherey", |
| "suffix": "" |
| }, |
| { |
| "first": "Yuan", |
| "middle": [], |
| "last": "Krikun", |
| "suffix": "" |
| }, |
| { |
| "first": "Qin", |
| "middle": [], |
| "last": "Cao", |
| "suffix": "" |
| }, |
| { |
| "first": "Klaus", |
| "middle": [], |
| "last": "Gao", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Macherey", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1609.08144" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Yonghui Wu, Mike Schuster, Zhifeng Chen, Quoc V Le, Mohammad Norouzi, Wolfgang Macherey, Maxim Krikun, Yuan Cao, Qin Gao, Klaus Macherey, et al. 2016. Google's neural machine translation system: Bridging the gap between human and machine translation. arXiv preprint arXiv:1609.08144 .", |
| "links": null |
| }, |
| "BIBREF27": { |
| "ref_id": "b27", |
| "title": "Maximum entropy based phrase reordering model for statistical machine translation", |
| "authors": [ |
| { |
| "first": "Deyi", |
| "middle": [], |
| "last": "Xiong", |
| "suffix": "" |
| }, |
| { |
| "first": "Qun", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| }, |
| { |
| "first": "Shouxun", |
| "middle": [], |
| "last": "Lin", |
| "suffix": "" |
| } |
| ], |
| "year": 2006, |
| "venue": "Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics. Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "521--528", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Deyi Xiong, Qun Liu, and Shouxun Lin. 2006. Maximum entropy based phrase reordering model for statistical machine translation. In Pro- ceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics. Association for Computational Lin- guistics, pages 521-528.", |
| "links": null |
| }, |
| "BIBREF28": { |
| "ref_id": "b28", |
| "title": "Adadelta: an adaptive learning rate method", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Matthew", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Zeiler", |
| "suffix": "" |
| } |
| ], |
| "year": 2012, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1212.5701" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Matthew D Zeiler. 2012. Adadelta: an adap- tive learning rate method. arXiv preprint arXiv:1212.5701 .", |
| "links": null |
| }, |
| "BIBREF29": { |
| "ref_id": "b29", |
| "title": "Variational neural machine translation", |
| "authors": [ |
| { |
| "first": "Biao", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Deyi", |
| "middle": [], |
| "last": "Xiong", |
| "suffix": "" |
| }, |
| { |
| "first": "Jinsong", |
| "middle": [], |
| "last": "Su", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1605.07869" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Biao Zhang, Deyi Xiong, and Jinsong Su. 2016. Variational neural machine translation. arXiv preprint arXiv:1605.07869 .", |
| "links": null |
| }, |
| "BIBREF30": { |
| "ref_id": "b30", |
| "title": "Exploiting source-side monolingual data in neural machine translation", |
| "authors": [ |
| { |
| "first": "Jiajun", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Chengqing", |
| "middle": [], |
| "last": "Zong", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "Proceedings of EMNLP", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Jiajun Zhang and Chengqing Zong. 2016. Exploit- ing source-side monolingual data in neural ma- chine translation. In Proceedings of EMNLP.", |
| "links": null |
| }, |
| "BIBREF31": { |
| "ref_id": "b31", |
| "title": "Deep recurrent models with fastforward connections for neural machine translation", |
| "authors": [ |
| { |
| "first": "Jie", |
| "middle": [], |
| "last": "Zhou", |
| "suffix": "" |
| }, |
| { |
| "first": "Ying", |
| "middle": [], |
| "last": "Cao", |
| "suffix": "" |
| }, |
| { |
| "first": "Xuguang", |
| "middle": [], |
| "last": "Wang", |
| "suffix": "" |
| }, |
| { |
| "first": "Peng", |
| "middle": [], |
| "last": "Li", |
| "suffix": "" |
| }, |
| { |
| "first": "Wei", |
| "middle": [], |
| "last": "Xu", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1606.04199" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Jie Zhou, Ying Cao, Xuguang Wang, Peng Li, and Wei Xu. 2016. Deep recurrent models with fast- forward connections for neural machine transla- tion. arXiv preprint arXiv:1606.04199 .", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "uris": null, |
| "text": "EncoderDecoderFigure 1: DEEPLAU: a neural machine translation model with deep encoder and decoder. Graves et al. (2013) explored the advantages of deep RNNs for handwriting recognition and text generation. There are multiple ways of combining one layer of RNN with another. Pascanu et al. (2013a) introduced Deep Transition RNNs with Skip connections (DT(S)-RNNs).", |
| "type_str": "figure", |
| "num": null |
| }, |
| "TABREF0": { |
| "type_str": "table", |
| "content": "<table/>", |
| "html": null, |
| "text": "as input, a standard RNN computes the sequence hidden states h = {h 1 , h 2 , \u2022 \u2022 \u2022 , h T } by iterating the following equation from t = 1 to t = T :", |
| "num": null |
| }, |
| "TABREF1": { |
| "type_str": "table", |
| "content": "<table><tr><td>Adadelta (Zeiler,</td></tr></table>", |
| "html": null, |
| "text": "33.48 30.75 30.85 31.67 Groundhog 31.92 34.09 31.56 31.12 32.17 COVERAGE 34.49 38.34 34.91 34.25 35.49 MEMDEC 36.16 39.81 35.91 35.98 36.95 Our deep NMT systems DEEPGRU 33.21 36.76 33.05 33.30 34.08 DEEPLAU 39.35 41.15 38.07 37.29 38.97 DEEPLAU +Ensemble + PosUnk 42.21 43.85 44.75 42.58 43.35 Case-insensitive BLEU scores on Chinese-English translation.", |
| "num": null |
| }, |
| "TABREF2": { |
| "type_str": "table", |
| "content": "<table><tr><td>SYSTEM</td><td>Architecture</td><td>Voc.</td><td>BLEU</td></tr><tr><td/><td>Existing systems</td><td/><td/></tr><tr><td>Buck et al. (2014)</td><td>Winning WMT14 system phrase-based + large LM</td><td>-</td><td>20.7</td></tr><tr><td>Jean et al. (2015)</td><td>gated RNN with search + LV + PosUnk</td><td>500K</td><td>19.4</td></tr><tr><td/><td/><td>80K</td><td>20.9</td></tr><tr><td>Shen et al. (2015)</td><td>gated RNN with search + PosUnk + MRT</td><td>80K</td><td>20.5</td></tr><tr><td>Zhou et al. (2016)</td><td>LSTM with 16 layers + F-F connections</td><td>80K</td><td>20.6</td></tr><tr><td>Wu et al. (2016)</td><td>LSTM with 8 laysrs + RL-refined Word</td><td>80K</td><td>23.1</td></tr><tr><td>Wu et al. (2016)</td><td>LSTM with 8 laysrs + RL-refined WPM-32K</td><td>-</td><td>24.6</td></tr><tr><td>Wu et al. (2016)</td><td>LSTM with 8 laysrs + RL-refined WPM-32K + Ensemble</td><td>-</td><td>26.3</td></tr><tr><td/><td>Our deep NMT systems</td><td/><td/></tr><tr><td>this work</td><td>DEEPLAU</td><td colspan=\"2\">80K 22.1(\u00b10.3)</td></tr><tr><td>this work</td><td>DEEPLAU + PosUnk</td><td colspan=\"2\">80K 23.8(\u00b10.3)</td></tr><tr><td>this work</td><td>DEEPLAU + PosUnk + Ensemble 8 models</td><td>80K</td><td>26.1</td></tr><tr><td/><td colspan=\"3\">. Note that DEEPLAU are sim-</td></tr></table>", |
| "html": null, |
| "text": "Luong et al. (2015) LSTM with 4 layers + dropout + local att. + PosUnk", |
| "num": null |
| }, |
| "TABREF3": { |
| "type_str": "table", |
| "content": "<table/>", |
| "html": null, |
| "text": "Case-sensitive BLEU scores on German-English translation.", |
| "num": null |
| }, |
| "TABREF4": { |
| "type_str": "table", |
| "content": "<table><tr><td>1 DEEPGRU</td><td>(2,1)</td><td>512</td><td>33.59</td></tr><tr><td>2 DEEPGRU</td><td>(2,2)</td><td colspan=\"2\">1024 34.68</td></tr><tr><td>3 DEEPGRU</td><td>(2,2)</td><td>512</td><td>34.91</td></tr><tr><td>4 DEEPGRU</td><td>(4,4)</td><td>512</td><td>34.08</td></tr><tr><td>5 4+ResNet</td><td>(4,4)</td><td>512</td><td>36.40</td></tr><tr><td>6 4+F-F</td><td>(4,4)</td><td>512</td><td>37.62</td></tr><tr><td>7 DEEPLAU</td><td>(2,2)</td><td>512</td><td>37.65</td></tr><tr><td>8 DEEPLAU</td><td>(4,4)</td><td>512</td><td>38.97</td></tr><tr><td>9 DEEPLAU</td><td>(8,6)</td><td>512</td><td>39.01</td></tr><tr><td>10 DEEPLAU</td><td>(8,6)</td><td>256</td><td>38.91</td></tr></table>", |
| "html": null, |
| "text": "Table 4shows the effect of the novel LAU. By comparing row 3 to row 7, we see that when L Enc and L Dec are set to 2, SYSTEM (L enc ,L Dec ) width AVE.", |
| "num": null |
| }, |
| "TABREF5": { |
| "type_str": "table", |
| "content": "<table/>", |
| "html": null, |
| "text": "Wang's work is partially supported by National Science Foundation for Deep Semantics Based Uighur to Chinese Machine Translation (ID 61662077). Qun Liu's work is partially supported by Science Foundation Ireland in the ADAPT Centre for Digital Content Technology (www.adaptcentre.ie) at Dublin City University funded under the SFI Research Centres Programme (Grant 13/RC/2106) cofunded under the European Regional Development Fund.", |
| "num": null |
| } |
| } |
| } |
| } |
