The cross-entropy gradient is the prediction error
ProofBeginner⏱ 15 minLLMssoftmaxcross entropygradientfused kernel
Problem
Show for with , and explain why softmax and cross-entropy are implemented as a single fused operation.
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 |
|---|---|---|---|---|---|
| Maximum likelihood is KL minimisation | LLMs | Proof | 15 min | ||
| Perplexity is not comparable across tokenisers | LLMs | Numerical | 15 min | ||
| The irreducible loss is the conditional entropy | LLMs | Proof | 30 min | ||
| The softmax Jacobian as a variance, and saturation | Deep Learning | Proof | 30 min | ||
| The softmax Jacobian is a covariance | Foundations | Proof | 30 min |