18 search results - page 3 / 4 » PAC Generalization Bounds for Co-training |
COLT
2003
Springer
13 years 11 months ago
2003
Springer
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
TCC
2010
Springer
14 years 2 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
1993
Springer
13 years 10 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
ECCC
2010
13 years 5 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...