paper-with-me

홈 › Papers

Learning with Complementary Labels Revisited: The Selected-Completely-at-Random Setting Is More Practical

2023-11-27 · Wei Wang, Takashi Ishida, Yu-Jie Zhang, Gang Niu, Masashi Sugiyama

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.

📄 PDF Abstract BibTeX arXiv:2311.15502

Code (1)

wwangwitsel/scarce 공식 구현 pytorch

Tasks

Binary ClassificationMulti-class ClassificationWeakly-supervised Learning

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Learning from Positive and Unlabeled Data under the Selected At Random Assumption

2018-08-27 · Jessa Bekker, Jesse Davis

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 Diagnosis

Verifying the Selected Completely at Random Assumption in Positive-Unlabeled Learning

2024-03-29 · Paweł Teisseyre, Konrad Furmańczyk, Jan Mielniczuk

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

2020-08-04 · Yiyang Zhang, Feng Liu, Zhen Fang, Bo Yuan 외

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 Adaptation

Rank-Aware Negative Training for Semi-Supervised Text Classification

2023-06-13 · Ahmed Murtadha, Shengfeng Pan, Wen Bo, Jianlin Su 외

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 Classification

Positive Unlabeled Learning Selected Not At Random (PULSNAR): class proportion estimation when the SCAR assumption does not hold

2023-03-14 · Praveen Kumar, Christophe G. Lambert

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