On the Complexity of Approximating the VC Dimension.
Elchanan MosselChristopher UmansPublished in: Computational Complexity Conference (2001)
Keyphrases
- vc dimension
- vapnik chervonenkis dimension
- vapnik chervonenkis
- worst case
- upper bound
- sample size
- sample complexity
- covering numbers
- concept classes
- lower bound
- generalization bounds
- distribution free
- empirical risk minimization
- function classes
- statistical learning theory
- query complexity
- inductive inference
- pac learnability
- computational complexity
- learning machines
- compression scheme
- pac learning
- theoretical analysis
- uniform convergence
- concept class
- distance measure
- decision trees