Boosting Semi-Supervised Learning With Entropy-Guided Adaptive Reward Maximization
Existing semi-supervised learning (SSL) methods rely predominantly on pseudo-labeling and consistency regularization to leverage unlabeled data, demonstrating significant performance improvements. However, we pinpoint that these methods suffer from a confidence-for-weighting issue, overvaluing high-confidence pseudo-labels while undervaluing low-confidence yet informative samples that are critical for robust generalization. In this paper, we introduce EntropyMatch, an entropy-driven SSL framework that redefines sample importance through prediction entropy rather than confidence alone. EntropyMatch employs a bidirectional weighting strategy: upward exploitation exploits reliable hard samples to refine decision boundaries while downward exploration cautiously explores uncertain ones to reduce noise. Additionally, EntropyMatch features an adaptive training mechanism that aligns with model maturity, shifting focus from safe exploration to strategic exploitation as training progresses. Experiments on eight benchmarks across various SSL tasks—spanning image classification, facial expression recognition, and human action recognition—validate EntropyMatch’s robustness and effectiveness. It consistently achieves state-of-the-art results, notably matching state-of-the-art LION’s performance on RAF-DB with just half the labeled data, demonstrating superior data efficiency and generalization.