Learning from Similarity/Dissimilarity and Pairwise Comparison

arXiv cs.LG / 3/23/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • 本論文は、インスタンスレベルのラベル取得が難しい二値分類を、インスタンス間の相対判断を用いた弱教師あり学習として扱うSD-Pcomp分類を提案する。
  • Similarity/Dissimilarity( SD) ラベルと Pairwise Comparison( Pcomp) ラベルの2種類の弱ラベルを活用し、両者の関係をモデリングした2つの無偏推定量を導出する。
  • SDとPcompの凸結合と、それらを統合する統一推定量を通じて、単一の弱ラベルを用いる手法より分類性能を改善し、ノイズやクラス事前確率推定の不確実性に対して頑健性を示す。
  • 理論的解析と実験結果により、提案手法が単一弱ラベル手法より高性能で、実世界のラベルノイズや不確実性に対して安定性を発揮することを示している。

Abstract

This paper addresses binary classification in scenarios where obtaining explicit instance level labels is impractical, by exploiting multiple weak labels defined on instance pairs. The existing SconfConfDiff classification framework relies on continuous valued probabilistic supervision, including similarity-confidence, the probability of class agreement, and confidence-difference, the difference in positive class probabilities. However, probabilistic labeling requires subjective uncertainty quantification, often leading to unstable supervision. We propose SD-Pcomp classification, a binary judgment based weakly supervised learning framework that relies only on relative judgments, namely class agreement between two instances and pairwise preference toward the positive class. The method employs Similarity/Dissimilarity (SD) labels and Pairwise Comparison (Pcomp) labels, and develops two unbiased risk estimators, (i) a convex combination of SD and Pcomp and (ii) a unified estimator that integrates both labels by modeling their relationship. Theoretical analysis and experimental results show that the proposed approach improves classification performance over methods using a single weak label, and is robust to label noise and uncertainty in class prior estimation.