18 search results - page 1 / 4 » PAC Generalization Bounds for Co-training |
NIPS
2001
13 years 6 months ago
2001
The rule-based bootstrapping introduced by Yarowsky, and its cotraining variant by Blum and Mitchell, have met with considerable empirical success. Earlier work on the theory of c...
ICML
2007
IEEE
14 years 5 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...
JMLR
2012
11 years 7 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
SDM
2007
SIAM
13 years 6 months ago
2007
SIAM
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
JSYML
2006
13 years 4 months ago
2006
We introduce and study the notions of a PAC substructure of a stable structure, and a bounded substructure of an arbitrary substructure, generalizing [8]. We give precise definiti...