How Does Pseudo-Labeling Affect the Generalization Error of the Semi-Supervised Gibbs Algorithm?
Not on the map. Why?
Abstract (arXiv)
We provide an exact characterization of the expected generalization error (gen-error) for semi-supervised learning (SSL) with pseudo-labeling via the Gibbs algorithm. The gen-error is expressed in terms of the symmetrized KL information between the output hypothesis, the pseudo-labeled dataset, and the labeled dataset. Distribution-free upper and lower bounds on the gen-error can also be obtained. Our findings offer new insights that the generalization performance of SSL with pseudo-labeling is affected not only by the information between the output hypothesis and input training data but also by the information em shared between the em labeled and em pseudo-labeled data samples. This serves as a guideline to choose an appropriate pseudo-labeling method from a given family of methods. To deepen our understanding, we further explore two examples -- mean estimation and logistic regression. In particular, we analyze how the ratio of the number of unlabeled to labeled data λ affects the gen-error under both scenarios. As λ increases, the gen-error for mean estimation decreases and then saturates at a value larger than when all the samples are labeled, and the gap can be quantified em exactly with our analysis, and is dependent on the cross-covariance between the labeled and pseudo-labeled data samples. For logistic regression, the gen-error and the variance component of the excess risk also decrease as λ increases.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 24 of its 57 references that are in the map. First posted on arXiv 15 Oct 2022.
Builds on
24 of 57 references.
References · 24
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
- 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,390
- 2019Pseudo-Labeling and Confirmation Bias in Deep Semi-Supervised Learningcited by 507
- 2021In Defense of Pseudo-Labeling: An Uncertainty-Aware Pseudo-label Selection Framework for Semi-Supervised Learningcited by 301
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
- 2019Label Propagation for Deep Semi-supervised Learningcited by 287
- 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 242
- 2020Theoretical Analysis of Self-Training with Deep Networks on Unlabeled Datacited by 179
- 2020Reasoning About Generalization via Conditional Mutual Informationcited by 145
- 2020An Overview of Deep Semi-Supervised Learningcited by 121
- 2019Tightening Mutual Information Based Bounds on Generalization Errorcited by 117
- 2015How much does your data exploration overfit? Controlling bias via information usagecited by 95
12 more
- 2020Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithmscited by 89
- 2018Chaining Mutual Information and Tightening Generalization Boundscited by 65
- 2019Generalization Error Bounds Via R'enyi-, f-Divergences and Maximal Leakagecited by 48
- 2022An Information-theoretical Approach to Semi-supervised Learning under Covariate-shiftcited by 18
- 2019Distribution-Dependent Analysis of Gibbs-ERM Principlecited by 17
- 2019When can unlabeled data improve the learning rate?cited by 14
- 2021Characterizing and Understanding the Generalization Error of Transfer Learning with Gibbs Algorithmcited by 14
- 2021Information-Theoretic Bounds on the Moments of the Generalization Error of Learning Algorithmscited by 12
- 2021Information-Theoretic Characterization of the Generalization Error for Iterative Semi-Supervised Learningcited by 11
- 2020Semi-Supervised Learning: the Case When Unlabeled Data is Equally Usefulcited by 9
- 2019Chaining Meets Chain Rule: Multilevel Entropic Regularization and Training of Neural Netscited by 6
- 2022Learning Algorithm Generalization Error Bounds via Auxiliary Distributionscited by 6
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 3.
5 papers.
- 2025Prediction-Powered Semi-Supervised Learning with Online Power Tuningcited by 5
- 2024Robust Semi-supervised Learning via f-Divergence and α-R'enyi Divergencecited by 3
- 2025Variations on the Expectation due to Changes in the Probability Measurecited by 3
- 2023On the Generalization Error of Meta Learning for the Gibbs Algorithmcited by 2
- 2025PTCL: Pseudo-Label Temporal Curriculum Learning for Label-Limited Dynamic Graphcited by 0
- 2025Prediction-Powered Semi-Supervised Learning with Online Power Tuning26 Oct 2025
- 2025PTCL: Pseudo-Label Temporal Curriculum Learning for Label-Limited Dynamic Graph24 Apr 2025
- 2025Variations on the Expectation due to Changes in the Probability Measure5 Feb 2025
- 2024Robust Semi-supervised Learning via f-Divergence and α-R'enyi Divergence1 May 2024
- 2023On the Generalization Error of Meta Learning for the Gibbs Algorithm27 Apr 2023