Online Active Learning of Reject Option Classifiers
摘要
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.
问 Lune
几分钟读透这篇 Paper,不用再花一下午。
Lune 能读完全文,也能读引用它的顶会 Paper,讲清它的结论、证据和局限,每一点都注明出自哪篇 Paper。不用硬啃,也不靠猜。
已有 2 篇顶会 Paper 引用了它。别等审稿人问起,先弄清它们发现了什么。
脉络
引用它的顶会 Paper2
相关 Paper
- Algorithm Selection for Deep Active Learning with Imbalanced DatasetsJifan Zhang, Shuai Shao, Saurabh Verma, Robert D. NowakNeurIPS 2023 · 38 次引用
- Convergence of Uncertainty Sampling for Active LearningAnant Raj, Francis R. BachICML 2022 · 41 次引用
- Double-Cross Attacks: Subverting Active Learning SystemsJose Rodrigo Sanchez Vicarte, Gang Wang, Christopher W. FletcherUSENIX Security 2021 · 8 次引用
- Active Learning for Decision Trees with Provable GuaranteesArshia Soltani Moakhar, Tanapoom Laoaron, Faraz Ghahremani, Kiarash Banihashem 等ICLR 2026 · 1 次引用
- SEL-BALD: Deep Bayesian Active Learning with Selective LabelsRuijiang Gao, Mingzhang Yin, Maytal Saar-TsechanskyNeurIPS 2024 · 4 次引用
