Training data, margin, and support vectors
The solid line is the SVM boundary; the two thin dashed lines flanking it are the margin (z = ±1). Outlined points are support vectors — the only points with any pull on the current weights.
Chapter 5 · Learning Decision Boundaries
Same 2 features, same rain days as SGD vs. LDA — cloud cover and humidity. This time the classifier doesn't just want to land on the correct side of the boundary; it wants a wide, empty buffer around it. Only the points inside that buffer — the support vectors — ever push the boundary. Step through the arithmetic and watch which points are outlined.
The exact same three rain-day sets as SGD vs. LDA — pick a shape and watch the margin and support vectors change.
The solid line is the SVM boundary; the two thin dashed lines flanking it are the margin (z = ±1). Outlined points are support vectors — the only points with any pull on the current weights.
Most recent completed update first — z, margin, and whether the point was a support vector (SV) this round.
| # | cloud, humidity | y | z | margin | SV? | w₁, w₂, b (after) |
|---|
w a little toward zero (the λw term — this is what widens the margin), and only the points that are inside the margin or misclassified (margin = y·z < 1) also get to pull the boundary toward them. That's why most points end each round with no visible effect: once a point is safely past the margin, it stops mattering, no matter how far past it is. Raise λ and watch the margin widen and the support-vector count shrink to just the closest few points on each side; lower it toward 0 and the boundary chases every training point, margin included, the way SGD's perceptron does. LDA's dashed line is the same fixed closed-form reference used across Chapter 5 — see Salmon or Seabass for its probabilistic derivation.