180 search results - page 16 / 36 » Improved bounds on the sample complexity of learning |
COLT
2000
Springer
13 years 11 months ago
2000
Springer
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...
COLT
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. We consider the problem of estimating an unknown probability distribution from samples using the principle of maximum entropy (maxent). To alleviate overfitting with a v...
ALT
2001
Springer
14 years 1 days ago
2001
Springer
We develop a theory for learning scenarios where multiple learners co-exist but there are mutual compatibility constraints on their outcomes. This is natural in cognitive learning...
TCS
2011
13 years 2 months ago
2011
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...