701 search results - page 21 / 141 » Self Bounding Learning Algorithms |
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
CSR
2007
Springer
14 years 3 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
ICML
2001
IEEE
14 years 10 months ago
2001
IEEE
We present an improved bound on the difference between training and test errors for voting classifiers. This improved averaging bound provides a theoretical justification for popu...
NIPS
2008
13 years 11 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
AAAI
2012
12 years 6 hour ago
2012
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...