Scholarlink

<p>Domain adaptation aims to learn a prediction model that performs well in a target domain with unlabeled data by harnessing the distributionally different labeled data from a source domain. In this paper, we design a simple yet powerful neural network approach named joint distribution neural matching (JOINT) to address the challenge of joint distribution difference/mismatch in domain adaptation. Our JOINT approach matches the source joint distribution and the target one in the activation space of a neural network by minimizing an estimate of the Jensen–Shannon (JS) divergence between the two joint distributions. The estimated JS divergence is derived in an explicit form, which frees our approach from solving a minimax adversarial problem when matching the distributions. Experiments on four representative large-scale visual recognition datasets show that our JOINT approach outperforms the state-of-the-art under both unsupervised and semi-supervised domain adaptation settings.&#xa0;Our code will be available at <a href="https://github.com/TitanRisen/JOINT-CODE">https://github.com/TitanRisen/JOINT-CODE</a>.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Deep domain adaptation by joint distribution neural matching

  • 期刊论文

  • 发表日期：

    2025年5月13日

查看全文
  • Zijie Hong,
  • Sentao Chen,
  • Lisheng Wen,
  • Xiaowei Yang

摘要

Domain adaptation aims to learn a prediction model that performs well in a target domain with unlabeled data by harnessing the distributionally different labeled data from a source domain. In this paper, we design a simple yet powerful neural network approach named joint distribution neural matching (JOINT) to address the challenge of joint distribution difference/mismatch in domain adaptation. Our JOINT approach matches the source joint distribution and the target one in the activation space of a neural network by minimizing an estimate of the Jensen–Shannon (JS) divergence between the two joint distributions. The estimated JS divergence is derived in an explicit form, which frees our approach from solving a minimax adversarial problem when matching the distributions. Experiments on four representative large-scale visual recognition datasets show that our JOINT approach outperforms the state-of-the-art under both unsupervised and semi-supervised domain adaptation settings. Our code will be available at https://github.com/TitanRisen/JOINT-CODE.