76 search results - page 8 / 16 » Agnostically Learning Halfspaces |
COLT
2007
Springer
14 years 27 days ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
NN
2008
Springer
13 years 6 months ago
2008
Springer
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE