The finale separates exact score mechanics from named probability and loss boundaries. It closes with the explicit honesty boundary for this book.

highlighted = computed this step

What is exact

The score z and the threshold decision are exact. The boundary is z=0.

z=wx+b,z=0z=w x+b,\quad z=0
Exact decision mechanicsScores, threshold, named probabilities, and boundary remain visible.Classifier score tablexyzdecisionprob00-20σ(-2)10-10σ(-1)21011/23111σ(1)sigmoid is named except at zeroDecision boundaryThe exact point where the score is zero.ABCDz=0

What is named

The probability column names sigmoid except at the exact midpoint 1/2. Log-loss also names logarithm.

σ,ln are named boundary ops\sigma,\ln\text{ are named boundary ops}
Exact decision mechanicsScores, threshold, named probabilities, and boundary remain visible.Classifier score tablexyzdecisionprob00-20σ(-2)10-10σ(-1)21011/23111σ(1)sigmoid is named except at zeroDecision boundaryThe exact point where the score is zero.ABCDz=0

Summary

This is not calibration, not accuracy, and not learning; it pins the decision mechanics on toy data.

toy-data decision mechanics only\text{toy-data decision mechanics only}
Exact decision mechanicsScores, threshold, named probabilities, and boundary remain visible.Classifier score tablexyzdecisionprob00-20σ(-2)10-10σ(-1)21011/23111σ(1)sigmoid is named except at zeroDecision boundaryThe exact point where the score is zero.ABCDz=0