Transformer¶
Start tokens, vectors, attention, positions and residuals, then one small implementation. A research paper is a later reference rather than the full prerequisite course.
| Depth | Topic | Completion |
|---|---|---|
| P1 | Attention, Q/K/V, positions, residuals and normalization | Trace data and tensor shapes |
| P2 | ViT, cross-modal, long-context, sparse/linear attention | Define tasks/resources before comparison |
| P2 | MoE and efficient implementation | Separate conditional compute, architecture and kernels |
Selected resources¶
-
Implementation · Karpathy Zero to Hero
Code-first backbone from makemore to GPT; implement embeddings, causal attention and residual streams from scratch.
-
Visual Intuition · 3Blue1Brown Attention
Premier geometric visualization explaining Query, Key, Value vectors and multi-head projection spaces.
Core mechanistic intuition · Soft routing & tensor flow¶
- Intuition: Self-attention is fundamentally content-based dynamic weighted information retrieval (soft routing). Each token projects a Query (what information am I seeking?) and a Key (what features do I contain?), computing attention affinities via inner products to aggregate Values (what information payload do I carry?).
- Minimal tensor pipeline:
- Input embedding: \(X \in \mathbb{R}^{B \times T \times D}\)
- Linear projections: \(Q = X W_Q,\; K = X W_K,\; V = X W_V \in \mathbb{R}^{B \times T \times D}\)
- Attention map: \(A = \text{Softmax}\left(\frac{Q K^T}{\sqrt{d_k}}\right) \in \mathbb{R}^{B \times T \times T}\) (explicit all-to-all dependency graph)
- Value aggregation & output projection: \(O = A V W_O \in \mathbb{R}^{B \times T \times D}\)
- Trade-offs: Capturing unrestricted global dependencies requires \(O(T^2)\) pairwise interactions. In autoregressive inference, the memory bottleneck shifts from compute to KV Cache memory footprint and memory bandwidth limits.
Check yourself · Critical thinking¶
- What is the mathematical purpose of the scaling factor \(\sqrt{d_k}\)? What happens to the Softmax gradient when \(d_k\) is large without scaling?
- How does a causal mask operate at the matrix arithmetic level, and why is an architectural mask necessary rather than relying solely on the loss function?
- Why does Pre-LN (normalizing before the sub-layer) offer significantly smoother gradient flow in deep networks compared to original Post-LN?
Revisit papers and historical bookmarks after implementing the small model.
Related topics¶
Earlier reading bookmarks (optional)

GET STARTED¶
DIVING DEEPER¶
-
Illustrated Guide to Transformers Neural Network: A step by step explanation🏆
A really good one, concise and clear!
-
Transformers (how LLMs work) explained visually | DL5🏆
-
Attention in transformers, step-by-step | DL6🏆
-
How might LLMs store facts | DL7🏆
-
Attention is all you need (Explanation CN)
PRACTICE¶
-
annotated-transformer
-
transformer tutorial🎯🏆