Semi-supervised Learning
Semi-supervised Learning (Combined Labeled and Unlabeled Data Training) · Also known as: SSL, semi-supervised machine learning, transductive learning, label-efficient learning
Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
+61 more
When to use it
Use semi-supervised learning when you have abundant unlabeled data but labeling is expensive, slow, or requires scarce expert knowledge — common in medical imaging, natural language processing, and scientific domains. SSL is appropriate when unlabeled and labeled data share the same distribution, when the cluster or manifold assumption plausibly holds, and when a fully supervised baseline is already feasible but its accuracy is limited by label scarcity. Do NOT use SSL when the labeled and unlabeled data come from different distributions (distribution shift); when unlabeled data are very scarce; when the task is simple enough that a small labeled set already saturates model capacity; or when pseudo-label error would compound faster than the model can correct — as happens with high-entropy or imbalanced outputs.
Strengths & limitations
- Substantially improves model accuracy when labeled data are scarce but unlabeled data are plentiful.
- Reduces annotation cost and time, enabling practical deployment in expert-labeling-heavy domains.
- Compatible with almost any base learner (neural networks, random forests, SVMs, GPs) via pseudo-labeling or graph-based extensions.
- Label propagation and graph-based methods provide interpretable uncertainty and neighborhood structure.
- Self-training and consistency regularization integrate naturally into standard training pipelines with minimal additional infrastructure.
- Performance can degrade below the supervised baseline if the unlabeled data violate the cluster or smoothness assumption or contain distribution shift.
- Pseudo-label error accumulates over iterations: confident but wrong predictions corrupt subsequent training.
- Requires careful tuning of confidence thresholds, regularization strength, and the ratio of labeled to unlabeled data.
- Evaluation is harder: the unlabeled set must never be used for model selection unless strictly held out.
- Computational cost rises with large unlabeled corpora, especially for graph-based methods that require pairwise similarities.
Frequently asked
How is semi-supervised learning different from self-supervised learning?
Semi-supervised learning uses a small set of human-provided labels together with unlabeled data to improve a supervised task. Self-supervised learning creates its own labels from the structure of unlabeled data alone (e.g., predicting masked words) — no human labels are used during pretraining, though the learned representations are later fine-tuned on labeled data.
When does semi-supervised learning hurt rather than help?
If the unlabeled data come from a different distribution than the labeled data, or if the class boundaries do not align with the natural clusters in the data, SSL can introduce noise that reduces accuracy below the supervised baseline. Always compare against a supervised-only model.
What is the simplest SSL algorithm to try first?
Self-training is the most straightforward: train on labels, predict on unlabeled data, add high-confidence predictions back as labeled data, and retrain. It works with any base learner and serves as a useful baseline before more complex graph or consistency-regularization methods.
How much labeled data is typically needed?
There is no universal answer, but SSL is most beneficial when labeled data represent 1–10% of the total dataset. Below roughly 10–50 labeled examples per class, even SSL can struggle; at that point active learning to prioritize which examples to label may be more effective.
Can semi-supervised learning be used with any model type?
Yes. Pseudo-labeling and self-training work with any base learner. Graph-based methods such as label propagation are model-agnostic but require computing pairwise similarities. Consistency regularization methods are most naturally applied to neural networks but can be adapted to other probabilistic models.
Sources
- Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
- Zhu, X. (2005). Semi-supervised learning literature survey. Technical Report 1530, University of Wisconsin-Madison. link ↗
How to cite this page
ScholarGate. (2026, June 3). Semi-supervised Learning (Combined Labeled and Unlabeled Data Training). ScholarGate. https://scholargate.app/en/machine-learning/semi-supervised-learning
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Active LearningMachine learning↔ compare
- Few-shot LearningMachine learning↔ compare
- Self-supervised LearningMachine learning↔ compare
- Semi-supervised Random ForestMachine learning↔ compare
- Transfer LearningMachine learning↔ compare