65 search results - page 5 / 13 » A bound on the label complexity of agnostic active learning |
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
ALT
2010
Springer
14 years 11 months ago
2010
Springer
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we propose a two-dimensional active learning scheme and show its application in image classification. Traditional active learning methods select samples only along ...
COLT
2005
Springer
15 years 3 months ago
2005
Springer
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...