arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.04235cs.LG
收藏

基于逐次线性规划的稀疏期权分类器

Sparse Reject Option Classifier Using Successive Linear Programming

IIIT(国际信息技术研究所)

Kulin Shah, Naresh Manwani

摘要:

在本文中,我们提出了一种使用双斜坡损失$L_{dr}$学习稀疏拒绝选项分类器的方法。我们使用DC规划来找到风险最小化。该算法求解一系列线性规划来学习拒绝选项分类器。我们证明了损失$L_{dr}$是Fisher相容的。我们还证明了超额损失风险$L_d$的上界是由超额风险$L_{dr}$。我们推导出所提出的方法的泛化误差界。我们通过在几个真实世界的数据集上进行实验,证明了所提出的方法的有效性。所提出的方法不仅表现得与最先进的水平相当,而且还成功地学习稀疏分类器。

英文摘要:

In this paper, we propose an approach for learning sparse reject option classifiers using 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. We show that the loss $L_{dr}$ is Fisher consistent. We also show that the excess risk of loss $L_d$ is upper bounded by the excess risk of $L_{dr}$. We derive the generalization error bounds for the proposed approach. We show the effectiveness of the proposed approach by experimenting it on several real world datasets. The proposed approach not only performs comparable to the state of the art but it also successfully learns sparse classifiers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑