mlsanityData to 14 Oct 2026

Classification from Pairwise Similarities/Dissimilarities and Unlabeled Data via Empirical Risk Minimization

arXiv 1904.11717 ↗First posted 26 Apr 2019cs.LG stat.MLcited by 21

Not on the map. Why?

Abstract (arXiv)

Pairwise similarities and dissimilarities between data points might be easier to obtain than fully labeled data in real-world classification problems, e.g., in privacy-aware situations. To handle such pairwise information, an empirical risk minimization approach has been proposed, giving an unbiased estimator of the classification risk that can be computed only from pairwise similarities and unlabeled data. However, this direction cannot handle pairwise dissimilarities so far. On the other hand, semi-supervised clustering is one of the methods which can use both similarities and dissimilarities. Nevertheless, they typically require strong geometrical assumptions on the data distribution such as the manifold assumption, which may deteriorate the performance. In this paper, we derive an unbiased risk estimator which can handle all of similarities/dissimilarities and unlabeled data. We theoretically establish estimation error bounds and experimentally demonstrate the practical usefulness of our empirical risk minimization method.

Key facts. Cited by 21 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Apr 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 5; 2022: 3; 2023: 3; 2024: 2; 2025: 4; 2026: 4.

21 papers.

Sort:

  1. 2021Learning from Similarity-Confidence Datacited by 19
  2. 2024A General Framework for Learning from Weak Supervisioncited by 7
  3. 2021Training Deep Architectures Without End-to-End Backpropagation: A Survey on the Provably Optimal Methodscited by 5
  4. 2023Unified Risk Analysis for Weakly Supervised Learningcited by 5
  5. 2022Applications of Deep Learning in Fish Habitat Monitoring: A Tutorial and Surveycited by 4
  6. 2021Multi-Class Classification from Single-Class Data with Confidencescited by 3
  7. 2021Labels, Information, and Computation: Efficient Learning Using Sufficient Labelscited by 2
  8. 2022Learning from Label Proportions with Instance-wise Consistencycited by 2
  9. 2022Learning from Positive and Unlabeled Data with Augmented Classescited by 1
  10. 2021A Symmetric Loss Perspective of Reliable Machine Learningcited by 0
  11. 2023RoLNiP: Robust Learning Using Noisy Pairwise Comparisonscited by 0
  12. 2023Q&A Label Learningcited by 0
9 more
  1. 2024Learning from Concealed Labelscited by 0
  2. 2025Learning from M-Tuple Dominant Positive and Unlabeled Datacited by 0
  3. 2025A Unified Empirical Risk Minimization Framework for Flexible N-Tuples Weak Supervisioncited by 0
  4. 2025Learning from Similarity-Confidence and Confidence-Differencecited by 0
  5. 2025A Unified and Stable Risk Minimization Framework for Weakly Supervised Learning with Theoretical Guaranteescited by 0
  6. 2026FastBUS: A Fast Bayesian Framework for Unified Weakly-Supervised Learningcited by 0
  7. 2026Binary Classification from Coupled Pairwise Labelscited by 0
  8. 2026Generalized Distribution-Free Semi-Supervised Learning with Risk Rewritecited by 0
  9. 2026Importance Weighting for Unlabeled-unlabeled Learning under Distribution Shiftcited by 0