40 search results - page 1 / 8 » A New PAC Bound for Intersection-Closed Concept Classes |
COLT
2004
Springer
13 years 8 months ago
2004
Springer
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
ALT
1999
Springer
13 years 8 months ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
TCC
2010
Springer
14 years 1 months ago
2010
Springer
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
COLT
1999
Springer
13 years 8 months ago
1999
Springer
In this paper we analyze the PAC learning abilities of several simple iterative algorithms for learning linear threshold functions, obtaining both positive and negative results. W...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...