Decidability of Sample Complexity of PAC Learning in finite setting.
Alberto GandolfiPublished in: CoRR (2020)
Keyphrases
- pac learning
- sample complexity
- learning problems
- vc dimension
- computational learning theory
- theoretical analysis
- learning algorithm
- special case
- generalization error
- upper bound
- supervised learning
- sample size
- pac learnability
- uniform distribution
- target function
- concept classes
- lower bound
- active learning
- target concept
- learning theory
- training examples
- decision lists
- irrelevant features
- training set
- concept class
- prior knowledge
- statistical queries
- labeled data
- mistake bound
- learning tasks
- data mining