Binary Classification from Positive Data with Skewed Confidence
Not on the map. Why?
Abstract (arXiv)
Positive-confidence (Pconf) classification [Ishida et al., 2018] is a promising weakly-supervised learning method which trains a binary classifier only from positive data equipped with confidence. However, in practice, the confidence may be skewed by bias arising in an annotation process. The Pconf classifier cannot be properly learned with skewed confidence, and consequently, the classification performance might be deteriorated. In this paper, we introduce the parameterized model of the skewed confidence, and propose the method for selecting the hyperparameter which cancels out the negative impact of skewed confidence under the assumption that we have the misclassification rate of positive samples as a prior knowledge. We demonstrate the effectiveness of the proposed method through a synthetic experiment with simple linear models and benchmark problems with neural network models. We also apply our method to drivers' drowsiness prediction to show that it works well with a real-world problem where confidence is obtained based on manual annotation.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Jan 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 1; 2024: 0; 2025: 1; 2026: 2.
8 papers.
- 2022"This is my unicorn, Fluffy": Personalizing frozen vision-language representationscited by 95
- 2022Is the Performance of My Deep Network Too Good to Be True? A Direct Approach to Estimating the Bayes Error in Binary Classificationcited by 26
- 2023Binary Classification with Confidence Differencecited by 13
- 2021Multi-Class Classification from Single-Class Data with Confidencescited by 3
- 2022Classification from Positive and Biased Negative Data with Skewed Labeled Posterior Probabilitycited by 0
- 2025Learning from N-Tuple Data with M Positive Instances: Unbiased Risk Estimation and Theoretical Guaranteescited by 0
- 2026Recent advances in weakly supervised learning: New supervision paradigms, assumption relaxations, and practical solutionscited by 0
- 2026AUC Maximization from Biased Positive-unlabeled Data with Confidencecited by 0
- 2026AUC Maximization from Biased Positive-unlabeled Data with Confidence10 Sep 2026
- 2026Recent advances in weakly supervised learning: New supervision paradigms, assumption relaxations, and practical solutions7 Aug 2026
- 2025Learning from N-Tuple Data with M Positive Instances: Unbiased Risk Estimation and Theoretical Guarantees21 Oct 2025
- 2023Binary Classification with Confidence Difference9 Oct 2023
- 2022"This is my unicorn, Fluffy": Personalizing frozen vision-language representations4 Apr 2022
- 2022Classification from Positive and Biased Negative Data with Skewed Labeled Posterior Probability11 Mar 2022
- 2022Is the Performance of My Deep Network Too Good to Be True? A Direct Approach to Estimating the Bayes Error in Binary Classification1 Feb 2022
- 2021Multi-Class Classification from Single-Class Data with Confidences16 Jun 2021