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.
No takes yet. Share an insight, caveat, or question.
Beygelzimer et al. (2009) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: