Sciweavers

Share
NIPS
2004

Analysis of a greedy active learning strategy

9 years 24 days ago
Analysis of a greedy active learning strategy
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and lower bounds on the number of labels which need to be queried, and we prove that a popular greedy active learning rule is approximately as good as any other strategy for minimizing this number of labels.
Sanjoy Dasgupta
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where NIPS
Authors Sanjoy Dasgupta
Comments (0)
books