65 search results - page 8 / 13 » A bound on the label complexity of agnostic active learning |
139
click to vote
COLT
2010
Springer
14 years 11 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
113
click to vote
JMLR
2008
15 years 1 months ago
2008
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
120
click to vote
ECML
2006
Springer
15 years 5 months ago
2006
Springer
In many complex machine learning applications there is a need to learn multiple interdependent output variables, where knowledge of these interdependencies can be exploited to impr...
120
click to vote
COLT
2005
Springer
15 years 7 months ago
2005
Springer
We present two new methods for obtaining generalization error bounds in a semi-supervised setting. Both methods are based on approximating the disagreement probability of pairs of ...
134
click to vote
TNN
2010
14 years 8 months ago
2010
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...