mlsanityData to 14 Oct 2026

Multi-Class Classification from Single-Class Data with Confidences

arXiv 2106.08864 ↗First posted 16 Jun 2021cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

Can we learn a multi-class classifier from only data of a single class? We show that without any assumptions on the loss functions, models, and optimizers, we can successfully learn a multi-class classifier from only data of a single class with a rigorous consistency guarantee when confidences (i.e., the class-posterior probabilities for all the classes) are available. Specifically, we propose an empirical risk minimization framework that is loss-/model-/optimizer-independent. Instead of constructing a boundary between the given class and other classes, our method can conduct discriminative classification between all the classes even if no data from the other classes are provided. We further theoretically and experimentally show that our method can be Bayes-consistent with a simple modification even if the provided confidences are highly noisy. Then, we provide an extension of our method for the case where data from a subset of all the classes are available. Experimental results demonstrate the effectiveness of our methods.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 26 of its 55 references that are in the map. First posted on arXiv 16 Jun 2021.

Builds on

26 of 55 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  4. 2016Densely Connected Convolutional Networkscited by 6,720
  5. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  6. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
  7. 2018Deep Learning for Classical Japanese Literaturecited by 422
  8. 2017Size-Independent Sample Complexity of Neural Networkscited by 290
  9. 2016A vector-contraction inequality for Rademacher complexitiescited by 142
  10. 2020Progressive Identification of True Labels for Partial-Label Learningcited by 102
  11. 2017Learning with Biased Complementary Labelscited by 93
  12. 2018Masking: A New Perspective of Noisy Supervisioncited by 93
14 more
  1. 2020Provably Consistent Partial-Label Learningcited by 92
  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. 2018On the Minimal Supervision for Training Any Binary Classifier from Only Unlabeled Datacited by 43
  6. 2018Classification from Pairwise Similarity and Unlabeled Datacited by 36
  7. 2019Mitigating Overfitting in Supervised Classification from Two Unlabeled Datasets: A Consistent Risk Correction Approachcited by 29
  8. 2020Unbiased Risk Estimators Can Mislead: A Case Study of Learning with Complementary Labelscited 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. 2021Learning from Similarity-Confidence Datacited by 19
  12. 2020Bridging Ordinary-Label Learning and Complementary-Label Learningcited by 11
  13. 2016Efficient Training for Positive Unlabeled Learningcited by 10
  14. 2020Binary Classification from Positive Data with Skewed Confidencecited by 8

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1.

3 papers.