Decision boundaries
A classifier divides the input space into regions, one per predicted class. The border between regions is the decision boundary. For logistic regression the boundary is where , which is where : a straight line in 2-D, a plane in 3-D, a hyperplane in general. The weight vector is perpendicular to it, pointing toward the positive class.
A straight boundary is a real limitation. If the positive class forms a ring around the negatives, no line separates them. You can either engineer features (add and the ring becomes separable) or use a model that learns non-linear boundaries: neighbours and trees in the next unit, neural networks in module 4. A neural network classifier is, in effect, logistic regression on top of features it learns itself.
More than two classes: softmax
With classes, give each class its own weight vector and compute logits . The softmax turns them into a probability distribution: exponentiate (making everything positive) and normalise (making them sum to 1):
- With , softmax reduces exactly to the sigmoid of the difference of the two logits.
- Adding the same constant to every logit changes nothing, because it cancels in the ratio. Implementations subtract the maximum logit before exponentiating so that never overflows: is infinity in floating point, but .
- The loss is categorical cross-entropy, , and its gradient with respect to the logits is again prediction minus truth: .
Softmax regression (multinomial logistic regression) has decision boundaries that are straight lines between every pair of classes. It is also, exactly, the final layer of nearly every neural network classifier: an image model's last layer is a softmax over 1,000 ImageNet classes, and a language model's is a softmax over its whole vocabulary.
Linear classifiers draw straight boundaries. Softmax generalises the sigmoid to classes and sits at the end of almost every neural network classifier.