On the Sample Complexity for Nonoverlapping Neural Networks
Michael SchmittPublished in: Electron. Colloquium Comput. Complex. (1999)
Keyphrases
- sample complexity
- neural network
- theoretical analysis
- upper bound
- generalization error
- learning problems
- vc dimension
- supervised learning
- learning algorithm
- active learning
- special case
- pac learning
- lower bound
- pac learnability
- training examples
- sample size
- sample complexity bounds
- irrelevant features
- training set
- concept classes
- uniform convergence
- covering numbers
- model selection
- np hard
- linear threshold