An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution.
Philip M. LongPublished in: Inf. Process. Lett. (2003)
Keyphrases
- uniform distribution
- pac learning
- upper bound
- target concept
- concept classes
- agnostic learning
- concept class
- membership queries
- computational learning theory
- lower bound
- vc dimension
- sample complexity
- term dnf
- boolean functions
- decision lists
- dnf formulas
- statistical queries
- exact learning
- sample size
- worst case
- learning theory
- reinforcement learning
- learning dnf
- np hard
- mistake bound