A unit that can never come back
counterexample▲▲△Exact.
STATEMENT
Construct explicit weights and a bias for which a ReLU unit’s gradient is exactly zero for every input in the dataset, forever. Then show LeakyReLU repairs it, and quantify how long the repair takes.
GIVEN
A ReLU unit with inputs drawn from . Downstream the unit feeds a loss with of order .
FIND
A making the unit permanently dead; a proof that no update revives it; and the number of steps LeakyReLU needs to recover, at a stated learning rate.
STRATEGY
Make the pre-activation negative on the whole input domain, then trace the gradient backwards and observe that it is zero at the first multiplication.
SOLUTION
Step 1 — the construction. Take
For any the pre-activation is
always negative, with a margin of at least from the kink.
Step 2 — the output is always zero. for every input in the domain. The unit contributes nothing to any prediction.
Step 3 — the gradient is always zero. By the chain rule, the gradient reaching the weights is
and identically . Whatever the downstream error, it is multiplied by zero at this unit.
Step 4 — the death is permanent. Any gradient-based update has the form . Since the gradient is , the update is . The parameters cannot move, so stays in , so the gradient stays zero. The state is a fixed point of training. No learning rate, no schedule, no optimiser and no amount of data changes it. Momentum does not help either: momentum accumulates past gradients, and every past gradient was also zero.
The only escapes are external — weight decay pulling toward zero, or a different unit’s weights changing the input distribution — and neither is a property of this unit’s own learning.
Step 5 — LeakyReLU repairs it. With for and otherwise, the derivative on the negative side is rather than . Now
Small, but not zero — and a small nonzero gradient applied repeatedly moves.
Step 6 — how long. Suppose on average (the loss wants this unit’s output larger) and . Each step moves the bias by
To raise from to , where the unit begins firing on part of the domain, needs
The honest reading. LeakyReLU converts impossible into slow. Ninety thousand steps is a real cost, and it is why the slope is often set to rather than — which cuts the recovery to steps — and why careful initialisation, which prevents the death in the first place, matters more than the repair.
Answer
, over gives always, hence and always. The state is a fixed point of gradient descent, so the unit is permanently dead.
LeakyReLU recovers it in about steps at with unit downstream gradient; at slope , about .
Check — sanity
The margin is comfortable. The largest possible pre-activation is , not . So this is not a knife-edge construction that a single unusual input could disturb — the whole domain is units from the kink.
The zero is structural, not numerical. exactly for , not approximately. There is no underflow here and no precision to recover: the arithmetic is exact and the answer is exactly zero.
The LeakyReLU arithmetic is dimensionally right. is (downstream gradient) (slope) , three dimensionless factors, giving per step in the units of . And . ✓
Where this breaks
The construction needs the input domain to be bounded. On unbounded inputs — an unnormalised feature that occasionally reaches — the unit is not dead, merely almost always silent, and it will receive a gradient on the rare examples that wake it. That is a different and much less severe failure, and it is one reason input normalisation (III.1) changes the character of this problem rather than only its magnitude.
Variation
Show that a GELU unit in the same state is never exactly dead, by computing . Then say whether the gradient it does receive is large enough to matter, and compare with LeakyReLU’s .