We explore a problem of Frankl (1989). A family ~ of subsets of {1, 2, ..., m} is said to have trace Kk if there is a subset SC\_{1,2 ..... m} with IS] = k so that {FNSIF C .~} yields all 2 k possible subsets. Frankl (1989) conjectured that a family ~ which is an antichain (in poser given by C\_ ord
On the VC Dimension of Bounded Margin Classifiers
โ Scribed by Don Hush; Clint Scovel
- Book ID
- 110296223
- Publisher
- Springer
- Year
- 2001
- Tongue
- English
- Weight
- 85 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0885-6125
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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