Semi-supervised regression sits at the intersection of two worlds. In supervised learning, every training example comes with a known target value, such as the exact energy output of a solar panel or the measured concentration of a pollutant. In unsupervised learning, the algorithm must find structure without any answers at all. Semi-supervised methods try to have it both ways, using a small labeled set to anchor the model and a much larger unlabeled set to refine it. The promise is enormous, because collecting raw measurements is usually far cheaper than annotating them, and domains from biomedicine to finance to industrial manufacturing are drowning in unannotated numerical data.

The dominant strategies in this field have long followed a conservative philosophy. Early approaches selected only a small number of high-confidence unlabeled examples and folded them into the training data, effectively discarding the rest. This filtering kept the training signal clean, but it also threw away most of the information contained in the unlabeled pool. More recent methods took the opposite approach, using off-the-shelf semi-supervised regressors to generate pseudo-labels, which are the model’s own predictions treated as if they were ground truth, for every unlabeled example. The problem, as the Chinese team points out, is that these methods treat all pseudo-labels uniformly during training, ignoring the inherent quality differences among them and potentially injecting significant noise into the learning process.

FullReg addresses this weakness with two interlocking mechanisms. The first is a confidence-weighting scheme based on data similarity. Rather than accepting every pseudo-label at face value, the framework assigns each one a weight in the loss function that reflects how trustworthy it is likely to be. The intuition is geometric: if an unlabeled example sits close to labeled examples in the input space, its neighbors’ known target values provide meaningful evidence about what its own target should be, so its pseudo-label earns a high weight. If an unlabeled point floats in a sparse region far from any labeled data, the model’s guess about its value is essentially unsupported, and the weight drops accordingly. By modulating the contribution of each pseudo-label to the overall loss, the mechanism dampens the influence of unreliable predictions and preserves the validity of the training signal.

This idea of weighting by similarity has deep roots in statistical learning, where kernel methods and locally weighted regression have long recognized that predictions are more reliable near observed data. What FullReg adds is a systematic way to translate that geometric intuition into the training dynamics of a neural network performing semi-supervised regression. The result is a framework that can exploit the entire unlabeled pool, as the newer generation of methods does, while retaining the noise resistance that made the older, selective approaches robust. In effect, the model no longer has to choose between using all of its data and trusting what that data tells it.

The second innovation is a residual-connection mechanism that operates across training epochs rather than across network layers. The name deliberately echoes the residual connections popularized by deep residual networks in computer vision, where skip links allow information to bypass layers and stabilize training. Here, the connection is temporal: at each epoch, the framework blends the model parameters inherited from previous epochs with the parameters being learned in the current one. Instead of letting the network lurch toward whatever solution the latest batch of data suggests, the residual mechanism anchors it to its own history, producing a trajectory of parameter updates that evolves progressively rather than erratically.

This temporal smoothing serves a similar purpose to techniques such as temporal ensembling and weight averaging, which have been shown in prior research to lead neural networks toward wider optima and better generalization. It also echoes the mean teacher paradigm, in which an averaged copy of a model provides steadier training targets than the model itself. By embedding that stabilizing principle directly into the parameter updates of a semi-supervised regression pipeline, FullReg gains resilience against the fluctuations that pseudo-label noise would otherwise introduce. The two mechanisms reinforce each other: confidence weighting reduces the noise entering the loss, while residual connections prevent whatever noise remains from destabilizing the learned parameters.

To test the framework, the researchers ran experiments on benchmark datasets drawn from five distinct domains, spanning biomedical, business, ecology, physical, and life sciences data, sourced from public repositories including the UCI Machine Learning Repository, the Delve repository, and the StatLib archive. They also evaluated the method on a real-world solar photovoltaic dataset, a setting where accurate regression matters for forecasting power generation from grid-connected installations. Across these benchmarks, FullReg was compared against eight state-of-the-art semi-supervised regression algorithms, and it compared favorably in most benchmark settings, suggesting that the combination of full data utilization and noise-aware training translates into measurable predictive gains rather than merely theoretical elegance.

The practical implications extend well beyond benchmark tables. Consider solar power forecasting, where weather stations, inverter readings, and satellite imagery generate torrents of measurements but ground-truth labels for every operating condition are scarce. A framework that can safely exploit all of that unlabeled data, rather than a hand-picked high-confidence subset, could sharpen the forecasts that grid operators rely on to balance supply and demand. Similar logic applies to air temperature mapping, stock price prediction during volatile periods, thermal error compensation in precision manufacturing, and clinical risk prediction, all of which are cited in the study’s bibliography as active application areas for semi-supervised regression. In each case, the bottleneck is the same: labeled examples are few, unlabeled examples are plentiful, and the quality of machine-generated labels varies wildly.

The work also contributes to a broader conversation in machine learning about how models should treat their own outputs. Pseudo-labeling has become a cornerstone of modern semi-supervised learning, powering influential techniques in image classification, semantic segmentation, and few-shot learning, yet the calibration of pseudo-label quality remains an open problem. FullReg’s answer, grounding confidence in data similarity and stabilizing learning through temporal residual connections, offers a template that other researchers may adapt to classification and other tasks. The authors have made their benchmark analysis transparent, drawing on publicly available datasets, with the solar photovoltaic dataset and code available from the corresponding author on reasonable request. As unlabeled data continues to accumulate faster than any labeling effort could match, methods like this one, which learn to distrust their own mistakes in a principled way, may define the next generation of practical machine learning.

Subject of Research: Semi-supervised regression using confidence-weighted pseudo-labels and residual parameter connections

Article Title: Semi-supervised regression via confidence-weighting and residual-connection

Article References: Liu, L., Mao, Y., Lu, X., & Min, F. (2026). Semi-supervised regression via confidence-weighting and residual-connection. Applied Intelligence, 56(15), Article 440. https://doi.org/10.1007/s10489-026-07489-3

Image Credits: AI Generated

DOI: 10.1007/s10489-026-07489-3

Keywords: semi-supervised regression, pseudo-labels, confidence weighting, data similarity, residual connections, neural networks, machine learning, unlabeled data, solar photovoltaic forecasting, Applied Intelligence, Southwest Petroleum University, loss function