mlsanityData to 7 Oct 2026

Binary Classification from Multiple Unlabeled Datasets via Surrogate Set Classification

arXiv 2102.00678 ↗First posted 1 Feb 2021cs.LG stat.MLcited by 12

Not on the map. Why?

Abstract (arXiv)

To cope with high annotation costs, training a classifier only from weakly supervised data has attracted a great deal of attention these days. Among various approaches, strengthening supervision from completely unsupervised classification is a promising direction, which typically employs class priors as the only supervision and trains a binary classifier from unlabeled (U) datasets. While existing risk-consistent methods are theoretically grounded with high flexibility, they can learn only from two U sets. In this paper, we propose a new approach for binary classification from m U-sets for m≥2. Our key idea is to consider an auxiliary classification task called surrogate set classification (SSC), which is aimed at predicting from which U set each observed data is drawn. SSC can be solved by a standard (multi-class) classification method, and we use the SSC solution to obtain the final binary classifier through a certain linear-fractional transformation. We built our method in a flexible and efficient end-to-end deep learning framework and prove it to be classifier-consistent. Through experiments, we demonstrate the superiority of our proposed method over state-of-the-art methods.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 28 of its 66 references that are in the map. First posted on arXiv 1 Feb 2021.

Builds on

28 of 66 references.

References · 28

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  4. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  5. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
  6. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
  7. 2018Deep Learning for Classical Japanese Literaturecited by 415
  8. 2020Dual T: Reducing Estimation Error for Transition Matrix in Label-noise Learningcited by 142
  9. 2016A vector-contraction inequality for Rademacher complexitiescited by 141
  10. 2020Progressive Identification of True Labels for Partial-Label Learningcited by 102
  11. 2020Rethinking Importance Weighting for Deep Learning under Distribution Shiftcited by 92
  12. 2020Provably Consistent Partial-Label Learningcited by 92
16 more
  1. 2017Learning from Complementary Labelscited by 88
  2. 2013Classification with Asymmetric Label Noise: Consistency and Maximal Denoisingcited by 67
  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. 2014On Learning from Label Proportionscited by 38
  7. 2018Classification from Pairwise Similarity and Unlabeled Datacited by 36
  8. 2019Learning from Label Proportions with Consistency Regularizationcited by 34
  9. 2019Mitigating Overfitting in Supervised Classification from Two Unlabeled Datasets: A Consistent Risk Correction Approachcited by 29
  10. 2016Estimating the class prior and posterior from noisy positives and unlabeled datacited by 25
  11. 2020A One-step Approach to Covariate Shift Adaptationcited by 20
  12. 2020Pointwise Binary Classification with Pairwise Confidence Comparisonscited by 20
  13. 2020Negative Pseudo Labeling using Class Proportion for Semantic Segmentation in Pathologycited by 12
  14. 2019Uncoupled Regression from Pairwise Comparison Datacited by 6
  15. 2020Learning from Label Proportions: A Mutual Contamination Frameworkcited by 6
  16. 2017Mining the Demographics of Political Sentiment from Twitter Using Learning from Label Proportionscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 4; 2024: 0; 2025: 4; 2026: 2.

12 papers.