Sciweavers

76 search results - page 5 / 16
» Agnostically Learning Halfspaces
Sort
View
COLT
2008
Springer
13 years 8 months ago
A Query Algorithm for Agnostically Learning DNF?
Parikshit Gopalan, Adam Kalai, Adam R. Klivans
ALT
1998
Springer
13 years 11 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
ECCC
2006
97views more  ECCC 2006»
13 years 6 months ago
Cryptographic Hardness Results for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
Adam R. Klivans, Alexander A. Sherstov
ICML
2006
IEEE
14 years 7 months ago
Agnostic active learning
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...
Maria-Florina Balcan, Alina Beygelzimer, John Lang...