Computer Science – Learning
Scientific paper
2010-06-14
Computer Science
Learning
Scientific paper
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 hypotheses is maintained throughout learning, and only hypotheses from this set are ever returned. By avoiding this version space approach, our algorithm sheds the computational burden and brittleness associated with maintaining version spaces, yet still allows for substantial improvements over supervised learning for classification.
Beygelzimer Alina
Hsu Daniel
Langford J. J.
Zhang Tong
No associations
LandOfFree
Agnostic Active Learning Without Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Agnostic Active Learning Without Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Agnostic Active Learning Without Constraints will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-421382