English

Stein Discrepancy for Unsupervised Domain Adaptation

Machine Learning 2025-12-09 v4 Machine Learning

Abstract

Unsupervised domain adaptation (UDA) aims to improve model performance on an unlabeled target domain using a related, labeled source domain. A common approach aligns source and target feature distributions by minimizing a distance between them, often using symmetric measures such as maximum mean discrepancy (MMD). However, these methods struggle when target data is scarce. We propose a novel UDA framework that leverages Stein discrepancy, an asymmetric measure that depends on the target distribution only through its score function, making it particularly suitable for low-data target regimes. Our proposed method has kernelized and adversarial forms and supports flexible modeling of the target distribution via Gaussian, GMM, or VAE models. We derive a generalization bound on the target error and a convergence rate for the empirical Stein discrepancy in the two-sample setting. Empirically, our method consistently outperforms prior UDA approaches under limited target data across multiple benchmarks.

Keywords

Cite

@article{arxiv.2502.03587,
  title  = {Stein Discrepancy for Unsupervised Domain Adaptation},
  author = {Anneke von Seeger and Dongmian Zou and Gilad Lerman},
  journal= {arXiv preprint arXiv:2502.03587},
  year   = {2025}
}

Comments

24 pages, 13 figures

R2 v1 2026-06-28T21:34:03.177Z