Many thanks to everyone who provided helpful feedback, particularly Aryan Bhatt and Lawrence Chan!
This is my illustrated walkthrough of induction heads. I created it in order to concisely capture all the information about how the circuit works.
There are 2 versions of the walkthrough:
- Version 1 is the one included in this post. It's slightly shorter, and focuses more on the intuitions than the actual linear operations going on.
- Version 2 can be found at my personal website. It has all the same stuff as version 1, with a bit of added info about the mathematical details, and how you might go about reverse-engineering this circuit in a real model.
The final image from version 1 is inline below, and depending on your level of familiarity with transformers, looking at this diagram might provide most of the value of this post. If it doesn't make sense to you, then read on for the full walkthrough, where I build up this diagram bit by bit.
Induction heads are a well-studied and understood circuit in transformers. They allow a model to perform in-context learning, of a very specific form: if a sequence contains a repeated subsequence e.g. of the form
A B ... A B (where
B stand for generic tokens, e.g. the first and last name of a person who doesn't appear in any of the model's training data), then the second time this subsequence occurs the transformer will be able to predict that
A. Although this might seem like weirdly specific ability, it turns out that induction circuits are actually a pretty massive deal. They're present even in large models (despite being originally discovered in 2-layer models), they can be linked to macro effects like bumps in loss curves during training, and there is some evidence that induction heads might even constitute the mechanism for the actual majority of all in-context learning in large transformer models.
I think induction heads can be pretty confusing unless you fully understand the internal mechanics, and it's easy to come away from them feeling like you get what's going on without actually being able to explain things down to the precise details. My hope is that these diagrams help people form a more precise understanding of what's actually going on.
This post is aimed at people who already understand how a transformer is structured (I'd recommend Neel Nanda's tutorial for that), and the core ideas in the Mathematical Framework for Transformer Circuits paper. If you understand everything on this list, it will probably suffice:
- The central object in the transformer is the residual stream.
- Different heads in each layer can be thought of as operating independently of each other, reading and writing into the residual stream.
- Heads can compose to form circuits. For instance, -composition is when the output of one head is used to generate the key vector in the attention calculations of a subsequent head.
- We can describe the weight matrices , and as reading from (or projecting from) the residual stream, and as writing to (or embedding into) the residual stream.
- We can think of the combined operations and in terms of a single, low-rank matrix , called the QK circuit.
- This matrix defines a bilinear form on the vectors in the residual stream: is the attention paid by the th token to the th token.
- Conceptually, this matrix tells us which tokens information is moved to & from in the residual stream.
- We can think of the combined operations and in terms of a single matrix , called the OV circuit.
- This matrix defines a map from residual stream vectors to residual stream vectors: if is the residual stream vector at the source token, then is the vector that gets moved from token to the destination token (if is attended to).
- Conceptually, this matrix tells us what information is moved from a token, if that token is attended to.
Basic concepts of linear algebra (e.g. understanding orthogonal subspaces and the image / rank of linear maps) would be also be helpful.
Now for the diagram! (You might have to zoom in to read it clearly.)
Note - part of the reason I wrote this is as a companion piece to other material / as a useful thing to refer to while explaining how induction heads work. I'm not totally sure how well it will function as a stand-alone explanation, and I'd be grateful for feedback!
Finally, here is a diagram just like the final one above, but which uses Q-composition rather than K-composition. The result is the same, however these heads seem to form less easily than K-composition because they require pointer arithmetic, meaning that they move positional information between tokens and does operations on it, to figure out which tokens to attend to. (although a lot of this is down to architectural details of the transformer).
Note that I'm using notation corresponding to the
TransformerLenslibrary, not to the Anthropic paper (this is because I'm hoping this post will help people who are actually working with the library). In particular, I'm following the convention that weight matrices multiply on the right. For instance, if is a vector in the residual stream and is the query projection matrix then is the query vector. This is also why the QK circuit is different here than in the Anthropic paper.
This terminology is also slightly different from the Anthropic paper. The paper would call the QK circuit, whereas I'm adopting Neel's notation of calling the QK circuit and calling something a full circuit if it includes the or matrices.
Again, this is different than the Anthropic paper because of the convention that we're right-multiplying matrices. is the value vector (of size
d_head) and is the embedding of this vector back into the residual stream. So is the OV circuit.
I described subtracting one from the positional embedding as a "rotation". This is because positional embeddings are often sinusoidal (either because they're chosen to be sinusoidal at initialisation, or because they develop some kind of sinusoidal structure as the model trains).
For example, if you specify
shortformer=Truewhen loading in transformers from
TransformerLens, this means the positional embeddings aren't added to the residual stream, but only to the inputs to the query and key projection matrices (i.e. not to the the inputs to the value projection matrices ). This means positional information can be used in calculating attention patterns, but can't itself be moved around to different tokens. You can see from the diagram how this makes Q-composition impossible (because the positional encodings need to be moved as part of the OV circuit, in the first attention head).
That being said, it seems transformers seem to be able to rederive positional information, so they could in theory form induction heads via Q-composition with this rederived information. To my knowledge there's currently no evidence of this happening, but it would be interesting!
Thanks, the first diagram worked just as suggested: I have enough exposure to transformer internals that a few minutes of staring was enough to understand the algorithm. I'd always wondered why it is that GPT is so strangely good at repetition, and now it makes perfect sense.
Awesome, really glad to hear it was helpful, thanks for commenting!
This seems like a typo:
(Surely you meant QK!)
Yep, fixed, thanks!