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

threshold

Threshold — VC = 1

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

Class H={ ht:t∈R }H = \{\, h_t : t \in \mathbb{R} \,\}, one parameter:

ht(x)={+x≥t−x<th_t(x) = \begin{cases} + & x \ge t \\ - & x < t \end{cases}

Let's count. (Recall ht(p)=+h_t(p) = {+} iff t≤pt \le p.)

Shatter 1 point p? label +: take any t ≤ p; label −: take any t > p. Both realizable → shatters 1 → VC ≥ 1.

Shatter 2 points p₁ < p₂? write the labeling as (h(p₁), h(p₂)) and solve for t in each of the 2²=4 cases:

labelingcondition on trealizable?
(−,−)t > p₂✓
(−,+)p₁ < t ≤ p₂✓
(+,+)t ≤ p₁✓
(+,−)t ≤ p₁ and t > p₂, i.e. p₂ < t ≤ p₁ — empty since p₁ < p₂✗

(+,−) has no solution → no 2 points can be shattered → VC < 2. So VC = 1.

Breaks on any non-monotone pattern, e.g. − + − ("positive only in the middle"): that rule is not in H at all → underfit. Climb one step → interval.

sobre esta entrada

Una de las entradas de wiki de sijie. La IA en este sitio está anclada en el mismo corpus y responde en la voz de sijie, con citas que vuelven a entradas como esta — responder le cuesta dinero a sijie, así que espera detrás de un código: ingrese código de acceso →