76 search results - page 2 / 16 » Agnostically Learning Halfspaces |
FOCS
2008
IEEE
14 years 29 days ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
IJCAI
2007
13 years 8 months ago
2007
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
COLT
2008
Springer
13 years 8 months ago
2008
Springer
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
ML
2007
ACM
13 years 6 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
ICML
2007
IEEE
14 years 7 months ago
2007
IEEE
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...