AI Foundationspredict · compress · act

concepts → Quantity

Quantity

VC dimension

timeless3 connections

how many points a set of rules can label in every possible way — capacity, counted

the formal statement
VC(H) = the largest n such that H shatters some set of n points

Where it sits

The prism has six jobs across and eight layers down. Its primary cell is measure × L0. Hatched cells cannot exist — a GPU does not learn, an institution does not infer.

What must come first — and what it unlocks

Left to right is reading order, derived from the prerequisite_of edges. Nothing here is hand-ordered: the diagram is the graph.

nothing comes first — this is a starting pointVC dimensionSample complexity

Unlocks: Sample complexity

Where to read it

The chapter that introduces it, and any chapter that uses it again.

13How Much Data Is Enough?act IV · The Learning Floor

Where it comes from

paperLearnability and the Vapnik-Chervonenkis DimensionBlumer, Ehrenfeucht, Haussler, Warmuth · 1989

Every connection

All 3 edges touching this node, grouped by relation family — the sections above are highlights from this list. Colours match the relation families inthe atlas.

Order · 1
must come beforeSample complexityQuantity
Flow · 1
measuresInductive biasProperty
Lineage · 1
is attributed toVladimir VapnikPerson

This page is a projection of one node in src/data/concepts.ts. It has no prose file of its own — 521 declared edges produce all 340 of these pages. Edit an edge and both endpoints change.