Learning Goal - Cross-Entropy Cost Function
5 important questions on Learning Goal - Cross-Entropy Cost Function
What is the learning slowdown problem with the quadratic cost function?
∂C/∂w ∝ σ'(z) · (a − y)
When a neuron is badly wrong (output saturated near 0 or 1), the sigmoid is nearly flat — σ'(z) ≈ 0 — which drives the gradient to near zero. The network barely updates its weights even though its output is very wrong.
This is the learning slowdown: worst performance → slowest learning.
Write the cross-entropy cost function. What makes it different from the quadratic cost?
Where a = σ(z) is the network's output and y is the target.
Key difference: it is always non-negative and approaches zero as the network learns. Crucially, its gradient does not contain σ'(z), so it avoids the learning slowdown.
Why does cross-entropy eliminate the σ'(z) slowdown? Walk through the algebra intuition.
∂C/∂wⱼ = (1/n) Σₓ xⱼ · (σ(z) − y)
The learning rate is now controlled solely by the error (σ(z) − y): bigger mistake → faster learning. The flat regions of the sigmoid no longer slow things down.
- Higher grades + faster learning
- Never study anything twice
- 100% sure, 100% understanding
Cross-entropy learning mirrors human learning. How?
When should you use cross-entropy instead of quadratic cost?
1. It avoids the learning slowdown from saturation
2. Its gradient has a clean probabilistic interpretation
3. It remains positive and well-behaved throughout training
The quadratic cost is only preferable in narrow cases (e.g., regression with linear output neurons, where there is no sigmoid and no saturation issue).
The question on the page originate from the summary of the following study material:
- A unique study and practice tool
- Never study anything twice again
- Get the grades you hope for
- 100% sure, 100% understanding

















