✦ LIBER ✦
An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
✍ Scribed by Philip M. Long
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 103 KB
- Volume
- 87
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
✦ Synopsis
We show that halfspaces in n dimensions can be PAC-learned with respect to the uniform distribution with accuracy ε and confidence δ using O( 1 ε (n + log 1 δ )) examples.