The softmax Jacobian as a variance, and saturation
ProofIntermediate⏱ 30 minDeep Learningsoftmaxjacobiansaturationgradient
Problem
Prove and deduce that the softmax Jacobian's operator norm is at most , vanishing as becomes one-hot. Relate to temperature and to attention saturation.
Write a complete argument. Every inequality you use should be one you could state precisely.
Solution
Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.
Related problems
All problems| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| The cross-entropy gradient is the prediction error | LLMs | Proof | 15 min | ||
| When does attention dominate the MLP? | Deep Learning | Numerical | 30 min | ||
| Attention is permutation equivariant | Deep Learning | Proof | 30 min | ||
| Gradient magnitude through a deep chain | Deep Learning | Proof | 30 min | ||
| Implement multi-head attention from scratch run | Deep Learning | Coding | 3 hours |