PaperScope
LIVE · 2026-10-15 05:40 UTC

Joint Contrastive-Adversarial Representation Learning for Unsupervised Domain Adaptation

Yuling Jiao, Lican Kang, Jerry Zhijian Yang, Zhou Yu, Fusheng Zhou

Latestcs.CLcs.LGcs.AIcs.CV
arXiv ID
2610.15613 v1
Category
Submitted
2026-10-11

Abstract

Effective unsupervised domain adaptation (UDA) requires a representation that captures transferable structure from both the labeled source domain and the unlabeled target domain. We introduce Joint Contrastive-Adversarial Representation Learning (JCAR), a two-stage framework that learns a common representation from the union of unlabeled source and target samples by combining contrastive learning with adversarial domain alignment, and then freezes the representation to fit a source-supervised predictor. We establish a non-asymptotic excess-risk bound for this procedure that couples representation and domain-discriminator estimation while separating downstream prediction, with explicit neural-network approximation errors. Under the stated assumptions and common Hölder smoothness $β\geq1$, the bound identifies a sufficiently large unlabeled-sample regime in which the downstream rate is $\widetilde{\mathcal{O}}(m^{-β/(2β+d)})$, where $m$ counts labeled source samples and logarithmic factors are suppressed. The labeled-sample exponent is governed by the latent dimension $d$ rather than the ambient dimension $p$, which enters the pretraining cost. Experiments on Office-31, Office-Home, and DomainNet demonstrate clear transfer gains across diverse domain shifts, with particularly strong performance when representations are learned from scratch.

Comment: 29 pages, 5 figures, and 9 tables

arXiv abs page · PDF · same-day batch