A New PAC Bound for Intersection-Closed Concept Classes.
Peter AuerRonald OrtnerPublished in: COLT (2004)
Keyphrases
- upper bound
- vc dimension
- mistake bound
- lower bound
- pac bayesian
- worst case
- sample complexity
- perceptron algorithm
- rademacher complexity
- concept class
- pac learning
- linear threshold functions
- real time
- error bounds
- sample size
- multi class
- multi agent
- statistical queries
- search engine
- distribution free
- uniform convergence
- data mining
- neural network
- data sets