The VC dimension of k-fold union

Authors:
David Eisenstat;Dana Angluin
Affiliations:
Princeton University, USA;Yale University, USA
Venue:
Information Processing Letters
Year:
2007

Citing 1
Cited 2

Learnability and the Vapnik-Chervonenkis dimension

Journal of the ACM (JACM)

k-Fold unions of low-dimensional concept classes

Information Processing Letters
Exploiting label dependencies for improved sample complexity

Machine Learning

Quantified Score

Hi-index	0.89

Visualization

Abstract

The known O(dklogk) bound on the VC dimension of k-fold unions or intersections of a given concept class with VC dimension d is shown to be asymptotically tight.