2026-08-28·作者 Sijie Wang#idea#math

linear-separators

Linear separators in the plane — VC = 3

Parent: examples Prereq: learning-theory — H, h, shattering; ℝ.

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

hw,b(x)={+w⋅x+b≥0−otherwiseh_{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
關於這一條

sijie 的一條 wiki 條目。本站的 AI 以同一套語料庫為依據、以 sijie 的口吻作答,並附有指向此類條目的引用——回答會花 sijie 的錢,所以它在存取碼後等待: 輸入存取碼 →

linear-separators — Sijie Wang