Attention Craving RNNS: Building Up To Transformer Networks

comments

Attention Mechanism

Ok, now that we’ve covered all the prereqs, let’s get to the good stuff.

If you noticed on the previous animation, the decoder only looked at the last hidden vector generated by the encoder.

Turns out, it’s hard for the RNN to remember everything that happened over the sequence in this single vector (Bahdanau et al, 2015). For example, the word “NYU” could have been forgotten by the encoder by the time it finishes processing the input sequence.

Attention tries to solve this problem.

When you give a model an attention mechanism you allow it to look at ALL the h’s produced by the encoder at EACH decoding step.

To do this, we use a separate network, usually 1 fully connected layer which calculates how much of all the h’s the decoder wants to look at. This is called the attention mechanism.

So imagine that for all the h’s we generated, we’re actually only going to take a bit of each. Their sum is called a context vector c.

The scalars 0.3, 0.2, 0.4, 0.1 are called attention weights. In the original paper, you’ll find the same equation on page 3:

Alphas are generated by a neural network + softmax.

those weights are generated by a small neural network in this way:

# attention is just a fully connected layer and a final projection
attention_mechanism = nn.Linear(input=h_size+x_size, attn_dim=20)
final_proj_V = weight_matrix(attn_dim)

# encode the full input sentence to get the hs we want to attend to
all_h = encoder(["NYU", "NLP", "is", "awesome"]

# greedy decoding 1 step at a time until end of sentence token
current_token = ''
while current_token != '':

   # attend to the hs first
    attn_energies = []
    for h in all_h:
      attn_score = attention_mechanism([h,current_token])
      attn_score = tanh(attn_score)
      attn_score = final_proj_V.dot(attn_score)

      # attn_score is now a scalar (called an attn energy)
      attn_energies.append(attn_score)

   # turn the attention energies into weights by normalizing
   attn_weights = softmax(attn_energies)
   # attn_weights = [0.3, 0.2, 0.4, 0.1]

Now that we have the weights, we use them to pull out the h’s which might be relevant for that particular token being decoded

context_vector = attn_weights.dot(all_h)
# this is now a vector which mixes a bit of all the h's

Let’s break it down into steps:

1. We encoded the full input sequence and generated a list of h’s.
2. We started decoding with the decoder using greedy search.
3. Instead of giving the decoder h4, we gave it a context vector.
4. To generate the context vector, we used another network and learnable weights V to score how relevant each h was to the current token being decoded.
5. We normalized those attention energies and used them to mix all the h’s into 1 h which hopefully captures the relevant parts of all the hs, ie: a context vector.
6. Now we perform the decoding step again, but this time, using the context vector instead of h4.

Visualizing Attention

The attention weights tell us how important each h is. This means we can also visualize the weights at each decoding step. Here’s an example from the original attention paper:

In the first row, to translate “L’” the network used an alpha on the word “The” and zeroed the rest out.

To generate the word “economique” the network actually put some weight of the alphas at “European Economic” and zeroed out the rest. This shows attention’s usefulness when the translation relationship is many-to-one or one-to-many.

Attention Can Get Complicated

Types of Attention

This type of attention used only the h’s generated by the encoder. There’s a ton of research on improving on that process. For example:

1. Use only some of the h’s, maybe the h’s around the time step you’re currently decoding (local attention).
2. In addition to the h’s also use the h’s being generated by the decoder which we were throwing away before.
3. …

How to calculate attention energies

Another research area deals with how to calculate the attention scores. Instead of a dot product with V, researchers have also tried:

1. Scaling dot products.
2. Cosine(s, h)
3. Not using the V matrix and applying the softmax to the fully connected layer.
4. …

What to use when calculating attention energies

This final area of research looked at what exactly should go into comparing with the h vectors.

To build some intuition about what I mean, think about calculating attention like a key-value dictionary. The key is what you give the attention network to “look up” the most relevant context. The value is the most relevant context.

The method I described here only uses the current token and each h to compute the attention score. That is:

# calculate how relevant that h is
score_1 = attn_network([embed("<SOS"), h1])
score_2 = attn_network([embed("<SOS"), h2])
score_3 = attn_network([embed("<SOS"), h3])
score_4 = attn_network([embed("<SOS"), h4])

But really we could give it anything we might think is useful to help the attention network make the best decision. Maybe we give it the last context vector also!

score_1 = attn_network([embed(""), h1, last_context])

or maybe we give it something different, maybe a token to let it know it’s decoding Spanish

score_1 = attn_network([embed(""), h1, last_context, embed('')])

The possibilities are endless!

Implementation Details

Here are some tips to think about if you decide to implement your own.

1. Use Facebook’s implementation which is already really optimized.

Ok, fine that was a cop-out. Here are actual tips.

1. Remember the seq2seq has two parts a decoder RNN and encoder RNN. These two are separate.
2. The bulk of the work goes into building the decoder. The encoder is simply running the encoder over the full input sequence.
3. Remember the decoder RNN operates one step at a time. This is key!
4. Remember the decoder RNN operates one step at a time. Worth saying twice ;)
5. You have two options for decoding algorithms, greedy or beam search. Greedy is easier to implement, but beam search will give you better results most of the time.
6. Attention is optional! BUT… the impact is huge when you have it…
7. Attention is a separate network… Think about the network as the dictionary, where the key is a collection of things you want the network to use in deciding how relevant each particular h is.
8. Remember you are calculating attention for each h. That means you have a for loop for [h1, …, hn].
9. The attention network embedding dim can be made arbitrarily high. This WILL blow up your RAM. Make sure to put it on a separate GPU or keep the dim small.
10. A trick to get large models going is to put the encoder on 1 gpu, decoder on a second gpu and the attention network on a third gpu. This way you keep the memory footprint low.
11. If you actually deploy this model, you’ll need to implement it batched. Everything I explained here was for batch size=1, but you can scale to bigger batches by changing to tensor products and being smart about your linear algebra. I explain this in detail here.

Again, most of the time, you should just use an open source implementation, but it’s a great learning experience to do your own!

Life After Attention

Turns out… the attention network by itself was shown to be really powerful.

So much so, that researchers decided to get rid of the RNNs and the sequence to sequence approach. They instead created something called a Transformer model.

At a high-level, a transformer still has an encoder and decoder except the layers are fully connected and look at the full input at once. Then as the input moves through the network, attention heads are applied to focus on what’s important.

Transformer illustration from here.

This model has largely replaced seq2seq models in translation and is behind the currently most powerful models, BERT and OpenAI’s GPT.

 
Bio: William Falcon is startup founder, AI researcher and AI writer for Forbes. He is passionate about encouraging latinX inclusion in STEM and using AI for social impact. His research interest is in the intersection of AI and neuroscience with a focus on biologically inspired fundamental research in deep learning and reinforcement learning with applications to social problems, neuroscience, and NLP.

Original. Reposted with permission.

Related:

• Sequence Modeling with Neural Networks – Part I
• Exploring Recurrent Neural Networks
• A Guide For Time Series Prediction Using Recurrent Neural Networks (LSTMs)