GORU-tensorflow
Gated Orthogonal Recurrent Unit implementation in tensorflow
view repo
We present a novel recurrent neural network (RNN) based model that combines the remembering ability of unitary RNNs with the ability of gated RNNs to effectively forget redundant/irrelevant information in its memory. We achieve this by extending unitary RNNs with a gating mechanism. Our model is able to outperform LSTMs, GRUs and Unitary RNNs on several long-term dependency benchmark tasks. We empirically both show the orthogonal/unitary RNNs lack the ability to forget and also the ability of GORU to simultaneously remember long term dependencies while forgetting irrelevant information. This plays an important role in recurrent neural networks. We provide competitive results along with an analysis of our model on many natural sequential tasks including the bAbI Question Answering, TIMIT speech spectrum prediction, Penn TreeBank, and synthetic tasks that involve long-term dependencies such as algorithmic, parenthesis, denoising and copying tasks.
READ FULL TEXT VIEW PDF
Recurrent neural networks (RNNs) are capable of learning features and lo...
read it
Although RNNs have been shown to be powerful tools for processing sequen...
read it
This paper proposes a novel framework for recurrent neural networks (RNN...
read it
A key attribute that drives the unprecedented success of modern Recurren...
read it
Learning long-term dependencies still remains difficult for recurrent ne...
read it
The key attribute that drives the unprecedented success of modern Recurr...
read it
In this paper, we study novel neural network structures to better model ...
read it
Gated Orthogonal Recurrent Unit implementation in tensorflow
Unitary RNN models implementation in PyTorch: EURNN and GORU
Recurrent Neural Networks with gating units — such as Long Short Term Memory (LSTMs)
[Hochreiter and Schmidhuber1997, Gers2001]and Gated Recurrent Units (GRUs)
[Cho et al.2014b]— have led to rapid progress in different areas of machine learning such as language modeling
[Graves, Wayne, and Danihelka2014][Cho et al.2014b, Sutskever, Vinyals, and Le2014], and speech recognition [Chan et al.2016, Chorowski et al.2015]. These works have proven the importance of gating units for Recurrent Neural Networks.The main advantage of using these gated units in RNNs is primarily due to the ease of optimization of the models using them and to reduce the learning degeneracies such as vanishing gradients that can cripple conventional RNNs [Pascanu, Mikolov, and Bengio2013]. Most importantly, by designing special gates, it is easier to impose a particular behavior on the model, such as creating shortcut connections through time by using input and forget gates in LSTMs and resetting the memory via the reset gate of a GRU. This feature also brings modularity to the neural network design that seems to make training of those models easier. Gated RNNs are also empirically shown to achieve better results for a wide variety of real-world tasks.
Recently, using unitary and orthogonal matrices (instead of general matrices) in RNNs [Arjovsky, Shah, and Bengio2016, Jing et al.2016, Henaff, Szlam, and LeCun2016] have attracted an increasing amount of attention in the machine learning community. This trend was following the demonstration that these matrices can be effective in solving tasks involving long-term dependencies and gradients vanishing/exploding [Bengio, Simard, and Frasconi1994, Hochreiter1991] problem. Thus a unitary/orthogonal RNN can capture long term dependencies more effectively in sequential data than a conventional RNN or LSTM. As a result, this type of model has been shown to perform well on tasks that would require rote memorization[Hochreiter1991] and simple reasoning, such as the copy task[Hochreiter and Schmidhuber1997] and the sequential MNIST[Le, Jaitly, and Hinton2015]. Those models can just be viewed as an extension to vanilla RNNs[Jordan1986] that replaces the transition matrices with either unitary or orthogonal matrices.
In this paper, we refer the ability of a model to omit parts of the input sequence that contain redundant information and to filter out the noise input in general as the means of a forgetting mechanism. Previously [Gers, Schmidhuber, and Cummins1999]
have shown the importance of the forgetting mechanism for LSTM networks and with very similar motivations, we discuss the utilization of a forgetting mechanism for RNNs with orthogonal transitions. The importance of forgetting for those networks is mainly due to that unitary/orthogonal RNNs can backpropagate the gradients without vanishing through time, and it is very easy for them to just have an output that depends on equal amounts of all the elements of the whole input sequence. From this perspective, learning to forget can be difficult with unitary/orthogonal RNNs and they can clog up the memory with useless information. However, most real-world applications and natural tasks require the model to filter out irrelevant or redundant information from the input sequence. We argue that difficulties of forgetting can cause unitary and orthogonal RNNs to perform badly on many realistic tasks, and demonstrate this empirically with a toy task.
We propose a new architecture, the Gated Orthogonal Recurrent Unit (GORU), which combines the advantages of the above two frameworks, namely (i) the ability to capture long term dependencies by using orthogonal matrices and (ii) the ability to “forget” by using a GRU structure. We demonstrate that GORU is able to learn long term dependencies effectively, even in complicated datasets which require a forgetting ability. In this work, we focus on implementation of orthogonal transition matrices which is just a subset of the unitary matrices.
GORU outperforms a recent variation of unitary RNN called EURNN [Jing et al.2016] on language modeling, denoising, parenthesis and the question answering tasks. We show that the unitary RNN fails catastrophically on a denoising task which requires the model to forget. On question answering, speech spectrum prediction, algorithmic, parenthesis and the denoising tasks, GORU achieves better accuracy on the test set over all other models that we compare against. We have attempted to use gates on the unitary matrices with complex numbers, but we encountered some training challenges of training gating mechanisms, thus we have decided to just to focus on orthogonal matrices for this paper.
Given an input sequence , , a vanilla RNN defines a sequence of hidden states updated at each time step according to the rule
(1) |
where , and are model parameters and
is a nonlinear activation function. RNNs have proven to be effective for solving sequential tasks due to their flexibility to . However, a well-known problem called gradient vanishing and gradient explosion has prevented RNNs from efficiently learning long-term dependencies
[Bengio, Simard, and Frasconi1994]. Several approaches have been developed to solve this problem, with LSTMs and GRUs being the most successful and widely used.A big step forward from LSTM is the Gated Recurrent Unit (GRU), proposed by Cho et al, [Cho et al.2014a], which removed the extra memory state in LSTM. Specifically, the hidden state in a GRU is updated as follows:
(2) | |||||
(3) | |||||
(4) |
where , , and . Figure 1 demonstrated the architecture of GRU model.
Although LSTMs and GRUs were proposed to solve the exploding and vanishing gradient problem
[Hochreiter1991, Bengio, Simard, and Frasconi1994]they can in practice still suffer from this issue for long-term tasks. As a result, gradient clipping
[Pascanu, Mikolov, and Bengio2013] is usually required in the training process, although that only addresses the gradient explosion.A complex-valued matrix is unitary when it satisfies . A matrix
is orthogonal if it is both unitary and real-valued. Therefore, any vector
that multiplies a unitary or an orthogonal matrix satisfies:
(5) |
Thanks to this property, a unitary/orthogonal matrix is able to preserve the norm of vector flows through it and thus allow for the gradient to propagate through longer time steps. Recent papers from Arjovsky et al [Arjovsky, Shah, and Bengio2016, Henaff, Szlam, and LeCun2016] pointed out that unitary/orthogonal matrices can effectively prevent the gradient vanishing/explosion problem in conventional RNNs. After this work, several other unitary/orthogonal RNN models have been proposed [Jing et al.2016, Wisdom et al.2016, Hyland and Rätsch2017, Mhammedi et al.2016], all showing promising abilities in capturing long term dependencies in data.
A unitary/orthogonal matrix RNN is simply defined as replacing the hidden to hidden matrices in a vanilla RNN by unitary/orthogonal matrices:
(6) |
For unitary matrices, the nonlinear activation function needs to handle complex-valued inputs. In this paper, we use the generalizations of the popular real-valued activation function known as
(7) |
where
is a bias vector. This variant was found to perform effectively on a suite of benchmarks in
[Arjovsky, Shah, and Bengio2016, Jing et al.2016]. Even though was developed for complex value models, it turns out this activation function fits unitary/orthogonal matrices best.First, we argue for the advantage of an RNN which can forget some of its past inputs. This is desirable because we seek a state representation which can capture the most important elements of the past sequence, and can throw away irrelevant details or noise. This ability becomes particularly critical when the dimensionality of the RNN state is smaller than the product of the sequence length with the input dimension; i.e., when some form of compression is necessary. For this compression to be most useful for further processing, it is likely that it requires a non-linear combination of the past input values, allowing the network to forget and ignore unnecessary elements from the past.
Now consider an RNN whose state is obtained as a sequence of orthogonal transformations, with each transformation being a function of the input at a given time step. Let us focus on class of orthogonal transformations that are basically rotation for the simplicity of our analysis, which (non-commutativity aside) are analogous to addition in the space of angles. When we compose several orthogonal operators, we just add more angles together. So we forget in the mild sense that we get in the state a combination of several rotations (like adding the angles) and we lose track of exactly which individual rotations were applied. The advantage is that, in the space of angles, the derivative of the final angle to any of the individually added angle is 1, so there is no vanishing gradient. However, we cannot have complete forgetting, e.g., making the new state independent of the past inputs (or of some of them which we wish to forget): for a new rotation to cancel an old rotation, one would need the new rotation to ”know” about the old rotation to cancel, i.e., it would need to be a function of the old rotation. But this is not what happens, because each new rotation is chosen before looking at the current state. Instead, in a regular RNN, the state update depends in a non-linear way on the past state, so that for example when a particular value of the state is reached, it can be reset to 0. This would not be possible with just the composition of orthogonal transformations. These considerations motivate an architecture in which we combine orthogonal or unitary transformations with non-linearities which can be trained to forget when and where it is appropriate.
This section introduces the Gated Orthogonal Recurrent Unit (GORU). In our architecture, we change the hidden state loop matrix into an orthogonal matrix and change the respective activation function to modReLU:
(8) | |||||
(9) | |||||
(10) |
where is a suitable nonlinear activation function and , , . and are the reset and update gates, respectively. is kept orthogonal. In fact, we have only modified the main loop that absorbs new information to orthogonal while leaving the gates unchanged compared to the GRU. Figure 2 demonstrated the architecture of GORU model.
We enforce matrix to be orthogonal by using parametrization method purposed in [Jing et al.2016]. is decomposed into a sequence of 2-by-2 rotation matrices as shown in Figure 3. Each 2-by-2 rotation contains one trainable rotation parameter.
The update gates of the GORU help the model to filter out irrelevant or noise information coming from the input. It can be thought of as acting like a low-pass filter. The orthogonal transition matrices help the model to prevent the gradients to vanish through time. However, the ways an orthogonal transformation can interact with the hidden state of an RNN is limited to reflections and rotations. The reset gate enables the model to rescale the magnitude of the hidden state activations ().
We compare GORU with unitary RNNs (using the EURNN parameterization purposed by Jing et al.[Jing et al.2016]) and two other well-known gatedRNNs (LSTMs and GRUs). Previous research on unitary RNNs has mainly focused on memorization tasks; in contrast, we focus on more realistic noisy tasks, which require the model to discard parts of the input sequence to be able to use its capacity efficiently.
GORU is implemented in Tensorflow, available from
https://github.com/jingli9111/GORU-tensorflowThe first task we consider is the well known Copying Memory Task. The copying task is a synthetic task that is commonly used to test the network’s ability to remember information seen time steps earlier.
Specifically, the task is defined as follows. An alphabet consists of symbols , the first of which represent data, and the remaining two representing “blank” and “marker”, respectively. Here we choose . The input sequence contains 10 data steps, followed by “blank”. The RNN model is supposed to output “blank” and give the original sequence once it sees the “marker”. Note that each instance has a different location for these 10 elements of data.
In this experiment, we use RMSProp optimization with a learning rate of 0.001 and a decay rate of 0.9 for all models. The batch size is set to 128. All these models have roughly same number of hidden to hidden parameters, despite not having similar neuron layer sizes.
This task only requires the model to efficiently overcome the gradient vanishing/explosion problem and does not require a forgetting ability. The EURNN performs perfectly and goes through to the baseline in no time — as previously seen. The GORU is the only gated-system to successfully solve this task while the GRU and LSTM get stuck at the baseline as shown in Figure 4.
We evaluate the forgetting ability of each RNN architecture on a synthetic ”denoise” task. A list of data points are located randomly in a long noisy sequence. The RNN model is supposed to filter out the useless part (”noise”) and output the remaining sequential labels.
Similarly to the labels of copying memory task above, an alphabet consists of symbols , the first of which represent data, and the remaining two represent “noise” and “marker”, respectively. The input sequence contains 10 randomly located data steps and the rest are filled by “noise”. The RNN model is supposed to output those 10 data in a sequence after it sees the “marker”. Just as in the previous experiment, we use RMSProp optimization algorithm with a learning rate of 0.01 and a decay rate of 0.9 for all models. The batch size is set to 128. All these models have roughly same number of hidden to hidden parameters.
This task requires both the ability of learning long dependencies but also the ability to forget the noisy input. The GORU and GRU both are able to successfully outperform LSTM in terms of both learning speed and final performances as shown in Figure 5. EURNN, however, gets stuck at the baseline, just as we intuitively expected.
The parenthesis task[Foerster et al.2016] requires the RNN model to count the number of each type of unmatched parentheses at each time step, given that there are 10 types of parentheses. The input data contains 10 pairs of different parenthesis types — e.g. ’(, [, {, ¡, ), ], }, ¿, …’ — mixed with random noise/characters between them. The neural network outputs how many unmatched parentheses there are. For instance, given ’(((’, the neural network would output ’123’.Note that there are never more than 10 unmatched parentheses in any category.
In our experiment, the total input length is set to 200. We used batch size 128 and RMSProp Optimizer with a learning rate 0.001, decay rate 0.9 on all models. Hidden state sizes are set to match their total numbers of hidden to hidden parameters.
This task requires learning long-term dependencies and forgetting of the noisy data. The GORU is able to successfully outperform GRU, LSTM and EURNN in terms of both learning speed and final performances as shown in Figure 6.
We also analyzed the activations of the update gates for GORU and GRU. According to the histogram of activations shown in Figure 7, both models behave very similarly, and when the model receives noise as input, the activations of its update gate peaks. This behavior helps the model to forget and omit the noise input.
We tested the RNN models on algorithmic task as described in [Li et al.2015]. The model is fed with random graph as an input sequence and required to output the shortest path at the end of the sequence. We have used the exact same setup and use the data provided as in [Li et al.2015].
We used batch size 50 and hidden size 128 for all models. The RNNs are trained with RMSProp optimizer with a learning rate of 0.001 and decay rate of 0.9.
We summarized the test set results in Table 1. We found that the GORU performs averagely better than GRU/LSTM and EURNN.
Model | Accuracy |
---|---|
EURNN | |
LSTM | |
GRU | |
GORU |
We tested the ability of our RNN models on a word-level episodic question answering task. The bAbI dataset [Weston et al.] examines RNN’s ability to understand language and perform basic logical reasoning. Each training example is a set of statements, that are logically related in some fashion. For instance, one training example consists of these three statements and a question: Mary went to the bathroom. John moved to the Hallway. Mary traveled to the office. Where is Mary? Answer: office.
There are twenty different types of questions that can be asked — some requiring deduction between lines, some requiring association. The bAbI dataset is useful because it contains a small sized vocabulary, short sentences and requires one word answers for each story. Thus, it is a good benchmarking test because the word mapping layers are not the dominant sources of parameters.
We test each task with a uni-directional RNN without any attention mechanism. In detail, we word-embed and then feed one RNN the sequence of statements. Another RNN is fed the word-embedded question. Then, we concatenate the outputs of the two RNN’s into a single input for a third RNN that then outputs the correct word.
We summarized the test set results as follows in Table 2. We found that the GORU performs averagely better than GRU/LSTM and EURNN. We also show the big gains over EURNN by introducing the gates.
Task | GORU | GRU | LSTM | EURNN | baseline [Weston et al.] |
---|---|---|---|---|---|
1 - Single Supporting Fact | 45.8 | 49.1 | 49.3 | 47.2 | 50 |
2 - Two Supporting Facts | 39.5 | 38.5 | 32.3 | 24.3 | 20 |
3 - Three Supporting Facts | 33.5 | 32.2 | 20.6 | 22.5 | 20 |
4 - Two Arg. Relations | 62.7 | 64.6 | 67.5 | 56.1 | 61 |
5 - Three Arg. Relations | 87.0 | 78.0 | 52.3 | 56.2 | 70 |
6 - Yes/No Questions | 53.6 | 50.5 | 49.3 | 50.5 | 48 |
7 - Counting | 77.7 | 79.5 | 76.9 | 71.9 | 49 |
8 - Lists/Sets | 75.0 | 75.5 | 76.8 | 56.5 | 45 |
9 - Simple Negation | 62.9 | 63.9 | 63.5 | 60.6 | 64 |
10 - Indefinite Knowledge | 45.4 | 44.8 | 46.0 | 42.6 | 44 |
11 - Basic Coreference | 69.3 | 71.2 | 71.1 | 72.1 | 72 |
12 - Conjunction | 69.9 | 71.6 | 71.9 | 72.7 | 74 |
13 - Compound Coref. | 92.7 | 94.2 | 93.8 | 92.4 | 94 |
14 - Time Reasoning | 37.9 | 39.2 | 34.4 | 20.0 | 27 |
15 - Basic Deduction | 55.2 | 57.4 | 20.9 | 25.0 | 21 |
16 - Basic Induction | 44.0 | 45.9 | 45.9 | 43.3 | 23 |
17 - Positional Reasoning | 59.6 | 50.5 | 51.6 | 51.2 | 51 |
18 - Size Reasoning | 90.5 | 89.9 | 91.8 | 89.7 | 52 |
19 - Path Finding | 8.9 | 9.6 | 8.2 | 9.0 | 8.0 |
20 - Agent’s Motivations | 97.7 | 97.7 | 96.5 | 93.3 | 91 |
Mean Performance | 60.4 | 58.2 | 56.0 | 52.9 | 49.2 |
We test each RNN on character-level language modeling. The RNN is fed by one character each step from a real context and supposed to output the prediction for the next character. We used the Penn Treebank corpus [Marcus, Marcinkiewicz, and Santorini1993].
We use RMSProp with minibatch size of 32 and a learning rate of 0.001. Each training sequence is unfolded into 50 time steps. Similar to most work in language modeling, at the end of each sequence, the hidden state is saved and used to initialize the hidden state for the next sequence. This allows the neural network to give consistent predictions even at the beginning of a sequence.
We show the final test performance in Table 3 by comparing their performance in terms of bits-per-character. GORU is performing comparable to LSTM and GRU in our experiments and it performs significantly better than EURNN. We have also done an ablation study with disabling reset and update gates. Since most of the relevant information for character-level prediction can be obtained by only using the recent rather than distant past [Karpathy, Johnson, and Fei-Fei2015], the core of the character-prediction challenge does not involve the main strength of EURNN.
Model | bpc | # Units |
---|---|---|
LSTM | 1.596 | 350 |
GRU | 1.601 | 415 |
EURNN | 1.715 | 2048 |
GORU | 1.623 | 512 |
GORU (w/o reset gate) | 1.722 | 512 |
GORU (w/o update gate) | 1.754 | 512 |
We tested the ability of our RNN models on real-world speech spectrum prediction task in short-time Fourier transform (STFT)
[Wisdom et al.2016, Jing et al.2016]. We used TIMIT dataset sampled in 8 kHz. The audio .wav file is initially divided into different time frames and then Fourier transformed into the frequency domain and finally normalized for training/testing. In our STFT operation we uses a Hann analysis window of 256 samples (32 milliseconds) and a window hop of 128 samples (16 milliseconds). In this task, the RNNs are required to predict th log-magnitude of the STFT frame at time t + 1, given all the log-magnitudes of STFT frames up to time t.We used a training set with 2400 utterances, a validation set of 600 utterances and 1000 utterances for test. We trained all RNNs for with the same batch size 32 using Adam optimization with a learning rate of 0.001.
We found GORU significantly outperforms all other models with same hidden size as shown in Table 4.
Model | #parameters | MSE(validation) | MSE(test) |
---|---|---|---|
LSTM | 98k | 58.8 | 57.5 |
GRU | 72k | 58.9 | 57.3 |
EURNN | 41k | 51.8 | 51.9 |
GORU | 59k | 45.4 | 47.6 |
We have built a novel RNN that brings the benefits of orthogonal matrices to gated architectures: the Gated Orthogonal Recurrent Units (GORU). By replacing the hidden to hidden matrix in the reseting path of the GRU to be an orthogonal matrix, and replacing the non-linear activation to a modReLU, GORU gains the advantage of unitary/orthogonal RNNs since the gradient can pass through long time steps without exploding. Our empirical results showed that GORU is the only model we found that could solve both the synthetic copying task and the denoise task. Moreover, GORU is able to outperform GRU and LSTM in several benchmark tasks.
These results suggest that the GORU is the first step in bringing an explicit forgetting mechanism to the class of unitary/orthogonal RNNs. Our method demonstrates how to incorporate orthogonal matrices into a variety of neural network architectures, and we are excited to open the gate the next level of neural networks.
This work was partially supported by the Army Research Office through the Institute for Soldier Nanotechnologies under contract W911NF-13-D0001, the National Science Foundation under Grant No. CCF-1640012, and by the Semiconductor Research Corporation under Grant No. 2016-EP-2693-B.
Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing, EMNLP
, 1724–1734.Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence
, 2050–2058.
Comments
There are no comments yet.