Semi-supervised Stacking Ensemble
Semi-supervised Stacking Ensemble (Self-trained Stacked Generalization) · Also known as: SSL stacking, semi-supervised stacked generalization, self-trained stacking, semi-supervised meta-learning ensemble
Semi-supervised Stacking Ensemble extends the classic stacked generalization framework to settings where only a fraction of training examples carry labels. Base learners are first trained on labeled data, then used to assign pseudo-labels to unlabeled examples; the expanded dataset trains stronger base models whose out-of-fold predictions form the input to a meta-learner, yielding a two-tier ensemble that exploits both labeled and unlabeled structure.
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.
When to use it
Use semi-supervised stacking when you have a classification or regression task with a small labeled dataset and a large pool of unlabeled feature vectors — a common setting in medical imaging, NLP, or remote sensing where annotation is expensive. It is especially effective when the unlabeled data is drawn from the same distribution as the labeled data and when at least 3–5 diverse base learner families are available. Avoid it when the unlabeled pool is small (giving no benefit over standard stacking), when the labeled set is already large enough that semi-supervised gains are marginal, or when distribution shift between labeled and unlabeled examples is suspected, as pseudo-label errors will compound across iterations.
Strengths & limitations
- Leverages large pools of unlabeled data without additional annotation cost, often substantially improving accuracy over supervised-only stacking.
- Inherits all the benefits of classical stacking: diversity across base learners reduces variance and bias simultaneously.
- Flexible: any supervised learner can serve as a base model or meta-learner, making the framework broadly applicable.
- Confidence thresholding gives a principled mechanism to control the quality of pseudo-labels introduced at each iteration.
- Scales well — unlabeled data is cheap, so the method becomes more valuable as the ratio of unlabeled to labeled examples grows.
- Pseudo-label errors accumulate over iterations; if the initial base models are weak, erroneous pseudo-labels can degrade rather than improve performance.
- Hyperparameter surface is wide: number of iterations, confidence threshold, number of folds, and base-learner diversity all interact.
- Computationally expensive: k-fold retraining across multiple base learners is repeated for several iterations, so runtime grows quickly.
- Requires that the unlabeled distribution closely matches the labeled distribution; covariate shift invalidates the pseudo-labeling assumption.
- Interpretability is low — two stacked tiers plus iterative pseudo-labeling make it difficult to trace how any individual prediction was formed.
Frequently asked
How do I choose the confidence threshold for pseudo-labeling?
A common starting point is 0.9 or higher for classification, meaning only examples where the leading class probability exceeds 90% receive a pseudo-label. The threshold can be relaxed in later iterations as base models improve. Always monitor validation accuracy across iterations to catch threshold values that introduce too much noise.
Which base learners should I use?
Diversity is the key principle. A typical combination pairs gradient-boosted trees (e.g., XGBoost), an SVM with a radial kernel, and a neural network. Combining models that differ in bias-variance profile and in the feature relationships they capture yields the most informative meta-features for the second tier.
How is this different from standard stacking?
Standard stacking uses only labeled data throughout. Semi-supervised stacking adds a pseudo-labeling loop that iteratively expands the effective training set with high-confidence unlabeled examples, so it is most useful when labeled data is scarce and unlabeled data is abundant.
Can it handle regression as well as classification?
Yes. For regression, confidence thresholding is replaced by a residual-based criterion — for example, including pseudo-labeled examples whose predicted value is stable (low variance) across base models. The meta-learner then combines continuous outputs rather than class probabilities.
What is the risk of label propagation errors?
If the initial base models are inaccurate, their confident predictions may still be wrong, and those errors are reinforced in subsequent iterations. Using a high initial confidence threshold, monitoring a held-out labeled validation set across iterations, and stopping when validation performance stops improving are the main defenses.
Sources
- Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241–259. DOI: 10.1016/S0893-6080(05)80023-1 ↗
- Chapelle, O., Schölkopf, B., & Zien, A. (Eds.). (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
How to cite this page
ScholarGate. (2026, June 3). Semi-supervised Stacking Ensemble (Self-trained Stacked Generalization). ScholarGate. https://scholargate.app/en/machine-learning/semi-supervised-stacking-ensemble
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.
- Bagging EnsembleEnsemble Learning↔ compare
- Gradient BoostingMachine learning↔ compare
- Label PropagationMachine learning↔ compare
- Random ForestMachine learning↔ compare
- StackingMachine learning↔ compare