mlsanityData to 7 Oct 2026

Rethinking Guidance Information to Utilize Unlabeled Samples:A Label Encoding Perspective

arXiv 2406.02862 ↗First posted 5 Jun 2024cs.CVcited by 4

Not on the map. Why?

Abstract (arXiv)

Empirical Risk Minimization (ERM) is fragile in scenarios with insufficient labeled samples. A vanilla extension of ERM to unlabeled samples is Entropy Minimization (EntMin), which employs the soft-labels of unlabeled samples to guide their learning. However, EntMin emphasizes prediction discriminability while neglecting prediction diversity. To alleviate this issue, in this paper, we rethink the guidance information to utilize unlabeled samples. By analyzing the learning objective of ERM, we find that the guidance information for labeled samples in a specific category is the corresponding label encoding. Inspired by this finding, we propose a Label-Encoding Risk Minimization (LERM). It first estimates the label encodings through prediction means of unlabeled samples and then aligns them with their corresponding ground-truth label encodings. As a result, the LERM ensures both prediction discriminability and diversity, and it can be integrated into existing methods as a plugin. Theoretically, we analyze the relationships between LERM and ERM as well as EntMin. Empirically, we verify the superiority of the LERM under several label insufficient scenarios. The codes are available at https://github.com/zhangyl660/LERM.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 24 of its 45 references that are in the map. First posted on arXiv 5 Jun 2024.

Builds on

24 of 45 references.

References · 24

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  4. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
  5. 2013Describing Textures in the Wildcited by 2,110
  6. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
  7. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
  8. 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,390
  9. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
  10. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
  11. 2018ADVENT: Adversarial Entropy Minimization for Domain Adaptation in Semantic Segmentationcited by 623
  12. 2021FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labelingcited by 537
12 more
  1. 2017VisDA: The Visual Domain Adaptation Challengecited by 432
  2. 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 422
  3. 2016Unsupervised Domain Adaptation with Residual Transfer Networkscited by 340
  4. 2020Towards Discriminability and Diversity: Batch Nuclear-norm Maximization under Label Insufficient Situationscited by 133
  5. 2022A Closer Look at Smoothness in Domain Adversarial Trainingcited by 85
  6. 2022Debiased Self-Training for Semi-Supervised Learningcited by 62
  7. 2023Optimal Transport for Treatment Effect Estimationcited by 32
  8. 2021Learning Bounds for Open-Set Learningcited by 27
  9. 2020Simultaneous Semantic Alignment Network for Heterogeneous Domain Adaptationcited by 21
  10. 2022FisherMatch: Semi-Supervised Rotation Regression via Entropy-based Filteringcited by 16
  11. 2019Heterogeneous Domain Adaptation via Soft Transfer Networkcited by 14
  12. 2023Domain-Guided Conditional Diffusion Model for Unsupervised Domain Adaptationcited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.