Sample Complexity for Computational Classification Problems.
Daniil RyabkoPublished in: Algorithmica (2007)
Keyphrases
- sample complexity
- theoretical analysis
- pac learning
- special case
- learning problems
- upper bound
- learning algorithm
- vc dimension
- supervised learning
- active learning
- generalization error
- pac learnability
- lower bound
- concept classes
- sample size
- training examples
- covering numbers
- uniform distribution
- state space
- dynamic programming
- prior knowledge
- training data