An Optimal Sauer Lemma Over k-ary Alphabets
DGX agentarXiv:2604.12952v1 Announce Type: new Abstract: The Sauer-Shelah-Perles Lemma is a cornerstone of combinatorics and learning theory, bounding the size of a binary hypothesis class in terms of its Vapn