Shattering-extremal set systems of VC dimension at most 2
Tam\'as M\'esz\'aros, Lajos R\'onyai

TL;DR
This paper characterizes shattering-extremal set systems of VC dimension 2 using their inclusion graphs and addresses an open question about element removal in such systems.
Contribution
It provides a complete characterization of shattering-extremal set systems of VC dimension 2 and solves an open problem regarding element exclusion.
Findings
Characterization of shattering-extremal set systems of VC dimension 2
Answer to an open question about element removal from these systems
Insights into the structure of extremal set systems
Abstract
We say that a set system shatters a given set if . The Sauer inequality states that in general, a set system shatters at least sets. Here we concentrate on the case of equality. A set system is called shattering-extremal if it shatters exactly sets. In this paper we characterize shattering-extremal set systems of Vapnik-Chervonenkis dimension in terms of their inclusion graphs, and as a corollary we answer an open question from \cite{VC1} about leaving out elements from shattering-extremal set systems in the case of families of Vapnik-Chervonenkis dimension .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
