The VC dimension of k-fold union
โ Scribed by David Eisenstat; Dana Angluin
- Book ID
- 108153496
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 114 KB
- Volume
- 101
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A family F of subsets of a finite set X shatters a set D X, if the intersections of the members of F with D coincide with the power set of D. The maximum size of a set shattered by F is the VC-dimension (or density) of the system. P. Frankl (1983, J. Combin. Theory Ser. A 34, 41 45) investigates the
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is: 3 -hard to approximate to within a factor 2 ร e for all e > 0; \* approximable in AM to within a factor 2; and \* AM-hard to appr