4. Attention Layers¶
Attention is a concept in machine learning and AI that goes back many years, especially in computer vision[BP97]. Like the word “neural network”, attention was inspired by the idea of attention in how human brains deal with the massive amount of visual and audio input[TG80]. Attention layers are deep learning layers that evoke the idea of attention. You can read more about attention in deep learning in Luong et al. [LPM15] and get a practical overview here. Attention layers have been empirically shown to be so effective in modeling sequences, like language, that they have become indispensible[VSP+17]. The most common place you’ll see attention layers is in transformers neural networks that model sequences. We’ll also see attention in graph neural networks and they are common in computer vision.
Attention layers are fundamentally a weighted mean reduction. Attention removes one axis from an input tensor by computing a mean. Attention is unusal among layers because it takes three inputs, whereas most layers in deep learning take just one or perhaps two. These inputs are called the query, the values, and the keys. The reduction occurs over the values; so if the values are rank 3, the output will be rank 2. The query should be one less rank than the keys. The keys should be the same rank as the values. The keys and query determine how to weight the values.
The table below summarizes these three input arguments. Note that often the query is batched, so that it’s rank will be 2 if batched and the output’s rank will be 2.
Rank 
Axes 
Purpose 
Example 


Query 
1 
(# of attn features) 
input for checking against keys 
One word represented as feature vector 
Keys 
2 
(sequence length, # of attn features) 
used to compute attention against query 
All words in sentence represented as matrix of feature vectors 
Values 
2 
(sequence length, # of value features) 
used to compute value of output 
A vector of numbers for each word in a sentence 
Output 
1 
(# of value features) 
attentionweighted mean over values 
single vector 
4.1. Example¶
Attention is best conceptualized as operating on a sequence. Let’s use a sentence like “The sleepy child reads a book”. The words in the sentence correspond to the keys. If we represent our words as embeddings, our keys will be rank 2. For example, the word “sleepy” might be represented by an embedding vector of length 2: \([0.2, 0.4]\), where these embedding values are trained or taken from a standard language embedding. By convention, the zeroth axis of keys will be the position in the sequence and the first axis contains these vectors. The query is often an element from the keys, like the word “book”. The point of attention is to see what parts of the sentence the query should be influenced by. “Book” should have strong attention on “child” and “reads”, but probably not to “sleepy”. You’ll see soon that we will actually compute this as a vector, called the attention vector \(\vec{b}\). The output from the attention layer will be a reduction over the values where each element of values is weighted by the attention between the query and the key. Thus there should be one key and one value for each element in our sentence. The values could be identical to the keys, which is common.
Let’s see how this looks mathematically. The attention layer consists of two steps: (1) computing the attention vector \(\vec{b}\) using the attention mechanism and (2) the reduction over the values using the attention vector \(\vec{b}\). Attention mechanism is a fancy word for the attention equation. Consider our example above. We’ll use a 3 dimensional embedding for our words
Index 
Embedding 
Word 

0 
0,0,0 
The 
1 
2,0,1 
Sleepy 
2 
1,1,2 
Child 
3 
2,3,1 
Reads 
4 
2,0,0 
A 
5 
0,2,1 
Book 
The keys will be a rank 2 tensor (matrix) putting all these together. Note that these are only integers to make this example clearer, typically words are represented with floating point numbers when embedded.
They keys are shape \((6, 3)\) because our sentence has 6 words and each word is represented with a 3 dimensional embedding vector. Let’s make our values simple, we’ll have one for each word. These values are what determine our output. Perhaps they could be the sentiment of the word: is it a positive word (happy) or a negative word (angry).
Note that the values \(\mathbf{V}\) should be the same rank as the keys, so its shape is interpreted as \((6, 1)\). Finally, the query which should be one rank less than the keys. Our query is the word “book”:
4.2. Attention Mechanism Equation¶
The first equation is the attention mechanism. This uses query and keys arguments only. It outputs a tensor one rank less than the keys, giving a scalar for each key corresponding to the attention the query should have for the key. The attention vector should be normalized! Usually this is achieved by doing a softmax. The specific equation used is a hyperparameter, like activation functions. In practice, most use a dot product followed by a softmax:
where there could be more indices depending on the rank of the inputs. What we’re doing is taking the dot product of each key with the query. In our example, this would be:
I’ve rounded the numbers here, but essentially the attention vector only gives weight to the word itself (book) and the verb “read”. I made this up, remember, but it gives you an idea of how attention gives you a way to connect words. It may even remind you of our graph neural network’s idea of neighbors.
4.3. Attention Reduction¶
After computing the attention vector \(\vec{b}\), this is used to compute a weighted mean over the values. The output of the attention layer is then
Conceptually, our example computed the attentionweighted sentiment of the query word “book” in our sentence. You can see that attention layers do two things: compute an attention vector with the attention mechanism and then use it to take the attentionweighted average over the values.
4.4. Soft vs Hard Attention¶
Just like activation, there is an enormous range of choices for attention mechanism. One distinguishing attribute is if the softmax is used or a “hardmax”. Recall a softmax converts real numbers into probabilities by viewing the real numbers as logodds (logs of probability ratios). A “hardmax” means just taking the max, but the ouput is shaped like a probability distribution. Using hard attention means that you only return the value which had the maximum output from the attention mechanism, instead of taking a weighted average. You can view this is as just another attention mechanism type, but you’ll see some literature discussing hard vs soft attention.
4.5. TensorDot¶
The most common attention mechanism is a dot product (called tensordot to be more general) followed by a softmax [LPM15]. This is divided by the dimension of the keys (last axis dimension). Remember the keys are not normalized. If they are random numbers, the magnitude of the output from the dot product scales with the square root of the dimension of the keys due to the central limit theorem. This can make the softmax behave poorly, since you’re taking \(e^{\vec{q} \cdot \mathbf{K}}\). Putting this all together, the equation is:
where \(d\) is the dimension of the query vector.
4.6. SelfAttention¶
Remember how everything is batched in deep learning? The batched input to an attention layer is usually the query. So although in the above discussion it was a tensor of one rank less than the keys (typically a query vector), once it has been batched it will be the same rank as the keys. Almost always, the query is in fact equal to the keys. Like in our example, our query was the embedding vector for the word “book”, which is one of the keys. If you consider the query to be batched so that you consider every word in the sentence, the query becomes equal to the keys. A further special case is when the query, values and keys are equal. This is called selfattention. This just means our attention mechanism uses the values directly and there is no extra set of “keys” input to the layer.
4.7. Trainable Attention¶
There are no trainable parameters in our definitions above yet. How can you do learning with attention? Typically, you don’t. There are exceptions like using a trainable attention mechanism (like a dense layer), but in most definitions of attention you do not have any trainable parameters.
4.8. Multihead Attention Block¶
Inspired by the idea of convolutions with multiple filters, there is a block (group of layers) that splits to multiple parallel attentions. These are called “multihead attention”. If your values are shape \((L, V)\), you will get back a \((H, V)\) tensor, where \(H\) is the number of parallel attention layers (heads). If there are no trainable parameters in attention layers, what’s the point of this though? Well you must introduce weights. These are square weight matrices because we need all shapes to remain constant among all the attention heads.
Consider an attention layer to be defined by \(A(\vec{q}, \mathbf{K}, \mathbf{V})\). The multiheaded attention is
where each element of the output vector \([\ldots]\) is itself an output vector from an attention layer, making the \((L, V)\) shaped tensor. So the whole output is an \((H, L, V)\) tensor. The most famous example of the multhead attention block is in transformers[VSP+17] where they use selfattention multahead attention blocks.
Typically the next layer doesn’t expect an \((H, L, V)\) tensor, so the output from the multheaded attention is often reduced by multiplying with an \((H, V, V)\) or \((H)\) tensor of weights.
4.9. Running This Notebook¶
Click the above to launch this page as an interactive Google Colab.
4.10. Code Examples¶
Let’s see how attention can be implemented in code. I will use random variables here for the different quantities but I will indicate which variables should be trained with w_
and which should be inputs with i_
.
4.10.1. TensorDot Mechanism¶
We’ll begin with implementing the tensordot attention mechanism first. As an example, we’ll use a sequence length of 11 and a keys feature length of 4 and a values feature dimension of 2. Remember the keys and query must share feature dimension size.
import numpy as np
def softmax(x, axis=None):
return np.exp(x)/np.sum(np.exp(x), axis=axis)
def tensor_dot(q, k):
b = softmax( (k @ q) / np.sqrt(q.shape[0]) )
return b
i_query = np.random.normal(size=(4,))
i_keys = np.random.normal(size=(11,4))
b = tensor_dot(i_query, i_keys)
print('b = ', b)
b = [0.0281404 0.46463709 0.00800872 0.18811175 0.01562265 0.00930409
0.10853987 0.02482119 0.02724028 0.12204189 0.00353209]
As expected, we get out a vector \(\vec{b}\) whose sum is 1.
4.10.2. General Attention¶
Now let’s put this attention mechanism into an attention layer.
def attention_layer(q, k, v):
b = tensor_dot(q, k)
return b @ v
i_values = np.random.normal(size=(11, 2))
attention_layer(i_query, i_keys, i_values)
array([ 0.38388244, 0.81502527])
We get two values, one for each feature dimension.
4.10.3. Selfattention¶
The change in selfattention is that we make queries, keys, and values equal. We need to make a small change in that the queries are batched in this setting, so we should get a rank 2 output.
def batched_tensor_dot(q, k):
# a will be batch x seq x feature dim
# which is N x N x 4
# batched dot product in einstein notation
a = np.einsum('ij,kj>ik', q, k) / np.sqrt(q.shape[0])
# now we softmax over sequence
b = softmax(a, axis=1)
return b
def self_attention(x):
b = batched_tensor_dot(x, x)
return b @ x
i_batched_query = np.random.normal(size=(11, 4))
self_attention(i_batched_query)
array([[ 3.10491260e01, 5.12047710e01, 3.07615581e01,
1.31968257e+00],
[2.37461404e01, 2.02781004e01, 2.90575282e01,
1.47872781e01],
[2.56695639e01, 8.68187220e02, 3.50585239e01,
5.90783113e01],
[ 7.52452380e02, 1.68118358e+00, 3.99778164e01,
2.83436434e01],
[ 1.53789731e03, 2.03708988e02, 1.58147140e01,
2.12309833e01],
[2.20669746e01, 1.77545431e01, 2.83854521e01,
9.91633422e02],
[ 1.90671530e01, 3.69901044e01, 7.02680848e02,
2.69587575e01],
[ 8.74369305e02, 9.00556605e01, 1.04895714e01,
2.97338817e01],
[ 1.49516263e01, 2.20983652e01, 5.99962624e02,
1.87138433e01],
[3.30581479e02, 6.79317626e01, 2.04073564e01,
5.26369177e02],
[ 9.36952566e02, 8.53041482e01, 2.78665729e01,
1.93645845e01]])
We are given as output an \(11\times4\) matrix, which is correct.
4.10.4. Adding Trainable Parameters¶
You can add trainable parameters to these steps by adding a weight matrix. Let’s do this for the selfattention. Although keys, values, and query are equal in selfattention, I can multiply them by different weights. Just to demonstrate, I’ll have the values change to feature dimension 1
# weights should be input feature_dim > desired output feature_dim
w_q = np.random.normal(size=(4, 4))
w_k = np.random.normal(size=(4, 4))
w_v = np.random.normal(size=(4, 1))
def trainable_self_attention(x, w_q, w_k, w_v):
q = x @ w_q
k = x @ w_k
v = x @ w_v
b = batched_tensor_dot(q, k)
return b @ v
trainable_self_attention(i_batched_query, w_q, w_k, w_v)
array([[ 1.29147728],
[ 1.11299888],
[0.2239204 ],
[ 7.26141651],
[ 0.27984206],
[ 1.51899201],
[ 0.43659525],
[ 2.85280709],
[ 2.34661508],
[ 1.68638971],
[ 0.27923148]])
Since we had our values change to feature dimension 1 with the weights, we get out an \(11\times 1\) output.
4.10.5. Multihead¶
The only change for multihead attention is that we have one set of weights for each head and we agree on how to combine after running through the heads. I’ll just take an average and use 2 heads. Other strategies are to concatenate them or use a different reduction (e.g., max).
w_q_h1 = np.random.normal(size=(4, 4))
w_k_h1 = np.random.normal(size=(4, 4))
w_v_h1 = np.random.normal(size=(4, 1))
w_q_h2 = np.random.normal(size=(4, 4))
w_k_h2 = np.random.normal(size=(4, 4))
w_v_h2 = np.random.normal(size=(4, 1))
def multihead_attention(x, w_q_h1, w_k_h1, w_v_h1, w_q_h2, w_k_h2, w_v_h2):
h1_out = trainable_self_attention(x, w_q_h1, w_k_h1, w_v_h1)
h2_out = trainable_self_attention(x, w_q_h2, w_k_h2, w_v_h2)
return (h1_out + h2_out) / 2
multihead_attention(i_batched_query, w_q_h1, w_k_h1, w_v_h1, w_q_h2, w_k_h2, w_v_h2)
array([[ 4.84889138],
[0.4447452 ],
[ 0.53426982],
[ 0.01857906],
[ 0.09033282],
[0.07120987],
[ 0.7824696 ],
[ 0.06376074],
[ 0.15288186],
[ 0.00954248],
[ 0.37410883]])
As expected, we do get an \(11\times1\)
4.11. Attention in Graph Neural Networks¶
Recall that the key attribute of a graph neural network is permutation invariance. We used reductions like sum or mean over neighbors as the way to make the graph neural network layers be permutation invariant. Attention layers are also permutation invariant! This has made attention a popular choice for how to aggregate neighbor information. Attention layers are good at finding important neighbors and so are important with highdegree graphs (lots of neighbors). This is rare in molecules, but you can just define all atoms to be connected and then put distances as the edge attributes. Recall that graph convolution layers (GCN layer), and most GNN layers, only allow information to propagate onebond per layer. Thus joining all atoms and using attention can give you longrange communication without so many layers. The disadvantage is that your network must now learn this, so perhaps you can reduce model bias but at the cost of requiring more training data/having more model variance.
Let’s see how attention fits into the Battaglia equations[BHB+18]. Recall that the Battaglia equations are general standard equations for defining a GNN. Attention can appear in multiple places, but as discussed above it appears when considering neighbors. Specifically, the query will be the \(i\)th node, and the keys/values will be some combination of neighboring node and edge features. There is no step in the Battaglia equations where this fits neatly, but we can split up the attention layer as follows. Most of the attention layer will fit into the edge update equation:
Recall that this is a general equation and our choice of \(\phi^e()\) defines the GNN. \(\vec{e}_k\) is the feature vector of edge \(k\), \(\vec{v}_{rk}\) is the receiving node feature vector for edge \(k\), \(\vec{v}_{sk}\) is the sending node feature vector for edge \(k\), \(\vec{u}\) is the global graph feature vector. We will use this step for attention mechanism where the query is the receiving node \(\vec{v}_{rk}\) and the keys/values are composed of the senders and edges vectors. To be specific, we’ll use the approach from Zhang et al. [ZSX+18] with a tensordot mechanism. They only considered node features and set the keys and values to be identical as the node features. However, they put trainable parameters at each layer that translated the node features in to the keys/query.
Putting it compactly into one equation:
Now we have weighted edge feature vectors from the attention. Finally, we sum over these edge features in the edge aggregation step.
In Zhang et al. [ZSX+18], they used multiheaded attention as well. How would multiheaded attention work? Your edge feature matrix \( E_i^{'}\) now becomes an edge feature tensor, where axis 0 is edge (\(k\)), axis 1 is feature, and axis 2 is the head. Recall that the “head” just means which set of \(\mathbf{W}^h_q, \mathbf{W}^h_k, \mathbf{W}^h_v\) we used. To reduce the tensor back to the expected matrix, we simply use another weight matrix that maps from the last two axes (feature, head) down to features only. I will writeout the indices explicitly to be more clear:
where \(j\) is edge feature input index, \(l\) is our output edge feature matrix, and \(k,h,i\) are defined as before. Transformer is another name for a network built on multiheaded attention, so you’ll also see transformer graph neural networks [MDM+20] building.
4.12. Chapter Summary¶
Attention layers are inspired by human ideas of attention, but is fundamentally a weighted mean reduction.
The attention layer takes in three inputs: the query, the values, and the keys. These inputs are often identical, where the query is one key and the keys and the values are equal.
They are good at modeling sequences, such as language.
The attention vector should be normalized, which can be achieved using a softmax activation function, but the attention mechanism equation is a hyperparameter.
Attention layers compute an attention vector with the attention mechanism, and then reduce it by computing the attentionweighted average.
Using hard attention (hardmax function) returns the maximum output from the attention mechanism.
The tensordot followed by a softmax is the most common attention mechanism.
Selfattention is achieved when the query, values, and the keys are equal.
Attention layers by themselves are not trainable.
Multihead attention block is a group of layers that splits to multiple parallel attentions.
4.13. Cited References¶
 BHB+18
Peter W Battaglia, Jessica B Hamrick, Victor Bapst, Alvaro SanchezGonzalez, Vinicius Zambaldi, Mateusz Malinowski, Andrea Tacchetti, David Raposo, Adam Santoro, Ryan Faulkner, and others. Relational inductive biases, deep learning, and graph networks. arXiv preprint arXiv:1806.01261, 2018.
 ZSX+18(1,2)
Jiani Zhang, Xingjian Shi, Junyuan Xie, Hao Ma, Irwin King, and DitYan Yeung. Gaan: gated attention networks for learning on large and spatiotemporal graphs. arXiv preprint arXiv:1803.07294, 2018.
 BP97
Shumeet Baluja and Dean A. Pomerleau. Expectationbased selective attention for visual monitoring and control of a robot vehicle. Robotics and Autonomous Systems, 22(3):329 – 344, 1997. Robot Learning: The New Wave. URL: http://www.sciencedirect.com/science/article/pii/S0921889097000468, doi:https://doi.org/10.1016/S09218890(97)000468.
 TG80
Anne M Treisman and Garry Gelade. A featureintegration theory of attention. Cognitive psychology, 12(1):97–136, 1980.
 LPM15(1,2)
MinhThang Luong, Hieu Pham, and Christopher D Manning. Effective approaches to attentionbased neural machine translation. arXiv preprint arXiv:1508.04025, 2015.
 VSP+17(1,2)
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is all you need. In Advances in neural information processing systems, 5998–6008. 2017.
 MDM+20
Łukasz Maziarka, Tomasz Danel, Sławomir Mucha, Krzysztof Rataj, Jacek Tabor, and Stanisław Jastrzębski. Molecule attention transformer. arXiv preprint arXiv:2002.08264, 2020.