Learning with Complementary Labels Revisited: The Selected-Completely-at-Random Setting Is More Practical
Complementary-label learning is a weakly supervised learning problem in which each training example is associated with one or multiple complementary labels indicating the classes to which it does not belong. Existing consistent approaches have relied on the uniform distribution assumption to model the generation of complementary labels, or on an ordinary-label training set to estimate the transition matrix in non-uniform cases. However, either condition may not be satisfied in real-world scenarios. In this paper, we propose a novel consistent approach that does not rely on these conditions. Inspired by the positive-unlabeled (PU) learning literature, we propose an unbiased risk estimator based on the Selected-Completely-at-Random assumption for complementary-label learning. We then introduce a risk-correction approach to address overfitting problems. Furthermore, we find that complementary-label learning can be expressed as a set of negative-unlabeled binary classification problems when using the one-versus-rest strategy. Extensive experimental results on both synthetic and real-world benchmark datasets validate the superiority of our proposed approach over state-of-the-art methods.
Code (1)
Tasks
Binary ClassificationMulti-class ClassificationWeakly-supervised LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Learning from Positive and Unlabeled Data under the Selected At Random Assumption
For many interesting tasks, such as medical diagnosis and web page classification, a learner only has access to some positively labeled examples and many unlabeled examples. Learning from this type of data requires makin…
General ClassificationMedical DiagnosisVerifying the Selected Completely at Random Assumption in Positive-Unlabeled Learning
The goal of positive-unlabeled (PU) learning is to train a binary classifier on the basis of training data containing positive and unlabeled instances, where unlabeled observations can belong either to the positive class…
Learning from a Complementary-label Source Domain: Theory and Algorithms
In unsupervised domain adaptation (UDA), a classifier for the target domain is trained with massive true-label data from the source domain and unlabeled data from the target domain. However, collecting fully-true-label d…
Domain AdaptationUnsupervised Domain AdaptationRank-Aware Negative Training for Semi-Supervised Text Classification
Semi-supervised text classification-based paradigms (SSTC) typically employ the spirit of self-training. The key idea is to train a deep classifier on limited labeled texts and then iteratively predict the unlabeled text…
ClassificationSemi-Supervised Text Classificationtext-classificationText ClassificationPositive Unlabeled Learning Selected Not At Random (PULSNAR): class proportion estimation when the SCAR assumption does not hold
Positive and Unlabeled (PU) learning is a type of semi-supervised binary classification where the machine learning algorithm differentiates between a set of positive instances (labeled) and a set of both positive and neg…
Binary Classification