Pseudo-Labeling for Unsupervised Domain Adaptation with Kernel GLMs

• URL: http://arxiv.org/abs/2603.19422v1
• Date: Thu, 19 Mar 2026 19:31:47 GMT
• Title: Pseudo-Labeling for Unsupervised Domain Adaptation with Kernel GLMs
• Abstract summary: We propose a principled framework for unsupervised domain adaptation.<n>Our goal is to minimize prediction error in the target domain by leveraging labeled source data and unlabeled target data.<n>Experiments on synthetic and real datasets demonstrate consistent performance gains over source-only baselines.
• Score: 4.153834414190214
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• The Mean is the Mirage: Entropy-Adaptive Model Merging under Heterogeneous Domain Shifts in Medical Imaging [3.597779662054083]
  Model merging under unseen test-time distribution shifts often renders naive strategies, such as mean averaging unreliable.<n>We introduce an entropy-adaptive, fully online model-merging method that yields a batch-specific merged model via only forward passes.<n>We extensively evaluate our method with state-of-the-art baselines using two backbones across nine medical and natural-domain generalization image classification datasets.
  arXiv  Detail & Related papers  (2026-02-24T21:06:19Z)
• Model Adaptation: Unsupervised Domain Adaptation without Source Data [18.432169569171933]
  We investigate a challenging unsupervised domain adaptation setting -- unsupervised model adaptation.<n>We propose a new framework, which is referred to as collaborative class conditional generative adversarial net.<n>Our model achieves superior performance on multiple adaptation tasks with only unlabeled target data.
  arXiv  Detail & Related papers  (2025-02-26T17:10:52Z)
• GenGMM: Generalized Gaussian-Mixture-based Domain Adaptation Model for Semantic Segmentation [0.9626666671366837]
  We introduce the Generalized Gaussian-mixture-based (GenGMM) domain adaptation model, which harnesses the underlying data distribution in both domains. Experiments demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2024-10-21T20:21:09Z)
• Incremental Pseudo-Labeling for Black-Box Unsupervised Domain Adaptation [14.596659424489223]
  We propose a novel approach that incrementally selects high-confidence pseudo-labels to improve the generalization ability of the target model. Experimental results demonstrate that the proposed method achieves state-of-the-art black-box unsupervised domain adaptation performance on three benchmark datasets.
  arXiv  Detail & Related papers  (2024-05-26T05:41:42Z)
• Pseudo-Labeling for Kernel Ridge Regression under Covariate Shift [1.3597551064547502]
  We learn a regression function with small mean squared error over a target distribution, based on unlabeled data from there and labeled data that may have a different feature distribution.<n>We propose to split the labeled data into two subsets, and conduct kernel ridge regression on them separately to obtain a collection of candidate models and an imputation model.<n>Our estimator achieves the minimax optimal error rate up to a polylogarithmic factor, and we find that using pseudo-labels for model selection does not significantly hinder performance.
  arXiv  Detail & Related papers  (2023-02-20T18:46:12Z)
• Adapting to Latent Subgroup Shifts via Concepts and Proxies [82.01141290360562]
  We show that the optimal target predictor can be non-parametrically identified with the help of concept and proxy variables available only in the source domain. For continuous observations, we propose a latent variable model specific to the data generation process at hand.
  arXiv  Detail & Related papers  (2022-12-21T18:30:22Z)
• Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning [122.62311703151215]
  Divide and Contrast (DaC) aims to connect the good ends of both worlds while bypassing their limitations. DaC divides the target data into source-like and target-specific samples, where either group of samples is treated with tailored goals. We further align the source-like domain with the target-specific samples using a memory bank-based Maximum Mean Discrepancy (MMD) loss to reduce the distribution mismatch.
  arXiv  Detail & Related papers  (2022-11-12T09:21:49Z)
• Robust Target Training for Multi-Source Domain Adaptation [110.77704026569499]
  We propose a novel Bi-level Optimization based Robust Target Training (BORT$2$) method for MSDA. Our proposed method achieves the state of the art performance on three MSDA benchmarks, including the large-scale DomainNet dataset.
  arXiv  Detail & Related papers  (2022-10-04T15:20:01Z)
• On Balancing Bias and Variance in Unsupervised Multi-Source-Free Domain Adaptation [6.2200089460762085]
  Methods for multi-source-free domain adaptation (MSFDA) typically train a target model using pseudo-labeled data produced by the source models. We develop an information-theoretic bound on the generalization error of the resulting target model. We then provide insights on how to balance this trade-off from three perspectives, including domain aggregation, selective pseudo-labeling, and joint feature alignment.
  arXiv  Detail & Related papers  (2022-02-01T22:34:18Z)
• Leveraging Unlabeled Data to Predict Out-of-Distribution Performance [63.740181251997306]
  Real-world machine learning deployments are characterized by mismatches between the source (training) and target (test) distributions. In this work, we investigate methods for predicting the target domain accuracy using only labeled source data and unlabeled target data. We propose Average Thresholded Confidence (ATC), a practical method that learns a threshold on the model's confidence, predicting accuracy as the fraction of unlabeled examples.
  arXiv  Detail & Related papers  (2022-01-11T23:01:12Z)
• Source-Free Domain Adaptive Fundus Image Segmentation with Denoised Pseudo-Labeling [56.98020855107174]
  Domain adaptation typically requires to access source domain data to utilize their distribution information for domain alignment with the target data. In many real-world scenarios, the source data may not be accessible during the model adaptation in the target domain due to privacy issue. We present a novel denoised pseudo-labeling method for this problem, which effectively makes use of the source model and unlabeled target data.
  arXiv  Detail & Related papers  (2021-09-19T06:38:21Z)
• Unsupervised Robust Domain Adaptation without Source Data [75.85602424699447]
  We study the problem of robust domain adaptation in the context of unavailable target labels and source data. We show a consistent performance improvement of over $10%$ in accuracy against the tested baselines on four benchmark datasets.
  arXiv  Detail & Related papers  (2021-03-26T16:42:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.