English

Learning from Similarity-Confidence Data

Machine Learning 2021-02-16 v1 Machine Learning

Abstract

Weakly supervised learning has drawn considerable attention recently to reduce the expensive time and labor consumption of labeling massive data. In this paper, we investigate a novel weakly supervised learning problem of learning from similarity-confidence (Sconf) data, where we aim to learn an effective binary classifier from only unlabeled data pairs equipped with confidence that illustrates their degree of similarity (two examples are similar if they belong to the same class). To solve this problem, we propose an unbiased estimator of the classification risk that can be calculated from only Sconf data and show that the estimation error bound achieves the optimal convergence rate. To alleviate potential overfitting when flexible models are used, we further employ a risk correction scheme on the proposed risk estimator. Experimental results demonstrate the effectiveness of the proposed methods.

Keywords

Cite

@article{arxiv.2102.06879,
  title  = {Learning from Similarity-Confidence Data},
  author = {Yuzhou Cao and Lei Feng and Yitian Xu and Bo An and Gang Niu and Masashi Sugiyama},
  journal= {arXiv preprint arXiv:2102.06879},
  year   = {2021}
}

Comments

33 pages, 5 figures

R2 v1 2026-06-23T23:07:38.047Z