Sciweavers

199 search results - page 1 / 40
» A general agnostic active learning algorithm
Sort
View
ICML
2007
IEEE
14 years 5 months ago
A bound on the label complexity of agnostic active learning
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...
Steve Hanneke
NIPS
2007
13 years 6 months ago
A general agnostic active learning algorithm
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
Sanjoy Dasgupta, Daniel Hsu, Claire Monteleoni
ICML
2006
IEEE
14 years 5 months ago
Agnostic active learning
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...
Maria-Florina Balcan, Alina Beygelzimer, John Lang...
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 4 months ago
Agnostic Active Learning Without Constraints
We present and analyze an agnostic active learning algorithm that works without keeping a version space. This is unlike all previous approaches where a restricted set of candidate...
Alina Beygelzimer, Daniel Hsu, John Langford, Tong...
CC
2010
Springer
120views System Software» more  CC 2010»
13 years 1 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov