Computer Science – Learning
Scientific paper
2008-12-29
Computer Science
Learning
Scientific paper
We present a practical and statistically consistent scheme for actively learning binary classifiers under general loss functions. Our algorithm uses importance weighting to correct sampling bias, and by controlling the variance, we are able to give rigorous label complexity bounds for the learning process. Experiments on passively labeled data show that this approach reduces the label complexity required to achieve good predictive performance on many learning problems.
Beygelzimer Alina
Dasgupta Sanjoy
Langford J. J.
No associations
LandOfFree
Importance Weighted Active Learning 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 Importance Weighted Active Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Importance Weighted Active Learning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-449116