mlsanityData to 7 Oct 2026

They are Not Completely Useless: Towards Recycling Transferable Unlabeled Data for Class-Mismatched Semi-Supervised Learning

arXiv 2011.13529 ↗First posted 27 Nov 2020cs.LG cs.CVcited by 18

Not on the map. Why?

Abstract (arXiv)

Semi-Supervised Learning (SSL) with mismatched classes deals with the problem that the classes-of-interests in the limited labeled data is only a subset of the classes in massive unlabeled data. As a result, the classes only possessed by the unlabeled data may mislead the classifier training and thus hindering the realistic landing of various SSL methods. To solve this problem, existing methods usually divide unlabeled data to in-distribution (ID) data and out-of-distribution (OOD) data, and directly discard or weaken the OOD data to avoid their adverse impact. In other words, they treat OOD data as completely useless and thus the potential valuable information for classification contained by them is totally ignored. To remedy this defect, this paper proposes a "Transferable OOD data Recycling" (TOOR) method which properly utilizes ID data as well as the "recyclable" OOD data to enrich the information for conducting class-mismatched SSL. Specifically, TOOR firstly attributes all unlabeled data to ID data or OOD data, among which the ID data are directly used for training. Then we treat the OOD data that have a close relationship with ID data and labeled data as recyclable, and employ adversarial domain adaptation to project them to the space of ID data and labeled data. In other words, the recyclability of an OOD datum is evaluated by its transferability, and the recyclable OOD data are transferred so that they are compatible with the distribution of known classes-of-interests. Consequently, our TOOR method extracts more information from unlabeled data than existing approaches, so it can achieve the improved performance which is demonstrated by the experiments on typical benchmark datasets.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Nov 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

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

18 papers.

Sort:

By area:

  1. 2022Harnessing Out-Of-Distribution Examples via Augmenting Content and Stylecited by 43
  2. 2023Robust Generalization against Photon-Limited Corruptions via Worst-Case Sharpness Minimizationcited by 29
  3. 2023FlatMatch: Bridging Labeled Data and Unlabeled Data with Cross-Sharpness for Semi-Supervised Learningcited by 20
  4. 2024Robust Semi-supervised Learning by Wisely Leveraging Open-set Datacited by 20
  5. 2023InstanT: Semi-supervised Learning with Instance-dependent Thresholdscited by 13
  6. 2023Winning Prize Comes from Losing Tickets: Improve Invariant Learning by Exploring Variant Parameters for Out-of-Distribution Generalizationcited by 12
  7. 2022Fix-A-Step: Semi-supervised Learning from Uncurated Unlabeled Datacited by 11
  8. 2023RoPAWS: Robust Semi-supervised Representation Learning from Uncurated Datacited by 10
  9. 2023SSB: Simple but Strong Baseline for Boosting Performance of Open-Set Semi-Supervised Learningcited by 9
  10. 2023Improving Open-Set Semi-Supervised Learning with Self-Supervisioncited by 6
  11. 2023On Pseudo-Labeling for Class-Mismatch Semi-Supervised Learningcited by 4
  12. 2024ProSub: Probabilistic Open-Set Semi-Supervised Learning with Subspace-Based Out-of-Distribution Detectioncited by 3
6 more
  1. 2023Exploration and Exploitation of Unlabeled Data for Open-Set Semi-Supervised Learningcited by 2
  2. 2025Diversify and Conquer: Open-set Disagreement for Robust Semi-supervised Learning with Outlierscited by 1
  3. 2024Diverse Teacher-Students for Deep Safe Semi-Supervised Learning under Class Mismatchcited by 0
  4. 2024Safe Semi-Supervised Contrastive Learning Using In-Distribution Data as Positive Examplescited by 0
  5. 2026BrokenBind: Universal Modality Exploration beyond Dataset Boundariescited by 0
  6. 2026MeGU: Machine-Guided Unlearning with Target Feature Disentanglementcited by 0