.png){kind=icon}
返回
Robust AUC maximization for classification with pairwise confidence comparisons
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-023-2709-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Supervised learning often requires a large number of labeled examples, which has become a critical bottleneck in the case that manual annotating the class labels is costly. To mitigate this issue, a new framework called pairwise comparison (Pcomp) classification is proposed to allow training examples only weakly annotated with pairwise comparison, i.e., which one of two examples is more likely to be positive. The previous study solves Pcomp problems by minimizing the classification error, which may lead to less robust model due to its sensitivity to class distribution. In this paper, we propose a robust learning framework for Pcomp data along with a pairwise surrogate loss called Pcomp-AUC. It provides an unbiased estimator to equivalently maximize AUC without accessing the precise class labels. Theoretically, we prove the consistency with respect to AUC and further provide the estimation error bound for the proposed method. Empirical studies on multiple datasets validate the effectiveness of the proposed method.
Keyword:
UNLABELED DATA
OPTIMIZATION
BOUNDS
期刊
IF:
4.6
论文数:
1.6K
被引数:
2.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容