An upper bound on the sample complexity
✍
Philip M. Long
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 103 KB
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.