The VC dimension of k-uniform random hypergraphs.
Bernard YcartJoel RatsabyPublished in: Random Struct. Algorithms (2007)
Keyphrases
- vc dimension
- uniform random
- upper bound
- sample complexity
- sample size
- concept classes
- inductive inference
- covering numbers
- statistical learning theory
- lower bound
- vapnik chervonenkis dimension
- constraint networks
- generalization bounds
- compression scheme
- pac learning
- worst case
- distribution free
- empirical risk minimization
- concept class
- uniform convergence
- machine learning
- euclidean space
- supervised learning
- image compression
- discrete sets
- special case
- feature space