Online Active Learning of Reject Option Classifiers
Abstract
Active learning is an important technique to reduce the number of labeled examples in supervised learning. Active learning for binary classification has been well addressed in machine learning. However, active learning of the reject option classifier remains unaddressed. In this paper, we propose novel algorithms for active learning of reject option classifiers. We develop an active learning algorithm using double ramp loss function. We provide mistake bounds for this algorithm. We also propose a new loss function called double sigmoid loss function for reject option and corresponding active learning algorithm. We offer a convergence guarantee for this algorithm. We provide extensive experimental results to show the effectiveness of the proposed algorithms. The proposed algorithms efficiently reduce the number of label examples required.
Cite
Text
Shah and Manwani. "Online Active Learning of Reject Option Classifiers." AAAI Conference on Artificial Intelligence, 2020. doi:10.1609/AAAI.V34I04.6019Markdown
[Shah and Manwani. "Online Active Learning of Reject Option Classifiers." AAAI Conference on Artificial Intelligence, 2020.](https://mlanthology.org/aaai/2020/shah2020aaai-online/) doi:10.1609/AAAI.V34I04.6019BibTeX
@inproceedings{shah2020aaai-online,
title = {{Online Active Learning of Reject Option Classifiers}},
author = {Shah, Kulin and Manwani, Naresh},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2020},
pages = {5652-5659},
doi = {10.1609/AAAI.V34I04.6019},
url = {https://mlanthology.org/aaai/2020/shah2020aaai-online/}
}