Chapter 10 I.10
Gated Recurrence: LSTM and GRU
A gate gives the gradient a road home that no weight matrix stands on, which slows the decay without abolishing it.
Add a path along which information travels unchanged unless something explicitly erases it.
How this chapter is built
M3Load-bearing
The content is mathematics. Understanding is demonstrated by computation, not recall.
Five strands, not one. Mathematics is the spine; the other four are the body. A chapter cannot pay its way out of teaching with problems, nor out of problems with teaching.
Before you start
The problem
The vanishing gradient of I.9 is a property of repeated multiplication. The repair is not a better initialisation but a different architecture: an additive path whose derivative is a gate value rather than a Jacobian product.
Apparatus
The mathematics this chapter leans on, held in Book 0 so it can be assumed here without being taught here. Not a gate — follow a link when a step stops making sense.
Notation
- TSequence length in tokens
- dModel width
- WA weight matrix
- σThe logistic function, or a standard deviation
- ∇Gradient operator
Propositions
Worked problems
0/5 problems0/4 variants0/10 exercisesowes 15 more
Not yet written. At M3 this chapter owes 5 worked problems across 4 distinct variants, and 10 exercises, every one with a published solution. The build enforces that from the day the chapter is marked published.