Combinatorics Extremal combinatorics Concept
VC dimension
Summary
The VC dimension (Vapnik–Chervonenkis dimension) of a family of sets is the size of the largest set on which it cuts out every subset. It measures the complexity of the family as a single number. By the Sauer–Shelah lemma, a family of finite VC dimension picks out only polynomially many subsets, about , of an -point set. This is why VC dimension controls sample sizes in statistical learning theory.
Further reading
About this page
| Tag | KCFXR9K3GD |
|---|---|
| URI | m2://KCFXR9K3GD |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05D05, 68Q32 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.