15 search results - page 1 / 3 » Learning Intersections and Thresholds of Halfspaces |
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
ML
2007
ACM
13 years 3 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...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
ECCC
2006
13 years 4 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...