77 search results - page 1 / 16 » Sample Size Lower Bounds in PAC Learning by Algorithmic Comp... |
TCS
1998
13 years 4 months ago
1998
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
2003
Springer
13 years 10 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...
FLAIRS
2003
13 years 6 months ago
2003
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
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...