liveBook · Manning

Support vector

As explained in Timeless Algorithms, The Foundational Ideas

A support vector is a training example that lies on the edge of the separating margin and helps determine the decision boundary.

A support vector is a training observation that lies on a margin boundary of a maximum-margin classifier. In a hard-margin SVM, the condition is yᵢ(wᵀxᵢ + b) = 1, where yᵢ is the class label and wᵀxᵢ + b defines the decision boundary. section 8.2.2

These observations constrain the margin’s width and determine the boundary’s position. Moving a support vector may change the fitted boundary; sufficiently distant training observations do not directly determine it. section 8.2.2

The same idea appears algebraically in the fitted weight vector: w = ∑ᵢ αᵢyᵢxᵢ. A training observation is a support vector when its coefficient αᵢ is positive; observations with zero coefficients contribute nothing. section 8.5.1

A threshold between safe and unsafe readings

For temperature readings separated by a threshold, the nearest safe and unsafe observations are support vectors. Placing the threshold midway between them maximizes the margin. section 8.1.1

Figure 8.1 Temperature readings appear along a single horizontal axis, increasing from left to right. Circles represent safe conditions, and squares represent unsafe conditions. The vertical dashed line is the decision boundary. The nearest observation on each side is a support vector, and the distance between the boundary and these points defines the margin on either side. Positioning the boundary midway between the support vectors produces the maximum-margin separator.

The diagram shows how the nearest observations anchor the decision boundary and define the margin. section 8.1.1

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines support vectors geometrically and through nonzero coefficients, focusing on hard-margin behavior rather than soft-margin violations.
Examples
Uses safe and unsafe temperature readings and a two-dimensional weight-vector reconstruction to illustrate support vectors.
What it assumes
Assumes labeled observations and introduces support-vector geometry through separable data and a hard-margin classifier.
What you can do after
Understand how support vectors constrain a classifier’s margin and contribute to its fitted weight vector.
How it connects
Connects support vectors to support vector machines, maximum-margin classifiers, hyperplanes, margins, and optimization coefficients.

Also explained in

Compare how 2 books explain support vector →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.