liveBook · Manning

Hyperplane

As explained in Timeless Algorithms, The Foundational Ideas

A hyperplane is a flat subspace of one dimension less than its ambient space.

A hyperplane is a flat boundary one dimension lower than its ambient space: a point in one dimension, a line in two, and a plane in three. In classification, it can separate classes in a feature space. section 8.1.2

For feature vector x, weight vector w, and bias b, the decision function f(x) = wᵀx + b defines a hyperplane where f(x) = 0. The weight vector is perpendicular to the boundary; the bias shifts its position. The sign of f(x) identifies which side contains an observation. section 8.2.1

Temperature features

A single temperature feature cannot separate safe observations in the middle from unsafe observations at both extremes. Adding temperature squared creates a two-dimensional feature space where a straight-line hyperplane can separate them. That separator demonstrates possible separation, not the maximum-margin boundary. section 8.1.2

In a hard-margin SVM, the separating hyperplane is positioned midway between parallel margin boundaries, with support vectors constraining the widest possible margin. A kernel can instead make the hyperplane linear in a transformed feature space, so its boundary may appear curved in the original space. section 8.2.3 section 8.6.2

Figure 8.3 Mapping each temperature reading into a two-dimensional feature space defined by temperature and temperature squared makes the classes linearly separable. The points are schematic rather than exact functional values. The dashed line is a hyperplane separating the safe observations, shown as circles, from the unsafe observations, shown as squares. It demonstrates possible separation, not the optimal maximum-margin boundary.

The figure contrasts the original temperature axis with a transformed feature space, where a dashed hyperplane separates the classes. section 8.1.2

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Develops the geometric definition into a decision function, maximum-margin constraints, and kernel-dependent boundary shapes.
Examples
Uses temperature and temperature-squared features to make a two-class example linearly separable in two dimensions.
What you can do after
Apply it via a linear decision function, using weights and bias to determine an observation’s side of the boundary.
How it connects
Connects hyperplanes to feature spaces, decision functions, support vector machines, margins, and kernel methods.

Also explained in

Compare how 8 books explain hyperplane →

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.