Sparse and Robust Reject Option Classifier using Successive Linear Programming

02/12/2018
by   Kulin Shah, et al.
0

In this paper, we propose a new sparse and robust reject option classifier based on minimization of l_1 regularized risk under double ramp loss L_dr,ρ. We use DC programming to find the risk minimizer. The algorithm solves a sequence of linear programs to learn the reject option classifier. Moreover, we show that the risk under L_dr,ρ is minimized by generalized Bayes classifier in the reject option setting. We also provide the excess risk bound for L_dr,ρ. We show the effectiveness of the proposed approach by experimenting it on several real world datasets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2021

RISAN: Robust Instance Specific Abstention Network

In this paper, we propose deep architectures for learning instance speci...
research
06/14/2019

Online Active Learning of Reject Option Classifiers

Active learning is an important technique to reduce the number of labele...
research
01/29/2021

Optimal strategies for reject option classifiers

In classification with a reject option, the classifier is allowed in unc...
research
06/26/2020

Covariance-engaged Classification of Sets via Linear Programming

Set classification aims to classify a set of observations as a whole, as...
research
02/15/2022

Estimating risks of option books using neural-SDE market models

In this paper, we examine the capacity of an arbitrage-free neural-SDE m...
research
05/31/2020

Theory and Algorithms for Shapelet-based Multiple-Instance Learning

We propose a new formulation of Multiple-Instance Learning (MIL), in whi...

Please sign up or login with your details

Forgot password? Click here to reset