# Double Ramp Loss Based Reject Option Classifier

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

## Key facts

- Cited by 9 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Nov 2013.

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

- [Contrastive Learning Improves Model Robustness Under Label Noise](https://mlsanity.com/paper/2104.08984/) (2021)
- [Trained Without My Consent: Detecting Code Inclusion In Language Models Trained on Code](https://mlsanity.com/paper/2402.09299/) (2024)
- [Do We Really Need Gold Samples for Sample Weighting Under Label Noise?](https://mlsanity.com/paper/2104.09045/) (2021)
- [Improving Data Quality with Training Dynamics of Gradient Boosting Decision Trees](https://mlsanity.com/paper/2210.11327/) (2022)
- [Deep Learning is Provably Robust to Symmetric Label Noise](https://mlsanity.com/paper/2210.15083/) (2022)
- [What killed the Convex Booster ?](https://mlsanity.com/paper/2205.09628/) (2022)
- [Robust Loss Functions for Training Decision Trees with Noisy Labels](https://mlsanity.com/paper/2312.12937/) (2023)
- [Exploring Loss Design Techniques For Decision Tree Robustness To Label Noise](https://mlsanity.com/paper/2405.17672/) (2024)
- [Quantifying probabilistic robustness of tree-based classifiers against natural distortions](https://mlsanity.com/paper/2208.10354/) (2022)

## Abstract (arXiv)

We consider the problem of learning reject option classifiers. The goodness of a reject option classifier is quantified using 0-d-1 loss function wherein a loss d ∈ (0,.5) is assigned for rejection. In this paper, we propose em double ramp loss function which gives a continuous upper bound for (0-d-1) loss. Our approach is based on minimizing regularized risk under the double ramp loss using em difference of convex (DC) programming. We show the effectiveness of our approach through experiments on synthetic and benchmark datasets. Our approach performs better than the state of the art reject option classification approaches.