# Binary Classification with Bounded Abstention Rate

arXiv: https://arxiv.org/abs/1905.09561 · HTML: https://mlsanity.com/paper/1905.09561/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 May 2019.

## Built on by (most cited first, 3 of 3)

- [Machine Learning with a Reject Option: A survey](https://mlsanity.com/paper/2107.11277/) (2021)
- [Unsupervised Anomaly Detection with Rejection](https://mlsanity.com/paper/2305.13189/) (2023)
- [Classification with Abstention Under Class-Conditional Error Constraints](https://mlsanity.com/paper/2609.22632/) (2026)

## Abstract (arXiv)

We consider the problem of binary classification with abstention in the relatively less studied bounded-rate setting. We begin by obtaining a characterization of the Bayes optimal classifier for an arbitrary input-label distribution PXY. Our result generalizes and provides an alternative proof for the result first obtained by citechow1957optimum, and then re-derived by citetdenis2015consistency, under a continuity assumption on PXY. We then propose a plug-in classifier that employs unlabeled samples to decide the region of abstention and derive an upper-bound on the excess risk of our classifier under standard H"older smoothness and margin assumptions. Unlike the plug-in rule of citetdenis2015consistency, our constructed classifier satisfies the abstention constraint with high probability and can also deal with discontinuities in the empirical cdf. We also derive lower-bounds that demonstrate the minimax near-optimality of our proposed algorithm. To address the excessive complexity of the plug-in classifier in high dimensions, we propose a computationally efficient algorithm that builds upon prior work on convex loss surrogates, and obtain bounds on its excess risk in the realizable case. We empirically compare the performance of the proposed algorithm with a baseline on a number of UCI benchmark datasets.