mlsanityData to 14 Oct 2026

A Unified Empirical Risk Minimization Framework for Flexible N-Tuples Weak Supervision

arXiv 2507.07771 ↗First posted 10 Jul 2025stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

To alleviate the annotation burden in supervised learning, N-tuples learning has recently emerged as a powerful weakly-supervised method. While existing N-tuples learning approaches extend pairwise learning to higher-order comparisons and accommodate various real-world scenarios, they often rely on task-specific designs and lack a unified theoretical foundation. In this paper, we propose a general N-tuples learning framework based on empirical risk minimization, which systematically integrates pointwise unlabeled data to enhance learning performance. This paper first unifies the data generation processes of N-tuples and pointwise unlabeled data under a shared probabilistic formulation. Based on this unified view, we derive an unbiased empirical risk estimator that generalizes a broad class of existing N-tuples models. We further establish a generalization error bound for theoretical support. To demonstrate the flexibility of the framework, we instantiate it in four representative weakly supervised scenarios, each recoverable as a special case of our general model. Additionally, to address overfitting issues arising from negative risk terms, we adopt correction functions to adjust the empirical risk. Extensive experiments on benchmark datasets validate the effectiveness of the proposed framework and demonstrate that leveraging pointwise unlabeled data consistently improves generalization across various N-tuples learning tasks.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 32 references that are in the map. First posted on arXiv 10 Jul 2025.

Builds on

15 of 32 references.

References · 15

  1. 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 219
  2. 2017Learning from Complementary Labelscited by 88
  3. 2018Complementary-Label Learning for Arbitrary Losses and Modelscited by 57
  4. 2019Learning with Multiple Complementary Labelscited by 53
  5. 2019Partial Label Learning with Self-Guided Retrainingcited by 47
  6. 2018On the Minimal Supervision for Training Any Binary Classifier from Only Unlabeled Datacited by 43
  7. 2018Classification from Pairwise Similarity and Unlabeled Datacited by 36
  8. 2019Mitigating Overfitting in Supervised Classification from Two Unlabeled Datasets: A Consistent Risk Correction Approachcited by 29
  9. 2017Binary Classification from Positive-Confidence Datacited by 23
  10. 2019Classification from Pairwise Similarities/Dissimilarities and Unlabeled Data via Empirical Risk Minimizationcited by 21
  11. 2017Semi-Supervised AUC Optimization based on Positive-Unlabeled Learningcited by 20
  12. 2020Pointwise Binary Classification with Pairwise Confidence Comparisonscited by 20
3 more
  1. 2021Learning from Similarity-Confidence Datacited by 19
  2. 2021Binary Classification from Multiple Unlabeled Datasets via Surrogate Set Classificationcited by 12
  3. 2019Classification from Triplet Comparison Datacited by 6

Built on by

Not cited yet.