# Recurrent Neural Networks (RNNs) for Language Modeling¶

In previous tutorials, we worked with feedforward neural networks. They’re called feedforward networks because each layer feeds into the next layer in a chain connecting the inputs to the outputs. At each iteration $$t$$, we feed in a new example $$x_t$$, by setting the values of the input nodes (orange). We then feed the activation forward by successively calculating the activations of each higher layer in the network. Finally, we read the outputs from the topmost layer.

So when we feed the next example $$x_{t+1}$$, we overwrite all of the previous activations. If consecutive inputs to our network have no special relationship to each other (say, images uploaded by unrelated users), then this is perfectly acceptable behavior. But what if our inputs exhibit a sequential relationship?

Say for example that you want to predict the next character in a string of text. We might decide to feed each character into the neural network with the goal of predicting the succeeding character. In the above example, the neural network forgets the previous context every time you feed a new input. How is the neural network supposed to know that “e” is followed by a space? It’s hard to see why that should be so probable if you didn’t know that the “e” was the final letter in the word “Time”.

Recurrent neural networks provide a slick way to incorporate sequential structure. At each time step $$t$$, each hidden layer $$h_t$$ (typically) will receive input from both the current input $$x_t$$ and from that same hidden layer at the previous time step $$h_{t-1}$$ Now, when our net is trying to predict what comes after the “e” in time, it has access to its previous beliefs, and by extension, the entire history of inputs. Zooming back in to see how the nodes in a basic RNN are connected, you’ll see that each node in the hidden layer is connected to each node at the hidden layer at the next time step: Even though the neural network contains loops (the hidden layer is connected to itself), because this connection spans a time step our network is still technically a feedforward network. Thus we can still train by backpropagration just as we normally would with an MLP. Typically the loss function will be an average of the losses at each time step.

In this tutorial, we’re going to roll up our sleeves and write a simple RNN in MXNet using nothing but mxnet.ndarray and mxnet.autograd. In practice, unless you’re trying to develop fundamentally new recurrent layers, you’ll want to use the prebuilt layers that call down to extremely optimized primitives. You’ll also want to rely on some pre-built batching code because batching sequences can be a pain. But we think in general, if you’re going to work with this stuff, and have a modicum of self respect, you’ll want to implement from scratch and understand how it works at a reasonably low level.

Let’s go ahead and import our dependencies and specify our context. If you’ve been following along without a GPU until now, this might be where you’ll want to get your hands on some faster hardware. GPU instances are available by the hour through Amazon Web Services. A single GPU via a p2 instance (NVIDIA K80s) or even an older g2 instance will be perfectly adequate for this tutorial.

:

from __future__ import print_function
import mxnet as mx
import numpy as np
mx.random.seed(1)
ctx = mx.gpu(0)


## Dataset: “The Time Machine”¶

Now mess with some data. I grabbed a copy of the Time Machine, mostly because it’s available freely thanks to the good people at Project Gutenberg and a lot of people are tired of seeing RNNs generate Shakespeare. In case you prefer torturing Shakespeare to torturing H.G. Wells, I’ve also included Andrej Karpathy’s tinyshakespeare.txt in the data folder. Let’s get started by reading in the data.

:

with open("../data/nlp/timemachine.txt") as f:


And you’ll probably want to get a taste for what the text looks like.

:

print(time_machine[0:500])

Project Gutenberg's The Time Machine, by H. G. (Herbert George) Wells

This eBook is for the use of anyone anywhere at no cost and with
almost no restrictions whatsoever.  You may copy it, give it away or
re-use it under the terms of the Project Gutenberg License included
with this eBook or online at www.gutenberg.net

Title: The Time Machine

Author: H. G. (Herbert George) Wells

Release Date: October 2, 2004 [EBook #35]
[Last updated: October 3, 2014]

Language: English

*** START OF THIS PR


## Tidying up¶

I went through and discovered that the last 38083 characters consist entirely of legalese from the Gutenberg gang. So let’s chop that off lest our language model learn to generate such boring drivel.

:

print(time_machine[-38075:-37500])
time_machine = time_machine[:-38083]

End of Project Gutenberg's The Time Machine, by H. G. (Herbert George) Wells

*** END OF THIS PROJECT GUTENBERG EBOOK THE TIME MACHINE ***

***** This file should be named 35.txt or 35.zip *****
This and all associated files of various formats will be found in:
http://www.gutenberg.net/3/35/

Updated editions will replace the previous one--the old editions
will be renamed.

Creating the works from public domain print editions means that no
one owns a United States copyright in these works, so the Foundation
(and you!) c


## Numerical representations of characters¶

When we create numerical representations of characters, we’ll use one-hot representations. A one-hot is a vector that takes value 1 in the index corresponding to a character, and 0 elsewhere. Because this vector is as long as the vocab, let’s get a definitive list of characters in this dataset so that our representation is not longer than necessary.

:

character_list = list(set(time_machine))
vocab_size = len(character_list)
print(character_list)
print("Length of vocab: %s" % vocab_size)

['H', ';', 'D', 'k', '_', 'c', ' ', '0', ',', 'V', '"', 'Y', 'C', 'l', "'", 'e', '[', 'E', '#', 'B', 'u', 'j', 'q', 'r', 'N', 'I', 'T', 'n', ')', '3', 'M', 'y', '2', '8', '.', 'f', 'F', 'U', '(', 'W', 'R', 't', 'S', 'a', ']', 'z', '1', '9', 'K', 'O', 'Q', '\n', 'x', 'v', 'L', 'g', 'p', 'A', '?', '!', '-', 'P', 'G', 'h', 'w', 'J', 'd', 'b', ':', 'o', 'i', 's', 'm', '5', 'X', '4', '*']
Length of vocab: 77


We’ll often want to access the index corresponding to each character quickly so let’s store this as a dictionary.

:

character_dict = {}
for e, char in enumerate(character_list):
character_dict[char] = e
print(character_dict)

{'H': 0, ']': 44, ';': 1, 'J': 65, 'Q': 50, 'D': 2, '_': 4, 'a': 43, ' ': 6, '0': 7, 'V': 9, 'd': 66, 'i': 70, 'C': 12, 'W': 39, 'l': 13, 'o': 69, '"': 10, "'": 14, '*': 76, 'e': 15, '[': 16, '#': 18, 'p': 56, '!': 59, 'B': 19, 'u': 20, 'j': 21, 'q': 22, 'r': 23, 'I': 25, 'k': 3, '5': 73, 'T': 26, ')': 28, '3': 29, 'y': 31, '2': 32, '.': 34, 'f': 35, 'F': 36, 'n': 27, '(': 38, 'R': 40, 'X': 74, 't': 41, 'S': 42, 'x': 52, '8': 33, 'E': 17, 'z': 45, '1': 46, 'K': 48, 'O': 49, ',': 8, 'U': 37, '\n': 51, '?': 58, 'v': 53, 'L': 54, 'g': 55, 'M': 30, '-': 60, 'G': 62, 'P': 61, 'h': 63, 'A': 57, 'w': 64, 'Y': 11, 'b': 67, ':': 68, 'c': 5, 'm': 72, 's': 71, 'N': 24, '4': 75, '9': 47}

:

time_numerical = [character_dict[char] for char in time_machine]

:

#########################
#  Check that the length is right
#########################
print(len(time_numerical))

#########################
#  Check that the format looks right
#########################
print(time_numerical[:20])

#########################
#  Convert back to text
#########################
print("".join([character_list[idx] for idx in time_numerical[:39]]))

179533
[61, 23, 69, 21, 15, 5, 41, 6, 62, 20, 41, 15, 27, 67, 15, 23, 55, 14, 71, 6]
Project Gutenberg's The Time Machine, b


## One-hot representations¶

We can use NDArray’s one_hot() operation to render a one-hot representation of each character. But frack it, since this is the from scratch tutorial, let’s write this ourselves.

:

def one_hots(numerical_list, vocab_size=vocab_size):
result = nd.zeros((len(numerical_list), vocab_size), ctx=ctx)
for i, idx in enumerate(numerical_list):
result[i, idx] = 1.0
return result

:

print(one_hots(time_numerical[:2]))


[[ 0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.
0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.
0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.
0.  0.  0.  0.  0.  0.  0.  1.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.
0.  0.  0.  0.  0.]
[ 0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.
0.  0.  0.  0.  0.  1.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.
0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.
0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.  0.
0.  0.  0.  0.  0.]]
<NDArray 2x77 @gpu(0)>


That looks about right. Now let’s write a function to convert our one-hots back to readable text.

:

def textify(embedding):
result = ""
indices = nd.argmax(embedding, axis=1).asnumpy()
for idx in indices:
result += character_list[int(idx)]
return result

:

textify(one_hots(time_numerical[0:40]))

:

"Project Gutenberg's The Time Machine, by"


## Preparing the data for training¶

Great, it’s not the most efficient implementation, but we know how it works. So we’re already doing better than the majority of people with job titles in machine learning. Now, let’s chop up our dataset into sequences that we could feed into our model.

You might think we could just feed in the entire dataset as one gigantic input and backpropagate across the entire sequence. When you try to backpropagate across thousands of steps a few things go wrong: (1) The time it takes to compute a single gradient update will be unreasonably long (2) The gradient across thousands of recurrent steps has a tendency to either blow up, causing NaN errors due to losing precision, or to vanish.

Thus we’re going to look at feeding in our data in reasonably short sequences. Note that this home-brew version is pretty slow; if you’re still running on a CPU, this is the right time to make dinner.

:

seq_length = 64
# -1 here so we have enough characters for labels later
num_samples = (len(time_numerical) - 1) // seq_length
dataset = one_hots(time_numerical[:seq_length*num_samples]).reshape((num_samples, seq_length, vocab_size))
textify(dataset)

:

"Project Gutenberg's The Time Machine, by H. G. (Herbert George) "


Now that we’ve chopped our dataset into sequences of length seq_length, at every time step, our input is a single one-hot vector. This means that our computation of the hidden layer would consist of matrix-vector multiplications, which are not especially efficient on GPU. To take advantage of the available computing resources, we’ll want to feed through a batch of sequences at the same time. The following code may look tricky but it’s just some plumbing to make the data look like this. :

batch_size = 32

:

print('# of sequences in dataset: ', len(dataset))
num_batches = len(dataset) // batch_size
print('# of batches: ', num_batches)
train_data = dataset[:num_batches*batch_size].reshape((batch_size, num_batches, seq_length, vocab_size))
# swap batch_size and seq_length axis to make later access easier
train_data = nd.swapaxes(train_data, 0, 1)
train_data = nd.swapaxes(train_data, 1, 2)
print('Shape of data set: ', train_data.shape)

# of sequences in dataset:  2805
# of batches:  87
Shape of data set:  (87, 64, 32, 77)


Let’s sanity check that everything went the way we hope. For each data_row, the second sequence should follow the first:

:

for i in range(3):
print("***Batch %s:***\n %s \n %s \n\n" % (i, textify(train_data[i, :, 0]), textify(train_data[i, :, 1])))

***Batch 0:***
Project Gutenberg's The Time Machine, by H. G. (Herbert George)
vement of the barometer. Yesterday it was so high, yesterday nig

***Batch 1:***
Wells

This eBook is for the use of anyone anywhere at no cost a
ht
it fell, then this morning it rose again, and so gently upwar

***Batch 2:***
nd with
almost no restrictions whatsoever.  You may copy it, giv
d to
here. Surely the mercury did not trace this line in any of



## Preparing our labels¶

Now let’s repurpose the same batching code to create our label batches

:

labels = one_hots(time_numerical[1:seq_length*num_samples+1])
train_label = labels.reshape((batch_size, num_batches, seq_length, vocab_size))
train_label = nd.swapaxes(train_label, 0, 1)
train_label = nd.swapaxes(train_label, 1, 2)
print(train_label.shape)

(87, 64, 32, 77)


## A final sanity check¶

Remember that our target at every time step is to predict the next character in the sequence. So our labels should look just like our inputs but offset by one character. Let’s look at corresponding inputs and outputs to make sure everything lined up as expected.

:

print(textify(train_data[10, :, 3]))
print(textify(train_label[10, :, 3]))

te, but the twisted crystalline bars lay unfinished upon the
ben
e, but the twisted crystalline bars lay unfinished upon the
benc


## Recurrent neural networks¶ Recall that the update for an ordinary hidden layer in a neural network with activation function $$\phi$$ is given by

$\boldsymbol h = \phi(\boldsymbol x W + \boldsymbol b)$

To make this a recurrent neural network, we’re simply going to add a weight sum of the previous hidden state $$h_{t-1}$$:

$\boldsymbol h_t = \phi(\boldsymbol x_t W_{xh} + \boldsymbol h_{t-1} W_{hh} + \boldsymbol b_h )$

Then at every time set $$t$$, we’ll calculate the output as:

$\boldsymbol {\hat{y}}_t = \text{softmax}_{one-hot}(\boldsymbol h_t W_{hy} + \boldsymbol b_y)$

## Allocate parameters¶

:

num_inputs = vocab_size
num_hidden = 256
num_outputs = vocab_size

########################
#  Weights connecting the inputs to the hidden layer
########################
Wxh = nd.random_normal(shape=(num_inputs,num_hidden), ctx=ctx) * .01

########################
#  Recurrent weights connecting the hidden layer across time steps
########################
Whh = nd.random_normal(shape=(num_hidden,num_hidden), ctx=ctx) * .01

########################
#  Bias vector for hidden layer
########################
bh = nd.random_normal(shape=num_hidden, ctx=ctx) * .01

########################
# Weights to the output nodes
########################
Why = nd.random_normal(shape=(num_hidden,num_outputs), ctx=ctx) * .01
by = nd.random_normal(shape=num_outputs, ctx=ctx) * .01

# NOTE: to keep notation consistent,
# we should really use capital letters
# for hidden layers and outputs,
# since we are doing batchwise computations]


:

params = [Wxh, Whh, bh, Why, by]

for param in params:


## Softmax Activation¶

:

def softmax(y_linear, temperature=1.0):
lin = (y_linear-nd.max(y_linear, axis=1).reshape((-1,1))) / temperature # shift each row of y_linear by its max
exp = nd.exp(lin)
partition =nd.sum(exp, axis=1).reshape((-1,1))
return exp / partition

:

####################
# With a temperature of 1 (always 1 during training), we get back some set of probabilities
####################
softmax(nd.array([[1, -1], [-1, 1]]), temperature=1.0)

:


[[ 0.88079703  0.11920292]
[ 0.11920292  0.88079703]]
<NDArray 2x2 @cpu(0)>

:

####################
# If we set a high temperature, we can get more entropic (*noisier*) probabilities
####################
softmax(nd.array([[1,-1],[-1,1]]), temperature=1000.0)

:


[[ 0.50049996  0.49949998]
[ 0.49949998  0.50049996]]
<NDArray 2x2 @cpu(0)>

:

####################
# Often we want to sample with low temperatures to produce sharp probabilities
####################
softmax(nd.array([[10,-10],[-10,10]]), temperature=.1)

:


[[ 1.  0.]
[ 0.  1.]]
<NDArray 2x2 @cpu(0)>


## Define the model¶

:

def simple_rnn(inputs, state, temperature=1.0):
outputs = []
h = state
for X in inputs:
h_linear = nd.dot(X, Wxh) + nd.dot(h, Whh) + bh
h = nd.tanh(h_linear)
yhat_linear = nd.dot(h, Why) + by
yhat = softmax(yhat_linear, temperature=temperature)
outputs.append(yhat)
return (outputs, h)


## Cross-entropy loss function¶

At every time step our task is to predict the next character, given the string up to that point. This is the familiar multi-task classification that we introduced for handwritten digit classification. Accordingly, we’ll rely on the same loss function, cross-entropy.

:

# def cross_entropy(yhat, y):
#     return - nd.sum(y * nd.log(yhat))

def cross_entropy(yhat, y):
return - nd.mean(nd.sum(y * nd.log(yhat), axis=0, exclude=True))

:

cross_entropy(nd.array([[.2,.5,.3], [.2,.5,.3]]), nd.array([[1.,0,0], [0, 1.,0]]))

:


[ 1.15129256]
<NDArray 1 @cpu(0)>


## Averaging the loss over the sequence¶

Because the unfolded RNN has multiple outputs (one at every time step) we can calculate a loss at every time step. The weights corresponding to the net at time step $$t$$ influence both the loss at time step $$t$$ and the loss at time step $$t+1$$. To combine our losses into a single global loss, we’ll take the average of the losses at each time step.

:

def average_ce_loss(outputs, labels):
assert(len(outputs) == len(labels))
total_loss = 0.
for (output, label) in zip(outputs,labels):
total_loss = total_loss + cross_entropy(output, label)


## Optimizer¶

:

def SGD(params, lr):
for param in params:
param[:] = param - lr * param.grad


## Generating text by sampling¶

We have now defined a model that takes a sequence of real inputs from our training data and tries to predict the next character at every time step. You might wonder, what can we do with this model? Why should I care about predicting the next character in a sequence of text?

This capability is exciting because given such a model, we can now generate strings of plausible text. The generation procedure goes as follows. Say our string begins with the character “T”. We can feed the letter “T” and get a conditional probability distribution over the next character $$P(x_2|x_1=\text{"T"})$$. We can the sample from this distribution, e.g. producing an “i”, and then assign $$x_2=\text{"i"}$$, feeding this to the network at the next time step.

[Add a nice graphic to illustrate sampling]

:

def sample(prefix, num_chars, temperature=1.0):
#####################################
#####################################
string = prefix

#####################################
# Prepare the prefix as a sequence of one-hots for ingestion by RNN
#####################################
prefix_numerical = [character_dict[char] for char in prefix]
input_sequence = one_hots(prefix_numerical)

#####################################
# Set the initial state of the hidden representation ($h_0$) to the zero vector
#####################################
sample_state = nd.zeros(shape=(1, num_hidden), ctx=ctx)

#####################################
# For num_chars iterations,
#     1) feed in the current input
#     2) sample next character from from output distribution
#     3) add sampled character to the decoded string
#     4) prepare the sampled character as a one_hot (to be the next input)
#####################################
for i in range(num_chars):
outputs, sample_state = simple_rnn(input_sequence, sample_state, temperature=temperature)
choice = np.random.choice(vocab_size, p=outputs[-1].asnumpy())
string += character_list[choice]
input_sequence = one_hots([choice])
return string

[ ]:

epochs = 2000
moving_loss = 0.

learning_rate = .5

# state = nd.zeros(shape=(batch_size, num_hidden), ctx=ctx)
for e in range(epochs):
############################
# Attenuate the learning rate by a factor of 2 every 100 epochs.
############################
if ((e+1) % 100 == 0):
learning_rate = learning_rate / 2.0
state = nd.zeros(shape=(batch_size, num_hidden), ctx=ctx)
for i in range(num_batches):
data_one_hot = train_data[i]
label_one_hot = train_label[i]
outputs, state = simple_rnn(data_one_hot, state)
loss = average_ce_loss(outputs, label_one_hot)
loss.backward()
SGD(params, learning_rate)

##########################
#  Keep a moving average of the losses
##########################
if (i == 0) and (e == 0):
moving_loss = np.mean(loss.asnumpy())
else:
moving_loss = .99 * moving_loss + .01 * np.mean(loss.asnumpy())

print("Epoch %s. Loss: %s" % (e, moving_loss))
print(sample("The Time Ma", 1024, temperature=.1))
print(sample("The Medical Man rose, came to the lamp,", 1024, temperature=.1))


## Conclusions¶

Once you start running this code, it will spit out a sample at the end of each epoch. I’ll leave this output cell blank so you don’t see megabytes of text, but here are some patterns that I observed when I ran this code.

The network seems to first work out patterns with no sequential relationship and then slowly incorporates longer and longer windows of context. After just 1 epoch, my RNN generated this:

e       e e ee    e   eee     e     e ee   e  e      ee     e e   ee  e   e            ee    e   e   e     e  e   e     e          e   e ee e    aee    e e               ee  e     e   ee ee   e ee     e e       e e e        ete    e   e e   e e   e       ee  n eee    ee e     eeee  e e    e         e  e  e ee    e  e   e    e       e  e  eee ee      e         e            e       e    e e    ee   ee e e e   e  e  e e  e t       e  ee         e eee  e  e      e ee    e    e       e                e      eee   e  e  e   eeeee      e     eeee e e   ee ee     ee     a    e e eee           ee  e e   e e   aee           e      e     e e               eee       e           e         e     e    e e   e      e   e e   e    e    e ee e      ee                 e  e  e   e    e  e   e                    e      e   e        e     ee  e    e    ee n  e   ee   e  e         e  e         e      e    t    ee  ee  ee   eee  et     e        e     e e              ee   e  e  e     e  e  e e       e              e       e"


It’s learned that spaces and “e”s (to my knowledge, there’s no aesthetically pleasing way to spell the plural form of the letter “e”) are the most common characters.

A little bit later on it spits out strings like:

the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the the

At this point it’s learned that after the space usually comes a nonspace character, and perhaps that “t” is the most common character to immediately follow a space, “h” to follow a “t” and “e” to follow “th”. However it doesn’t appear to be looking far enough back to realize that the word “the” should be very unlikely immediately after the word “the”…

By the 175th epoch, the model appears to be putting together a fairly large vocabulary although it puts words together in ways that might be charitably described as “creative”.

the little people had been as I store of the sungher had leartered along the realing of the stars of the little past and stared at the thing that I had the sun had to the stars of the sunghed a stirnt a moment the sun had come and fart as the stars of the sunghed a stirnt a moment the sun had to the was completely and of the little people had been as I stood and all amations of the staring and some of the really

In subsequent tutorials we’ll explore sophisticated techniques for evaluating and improving language models. We’ll also take a look at some related but more complicate problems like language translations and image captioning.