Table of Contents
Fetching ...

Prediction-Powered Semi-Supervised Learning with Online Power Tuning

Noa Shoham, Ron Dorfman, Shalev Shaer, Kfir Y. Levy, Yaniv Romano

TL;DR

PP-SSL tackles pseudo-label bias in semi-supervised learning by deriving an unbiased gradient estimator that combines labeled and pseudo-labeled data via $g_{PP}^{\lambda}$. It extends Prediction-Powered Inference to SSL and introduces online tuning of the interpolation weight $\lambda$ using AdaGrad, yielding finite-time convergence guarantees that approach the offline optimum $\lambda^* = \tfrac{1}{1+r}\cdot\tfrac{\sigma^2}{\sigma^2+\sigma_e^2}$. Theoretical results bound the gradient variance in terms of teacher error $\mathcal{E}^f$ and data ratio $r$, and show convergence rates of $\mathcal{O}(\sqrt{V^*/T})$ with online adaptation. Empirically, PP-SSL with online tuning outperforms standard SSL and PPI-based methods on synthetic and real datasets, especially when the teacher underperforms on a subgroup, and achieves faster convergence. This work offers a principled, scalable framework for robust SSL under imperfect pseudo-labels with practical online parameter tuning.

Abstract

Prediction-Powered Inference (PPI) is a recently proposed statistical inference technique for parameter estimation that leverages pseudo-labels on both labeled and unlabeled data to construct an unbiased, low-variance estimator. In this work, we extend its core idea to semi-supervised learning (SSL) for model training, introducing a novel unbiased gradient estimator. This extension addresses a key challenge in SSL: while unlabeled data can improve model performance, its benefit heavily depends on the quality of pseudo-labels. Inaccurate pseudo-labels can introduce bias, leading to suboptimal models.To balance the contributions of labeled and pseudo-labeled data, we utilize an interpolation parameter and tune it on the fly, alongside the model parameters, using a one-dimensional online learning algorithm. We verify the practical advantage of our approach through experiments on both synthetic and real datasets, demonstrating improved performance over classic SSL baselines and PPI methods that tune the interpolation parameter offline.

Prediction-Powered Semi-Supervised Learning with Online Power Tuning

TL;DR

PP-SSL tackles pseudo-label bias in semi-supervised learning by deriving an unbiased gradient estimator that combines labeled and pseudo-labeled data via . It extends Prediction-Powered Inference to SSL and introduces online tuning of the interpolation weight using AdaGrad, yielding finite-time convergence guarantees that approach the offline optimum . Theoretical results bound the gradient variance in terms of teacher error and data ratio , and show convergence rates of with online adaptation. Empirically, PP-SSL with online tuning outperforms standard SSL and PPI-based methods on synthetic and real datasets, especially when the teacher underperforms on a subgroup, and achieves faster convergence. This work offers a principled, scalable framework for robust SSL under imperfect pseudo-labels with practical online parameter tuning.

Abstract

Prediction-Powered Inference (PPI) is a recently proposed statistical inference technique for parameter estimation that leverages pseudo-labels on both labeled and unlabeled data to construct an unbiased, low-variance estimator. In this work, we extend its core idea to semi-supervised learning (SSL) for model training, introducing a novel unbiased gradient estimator. This extension addresses a key challenge in SSL: while unlabeled data can improve model performance, its benefit heavily depends on the quality of pseudo-labels. Inaccurate pseudo-labels can introduce bias, leading to suboptimal models.To balance the contributions of labeled and pseudo-labeled data, we utilize an interpolation parameter and tune it on the fly, alongside the model parameters, using a one-dimensional online learning algorithm. We verify the practical advantage of our approach through experiments on both synthetic and real datasets, demonstrating improved performance over classic SSL baselines and PPI methods that tune the interpolation parameter offline.
Paper Structure (79 sections, 9 theorems, 56 equations, 17 figures, 9 tables, 1 algorithm)

This paper contains 79 sections, 9 theorems, 56 equations, 17 figures, 9 tables, 1 algorithm.

Key Result

Lemma 3.1

Assume that the gradient $\nabla \ell(w;x,y)$ is $L_Y$-Lipschitz in $y$, i.e., for any $w\in\mathbb{R}^d, x\in\mathcal{X}$, and $y_1,y_2\in\mathcal{Y}$, we have $\|\nabla \ell(w;x,y_1)-\nabla \ell(w;x,y_2)\|\leq L_Y|y_1-y_2|$. Then, $\sigma_e^2 \leq L_Y^2 \cdot \mathcal{E}^{f}$.

Figures (17)

  • Figure 1: MSE on synthetic data as a function of noise bias $\mu$. Results are shown for: (a) the full test set; (b) Group A, where the teacher model is accurate (oracle-like); and (c) Group B, which includes additive biased noise. Results evaluated on 100 independent experiments.
  • Figure 2: Final test set MSE for PP-SSL and PPI baseline with constant $\lambda$ for varying $\lambda$ values.
  • Figure 3: Results for the California Housing dataset: MSE of various methods as a function of $N_B/N_A$---the fraction of samples from each group used to train the Teacher model; e.g., $N_B/N_A\!=\!0.5$ means twice as many group A samples as group B. Results correspond to 100 data splits.
  • Figure 4: Results for age estimation: MAE as a function of $N_B/N_A$, across 5 data splits.
  • Figure 5: Accuracy on CIFAR-10 data as a function of corruption type. Results are shown for: (a) the full test set; (b) Group A, clean images; and (c) Group B, corrupted images. Results evaluated on 5 different seeds.
  • ...and 12 more figures

Theorems & Definitions (14)

  • Lemma 3.1
  • Lemma 3.2
  • Corollary 3.3
  • Lemma 3.4: AdaGrad's Regret Bound
  • Theorem 3.5
  • proof
  • proof
  • Lemma B.1
  • Lemma B.2
  • Lemma B.3
  • ...and 4 more