To turn a network’s raw scores into a probability distribution over classes, exponentiate and normalize: softmax(x)ᵢ = eˣᵢ / Σ eˣʲ. Every output lands in (0,1) and they sum to 1, with the largest score getting the lion’s share — a soft, differentiable version of “pick the max.” It is the final layer of nearly every classifier, and the same Boltzmann form that statistical physics uses for states.
The demo softmaxes [1,2,3] — the outputs sum to 1, the biggest score wins: live demo
“Softmax picks the maximum.” — it is a soft argmax: every class keeps some probability, which is what makes it differentiable and trainable. cited
Scores, turned into a distribution. activation
On i-13, softmax([1,2,3]) = [0.090, 0.245, 0.665] — sums to 1, monotone, largest score dominant: