Generalized Distribution-Free Semi-Supervised Learning with Risk Rewrite

Typical semi-supervised learning (SSL) methods rely on distributional assumptions, and their performance degrades when these are violated.

While PNU learning, a risk rewriting method, offers a distribution-free alternative, it is restricted to binary classification and its variance optimality remains unclear.

In this paper, we propose a generalized framework that constructs unbiased risk estimators using linear combinations of component risks, subsuming PNU learning and extending to multiclass classification.

We derive the minimum achievable variance, demonstrating our estimator can attain lower variance than PNU in asymmetric loss scenarios.

Furthermore, we establish a generalization bound directly linking this variance reduction to improved learning performance.

Based on these theoretical insights, we introduce two practical SSL methods that empirically match or outperform existing approaches on binary and multiclass benchmarks.