76 search results - page 9 / 16 » Agnostically Learning Halfspaces |
APPROX
2009
Springer
14 years 1 months ago
2009
Springer
In 1990, E. Baum gave an elegant polynomial-time algorithm for learning the intersection of two origin-centered halfspaces with respect to any symmetric distribution (i.e., any D s...
COLT
2001
Springer
13 years 11 months ago
2001
Springer
The notion of embedding a class of dichotomies in a class of linear half spaces is central to the support vector machines paradigm. We examine the question of determining the mini...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
ALT
2009
Springer
14 years 3 months ago
2009
Springer
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
COCOON
2007
Springer
14 years 27 days ago
2007
Springer
We use the connection between resource-bounded dimension and the online mistake-bound model of learning to show that the following classes have polynomial-time dimension zero.