Transformers using Named Tensor Notation

written by @marc_lelarge

We are using the Named Tensor Notation from David Chiang, Alexander M. Rush and Boaz Barak to describe the basic (i.e. without position encoding and autoregressive mask) encoder block of Transformers defined in Attention Is All You Need by Vaswani et al.

For a presentation of attention mechanism and transformers, see Module 12 - Attention and Transformers

Basics about Named Tensor Notation

These notations should feel natural as it implements the elementwise operations, broadcasting, reductions and contractions natural in numpy and PyTorch.
Perhaps, we should recall that functions from vectors to vectors lift to functions on tensors that operate along one axis but leave the tensor shape unchanged. For example, the following softmax function defined by

$$\begin{array}{rl}\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{softmax}}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}}& \to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}}\\ \underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{softmax}}(X)& =\frac{\exp (X)}{\sum _{\phantom{\mathsf{fg}}\mathsf{ax}}\exp (X)}\end{array}$$
will act on any

$X\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}\times \phantom{\mathsf{fg}}\mathsf{bx}}$ so that

$\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{softmax}}(X)=Y\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}\times \phantom{\mathsf{fg}}\mathsf{bx}}$ is such that

$\sum _{\phantom{\mathsf{fg}}\mathsf{ax}}Y=\mathbf{1}\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{bx}}$. The function

$\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{softmax}}$ is only defined for tensors having an axis named

$\phantom{\mathsf{fg}}\mathsf{ax}$, this is the meaning of the line:

$\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{softmax}}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}}\to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}}$. Note in particular, that

${\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}}$ is NOT the domain of definition of the function, it contains the minimal set of named axis required to apply the function.

Recall that elmentwise multiplication is denoted by

$\underset{\begin{array}{}\end{array}}{\phantom{fg}\odot }$ and the dot-product along axis

$\phantom{\mathsf{fg}}\mathsf{ax}$ is denoted

$\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\odot }$. Here is one example taken from the original paper:

$$\begin{array}{r}A=\phantom{\mathsf{fg}}\mathsf{height}\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{width}\\ \left[\begin{array}{ccc}3& 1& 4\\ 1& 5& 9\\ 2& 6& 5\end{array}\right]\end{array}\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{height}\times \phantom{\mathsf{fg}}\mathsf{width}},\end{array}$$
and

$$\begin{array}{rl}x& =\phantom{\mathsf{fg}}\mathsf{height}\begin{array}{c}\\ \left[\begin{array}{c}2\\ 7\\ 1\end{array}\right]\end{array}\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{height}}.\end{array}$$
Then, we have

$$\begin{array}{r}A\underset{\begin{array}{}\end{array}}{\phantom{fg}\odot }x=\phantom{\mathsf{fg}}\mathsf{height}\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{width}\\ \left[\begin{array}{ccc}3\cdot 2& 1\cdot 2& 4\cdot 2\\ 1\cdot 7& 5\cdot 7& 9\cdot 7\\ 2\cdot 1& 6\cdot 1& 5\cdot 1\end{array}\right]\end{array}\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{height}\times \phantom{\mathsf{fg}}\mathsf{width}},\end{array}$$
and

$$\begin{array}{r}A\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{height}\end{array}}{\phantom{fg}\odot }x=\sum _{\phantom{\mathsf{fg}}\mathsf{height}}A\underset{\begin{array}{}\end{array}}{\phantom{fg}\odot }x=\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{width}\\ \left[\begin{array}{ccc}6+7+2& 2+35+6& 8+49+5\end{array}\right]\end{array}\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{width}},\end{array}$$
corresponding to the standard matrix multiplication.

Linear layers

For

$W\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}\times \phantom{\mathsf{fg}}\mathsf{bx}}$ and

$b\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{bx}}$, we define a linear layer by:

$$\begin{array}{rl}{\mathrm{LN}}_{\mathrm{W}}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}}& \to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{bx}}\\ {\mathrm{LN}}_{\mathrm{W}}(X)& =X\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\odot }W+b\end{array}$$

Note that if

$X\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}\times \phantom{\mathsf{fg}}\mathsf{seq}}$, then we have

${\mathrm{LN}}_{\mathrm{W}}(X)\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{bx}\times \phantom{\mathsf{fg}}\mathsf{seq}}$.

Feedforward neural networks

Now a feedforward neural network is defined for

$W_1\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}\times \phantom{\mathsf{fg}}\mathsf{hidden}}$,

$b_1\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{hidden}}$ and

$W_2\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{hidden}\times \phantom{\mathsf{fg}}\mathsf{bx}}$,

$b_2\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{bx}}$ as:

$$\begin{array}{rl}\mathrm{FFN}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}}& \to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{bx}}\\ \mathrm{FFN}(X)& =\mathrm{ReLU}(X\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\odot }{W}_1+b_1)\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{hidden}\end{array}}{\phantom{fg}\odot }{W}_2+b_2\end{array}$$

Again, if

$X\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}\times \phantom{\mathsf{fg}}\mathsf{seq}}$, then we have

$\mathrm{FFN}(X)\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{bx}\times \phantom{\mathsf{fg}}\mathsf{seq}}$.

Attention and SelfAttention

$$\begin{array}{rl}\text{Attention}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{key}}\times {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{seq}\times \phantom{\mathsf{fg}}\mathsf{key}}\times {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{seq}\times \phantom{\mathsf{fg}}\mathsf{val}}& \to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{val}}\\ \text{Attention}(Q,K,V)& =(\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{seq}\end{array}}{\phantom{fg}\mathrm{softmax}}\frac{Q\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{key}\end{array}}{\phantom{fg}\odot }K}{\sqrt{|\phantom{\mathsf{fg}}\mathsf{key}|}})\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{seq}\end{array}}{\phantom{fg}\odot }V.\end{array}$$

This definition takes a single query

$Q$ vector and returns a single result vector (and actually could be further reduced to a scalar values as

$\phantom{\mathsf{fg}}\mathsf{val}$ is not strictly necessary). To apply to a sequence, we can give

$Q$ a

${\phantom{\mathsf{fg}}\mathsf{seq}}^{\prime }$ axis, and the function will compute an output sequence. Providing

$Q$,

$K$, and

$V$ with a

$\phantom{\mathsf{fg}}\mathsf{heads}$ axis lifts the function to compute multiple attention heads.

We can now define SelfAttention. Let

$W_Q\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{key}}$,

$b_Q\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{key}}$,

$W_K\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{key}}$,

$b_K\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{key}}$ and

$W_V\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{val}}$,

$b_V\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{val}}$, with

$|\phantom{\mathsf{fg}}\mathsf{val}|=|\phantom{\mathsf{fg}}\mathsf{chans}|$:

$$\begin{array}{rl}\text{SelfAttention}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{seq}}& \to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{val}\times \phantom{\mathsf{fg}}\mathsf{seq}}\\ \text{SelfAttention}(X)& =\text{Attention}({\mathrm{LN}}_{\mathrm{Q}}(X),{\mathrm{LN}}_{\mathrm{K}}(X),{\mathrm{LN}}_{\mathrm{V}}(X)),\end{array}$$
where

${\mathrm{LN}}_{\mathrm{Q}}$ (resp.

${\mathrm{LN}}_{\mathrm{K}}$ and

${\mathrm{LN}}_{\mathrm{V}}$) are linear layers associated with

$W_Q$ (resp.

$W_K$ and

$W_V$).
Note that the names of the output are

$\phantom{\mathsf{fg}}\mathsf{seq}$ and

$\phantom{\mathsf{fg}}\mathsf{val}$ and to be able to add this to the input we need to rename

$\phantom{\mathsf{fg}}\mathsf{val}\to \phantom{\mathsf{fg}}\mathsf{chans}$ and this is possible because

$|\phantom{\mathsf{fg}}\mathsf{val}|=|\phantom{\mathsf{fg}}\mathsf{chans}|$. So that in the end, we can do

$$\begin{array}{r}X+\mathrm{SelfAttention}(X{)}_{\phantom{\mathsf{fg}}\mathsf{val}\to \phantom{\mathsf{fg}}\mathsf{chans}}\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{seq}}\end{array}$$

Normalization Layers

We can define a single generic standardization function as:

$$\begin{array}{rl}\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{standardize}}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}}& \to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}}\\ \underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{standardize}}(X)& =\frac{X-\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{mean}}(X)}{\sqrt{\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{var}}(X)+ϵ}}\end{array}$$
where

$ϵ>0$ is a small constant for numerical stability.

Note that

$$\begin{array}{r}\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{mean}}(X)=\frac{1}{|\phantom{\mathsf{fg}}\mathsf{ax}|}\sum _{\phantom{\mathsf{fg}}\mathsf{ax}}X,\end{array}$$
so that if

$X\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}\times \phantom{\mathsf{fg}}\mathsf{bx}}$, then

$\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{mean}}(X)\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{bx}}$ and we are using broadcasting when we write

$X-\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{ax}\end{array}}{\phantom{fg}\mathrm{mean}}(X)\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{ax}\times \phantom{\mathsf{fg}}\mathsf{bx}}$ in the numerator above and similarly for the denominator.

Then, we can define the three kinds of normalization layers, all with type

${\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{batch}\times \phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{layer}}\to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{batch}\times \phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{layer}}$:

$$\begin{array}{rlrl}\text{BatchNorm}(X;\gamma ,\beta )& =\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{batch},\phantom{\mathsf{fg}}\mathsf{layer}\end{array}}{\phantom{fg}\mathrm{standardize}}(X)\underset{\begin{array}{}\end{array}}{\phantom{fg}\odot }\gamma +\beta & \gamma ,\beta & \in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}}\\ \text{InstanceNorm}(X;\gamma ,\beta )& =\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{layer}\end{array}}{\phantom{fg}\mathrm{standardize}}(X)\underset{\begin{array}{}\end{array}}{\phantom{fg}\odot }\gamma +\beta & \gamma ,\beta & \in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}}\\ \text{LayerNorm}(X;\gamma ,\beta )& =\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{layer},\phantom{\mathsf{fg}}\mathsf{chans}\end{array}}{\phantom{fg}\mathrm{standardize}}(X)\underset{\begin{array}{}\end{array}}{\phantom{fg}\odot }\gamma +\beta & \gamma ,\beta & \in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{layer}}\end{array}$$
Note that the shape of the output is always the same as the shape of the input for normalization layers.

For transformers, we will use a particular LayerNorm where

$|\phantom{\mathsf{fg}}\mathsf{layer}|=1$, so that we can simplify it as follows:

$$\begin{array}{rl}\text{LayerNorm}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}}& \to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}}\\ \text{LayerNorm}(X)& =\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{chans}\end{array}}{\phantom{fg}\mathrm{standardize}}(X)\underset{\begin{array}{}\end{array}}{\phantom{fg}\odot }\gamma +\beta & \gamma ,\beta & \in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}}\end{array}$$

A simple Transformer block

To simplify, we omit multiple heads here. We also present the pre-LN Transformer (see On Layer Normalization in the Transformer Architecture by Xiong et al.) where LayerNorm are put before SelfAttention and Feed Forward Network.

$$\begin{array}{rl}X& \in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{seq}}\\ X_1& =\text{LayerNorm}(X)\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{seq}}\\ X_2& =X+\mathrm{SelfAttention}(X_1{)}_{\phantom{\mathsf{fg}}\mathsf{val}\to \phantom{\mathsf{fg}}\mathsf{ax}}\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{seq}}\\ Y& =X_2+\mathrm{FFN}(\text{LayerNorm}(X_2))\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{seq}}\end{array}$$

Note that we take the simple version of LayerNorm with

$|\phantom{\mathsf{fg}}\mathsf{layer}|=1$. The values of the axis

$\phantom{\mathsf{fg}}\mathsf{seq}$ are mixed only in the SelfAttention layer.

Summary

$$\begin{array}{rl}\text{LayerNorm}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}}& \to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}}\\ \text{LayerNorm}(X)& =\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{chans}\end{array}}{\phantom{fg}\mathrm{standardize}}(X)\underset{\begin{array}{}\end{array}}{\phantom{fg}\odot }\gamma +\beta & \gamma ,\beta & \in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}}\end{array}$$

$$\begin{array}{rl}\text{Attention}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{key}}\times {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{seq}\times \phantom{\mathsf{fg}}\mathsf{key}}\times {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{seq}\times \phantom{\mathsf{fg}}\mathsf{val}}& \to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{val}}\\ \text{Attention}(Q,K,V)& =(\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{seq}\end{array}}{\phantom{fg}\mathrm{softmax}}\frac{Q\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{key}\end{array}}{\phantom{fg}\odot }K}{\sqrt{|\phantom{\mathsf{fg}}\mathsf{key}|}})\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{seq}\end{array}}{\phantom{fg}\odot }V.\end{array}$$
Let

$W_Q,W_K\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{key}}$,

$b_Q,b_K\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{key}}$, and

$W_V\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{val}}$,

$b_V\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{val}}$, with

$|\phantom{\mathsf{fg}}\mathsf{val}|=|\phantom{\mathsf{fg}}\mathsf{chans}|$:

$$\begin{array}{rl}\text{SelfAttention}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{seq}}& \to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{val}\times \phantom{\mathsf{fg}}\mathsf{seq}}\\ \text{SelfAttention}(X)& =\text{Attention}(X\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{chans}\end{array}}{\phantom{fg}\odot }{W}_Q+b_Q,X\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{chans}\end{array}}{\phantom{fg}\odot }{W}_K+b_K,X\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{chans}\end{array}}{\phantom{fg}\odot }{W}_V+b_V)\end{array}$$

$$\begin{array}{rl}\mathrm{FFN}:{\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}}& \to {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}}\\ \mathrm{FFN}(X)& =\mathrm{ReLU}(X\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{chans}\end{array}}{\phantom{fg}\odot }{W}_1+b_1)\underset{\begin{array}{c}\phantom{\mathsf{fg}}\mathsf{hidden}\end{array}}{\phantom{fg}\odot }{W}_2+b_2\end{array}$$

$$\begin{array}{rl}X& \in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{seq}}\\ X_1& =\text{LayerNorm}(X)\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{seq}}\\ X_2& =X+\mathrm{SelfAttention}(X_1{)}_{\phantom{\mathsf{fg}}\mathsf{val}\to \phantom{\mathsf{fg}}\mathsf{ax}}\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{seq}}\\ Y& =X_2+\mathrm{FFN}(\text{LayerNorm}(X_2))\in {\mathbb{R}}^{\phantom{\mathsf{fg}}\mathsf{chans}\times \phantom{\mathsf{fg}}\mathsf{seq}}\end{array}$$

For a presentation of attention mechanism and transformers, see Module 12 - Attention and Transformers

tags: public dataflowr transformers