2026-08-28·by Sijie Wang#idea#math

linear-separators

Linear separators in the plane — VC = 3

Parent: examples Prereq: learning-theoryH, h, shattering; .

Class H={hw,b:wR2, bR}H = \{\, h_{w,b} : w \in \mathbb{R}^2,\ b \in \mathbb{R} \,\} (weight vector w, offset b):

hw,b(x)={+wx+b0otherwiseh_{w,b}(x) = \begin{cases} + & w \cdot x + b \ge 0 \\ - & \text{otherwise} \end{cases}

A single straight line splits the plane into +/ (one hypothesis = one cut). It shatters any 3 non-collinear points — all 2³ = 8 labelings — but fails on 4 in the XOR arrangement: the two + corners lie on one diagonal, the two on the other, and the diagonals cross at the center, so no single line can put both + on one side and both on the other.

Yes, two lines could carve out XOR — but "two lines" is a different, higher-VC class. VC counts what one hypothesis from your class can do; for linear separators that's one straight cut.

(In general, linear separators — homogeneous halfspaces plus offset — in ℝᵈ have VC = d+1.)

cited by
about this entry

One of sijie's wiki entries. The AI on this site is grounded in the same corpus and answers in sijie's voice, with citations back to entries like this one — answering costs sijie money, so it waits behind a code: enter an access code →