Open AccessProceedings Article
Binary Classification from Positive-Confidence Data.
Takashi Ishida,Gang Niu,Masashi Sugiyama +2 more
- 01 Jan 2018
Vol. 31, pp 5917-5928
TL;DR: It is shown that if one can equip positive data with confidence (positive-confidence), one can successfully learn a binary classifier, which is named positive-confidence (Pconf) classification.
read more
Abstract: Can we learn a binary classifier from only positive data, without any negative data or unlabeled data? We show that if one can equip positive data with confidence (positive-confidence), one can successfully learn a binary classifier, which we name positive-confidence (Pconf) classification. Our work is related to one-class classification which is aimed at "describing" the positive class by clustering-related methods, but one-class classification does not have the ability to tune hyper-parameters and their aim is not on "discriminating" positive and negative classes. For the Pconf classification problem, we provide a simple empirical risk minimization framework that is model-independent and optimization-independent. We theoretically establish the consistency and an estimation error bound, and demonstrate the usefulness of the proposed method for training deep neural networks through experiments.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
A Survey of Label-noise Representation Learning: Past, Present and Future.
TL;DR: A formal definition of Label-Noise Representation Learning is clarified from the perspective of machine learning and the reason why noisy labels affect deep models' performance is figured out.
178
•Posted Content
On Symmetric Losses for Learning from Corrupted Labels
TL;DR: It is emphasized that using a symmetric loss is advantageous in the balanced error rate (BER) minimization and area under the receiver operating characteristic curve (AUC) maximization from corrupted labels, and general theoretical properties of symmetric losses are proved.
•Posted Content
Confidence Scores Make Instance-dependent Label-noise Learning Possible
TL;DR: Confidence-scored instance-dependent noise (CSIDN) is introduced, where each instance-label pair is associated with a confidence score, sufficient to estimate the noise functions of each instance with minimal assumptions.
83
•Posted Content
Complementary-Label Learning for Arbitrary Losses and Models
TL;DR: The goal of this paper is to derive a novel framework of complementary-label learning with an unbiased estimator of the classification risk, for arbitrary losses and models---all existing methods have failed to achieve this goal.
65
•Posted Content
Classification from Positive, Unlabeled and Biased Negative Data
TL;DR: This paper studies a novel classification framework which incorporates such biased N (bN) data in PU learning and provides a method based on empirical risk minimization to address this PUbN classification problem.
52
Related Papers (5)
Charles Elkan,Keith Noto +1 more
- 24 Aug 2008
Takashi Ishida,Gang Niu,Weihua Hu,Masashi Sugiyama +3 more
- 01 May 2017