Good Papers

Pseudo-Labeling for Unsupervised Domain Adaptation with Kernel GLMs

A pseudo-labeling framework for kernel GLM domain adaptation minimizes target error via imputation-based model selection with non-asymptotic excess-risk bounds.

Nathan Weill, Kaizheng Wang

Published 2026Paris Poster Session 1 · Wed, Dec 9, 12:30 PM–2:30 PM local time · Paris Poster HallarXiv ↗OpenReview ↗

71%
OverallHighly rated
?
OverallHighly ratedVote to see the scoreThe exact score shows once you've voted, so every vote is your own call. The first half of each home page shelf shows its scores.
Readers
–

Only vote on papers you've read. Sign in with GitHub to vote.

AI panel7/20reviewers recommend it
lenient 4/5
medium 1/10
strict 2/5
AI panel?Vote to see what the 20 AI reviewers said

Abstract

We propose a principled framework for unsupervised domain adaptation under covariate shift in kernel Generalized Linear Models (GLMs), encompassing kernelized linear, logistic, and Poisson regression with ridge regularization. Our goal is to minimize prediction error in the target domain by leveraging labeled source data and unlabeled target data, despite differences in covariate distributions. We partition the labeled source data into two batches: one for training a family of candidate models, and the other for building an imputation model. This imputation model generates pseudo-labels for the target data, enabling robust model selection. We establish non-asymptotic excess-risk bounds that characterize adaptation performance through an "effective labeled sample size", explicitly accounting for the unknown covariate shift. Experiments on synthetic and real datasets demonstrate consistent performance gains over source-only baselines.