ReLU and the Dead-Unit Problem

How a network computes, why gradients vanish, and what makes depth trainable

ReLU is the shortest activation there is: keep the input if it is positive, otherwise return 0. Written out, ReLU(x) = max(0, x). No exponential, no division, and no ceiling on its derivative. Swapping it in for the sigmoid is most of the reason deep networks became trainable.

๐Ÿ”’ This is a Pro lesson โ€” the interactive figure, worked examples, quiz and practice open with Pro access.

โ–ถ ReLU and the Dead-Unit Problem
โ† Sigmoid and Tanh: the Saturation TrapGELU, SiLU and Smooth Gates โ†’