Construct · 1 fields · 1 citations

Sauer-Shelah lemma: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Learning theory

the bound that a set family of finite VC dimension d picks out only polynomially many, order n to the d, subsets of any n points.

In learning theory, Sauer-Shelah lemma refers to the bound that a set family of finite VC dimension d picks out only polynomially many, order n to the d, subsets of any n points. This meaning comes from Sauer (1972) in Journal of Combinatorial Theory, Series A.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Sauer-Shelah lemma sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

dimension4 fields · 5 citationsjingle · one word, four constructs family3 fields · 3 citationsjingle · one word, three constructs learning6 fields · 14 citationsjingle · one name, six constructs

References

Sauer, N. (1972). On the density of families of sets. Journal of Combinatorial Theory, Series A, 13(1), 145-147. https://doi.org/10.1016/0097-3165(72)90019-2

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct