40 search results - page 3 / 8 » A New PAC Bound for Intersection-Closed Concept Classes |
ML
2007
ACM
13 years 5 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...
COLT
2006
Springer
13 years 9 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
ICC
2007
IEEE
13 years 12 months ago
2007
IEEE
— We propose the novel concept of cooperation for deafness prevention in directional antenna ad hoc networks, along with a low-complexity multiuser detector specialised for these...
ECML
1993
Springer
13 years 9 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...