76 search results - page 4 / 16 » Agnostically Learning Halfspaces |
109
Voted
ALT
2006
Springer
16 years 21 days ago
2006
Springer
COLT
2007
Springer
15 years 10 months ago
2007
Springer
164
Voted
ALT
2002
Springer
16 years 21 days ago
2002
Springer
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
126
Voted
FOCS
2006
IEEE
15 years 9 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...
136
Voted
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...