arXiv:2604.23790cs.LGstat.ML2026-04ICML被引 2

提出通用域适应框架,通过分解预测信息来精准迁移知识。

A General Representation-Based Approach to Multi-Source Domain Adaptation

论文配图:A General Representation-Based Approach to Multi-Source Domain Adaptation
图 1 · 摘自论文原文
  • 基于标签马尔可夫毯分解表示,区分父节点、子节点和配偶节点
  • 理论证明该表示可识别,且能应对多种分布偏移
  • 无需强假设,适合真实场景的多源域适应任务

无监督域适应的核心问题在于确定从有标签源域向无标签目标域转移什么知识。针对高维观测(如图像),现有方法利用深度学习学习潜在表示以在潜在空间中实现知识迁移。然而,这些方法通常依赖于限制性假设(如潜变量独立或标签分布不变)来保证目标域联合分布的可识别性,限制了其实际应用。本文提出一种通用域适应框架,学习紧凑的潜在表示以捕捉与预测任务相关的分布偏移,回答了应学习并转移何种表示的根本问题。我们首先表明,在一般设定下,仅基于全部预测信息学习表示往往不可识别;相反,有趣的是,通过将马尔可夫毯表示划分为标签的父节点、子节点和配偶节点,即可实现通用域适应。此外,该划分具有可识别性保障。基于此理论洞察,我们开发了一种适用于一般设置的非参数化域适应方法,能够处理不同类型的分布偏移。

原文摘要 · Abstract (English)

A central problem in unsupervised domain adaptation is determining what to transfer from labeled source domains to an unlabeled target domain. To handle high-dimensional observations (e.g., images), a line of approaches use deep learning to learn latent representations of the observations, which facilitate knowledge transfer in the latent space. However, existing approaches often rely on restrictive assumptions to establish identifiability of the joint distribution in the target domain, such as independent latent variables or invariant label distributions, limiting their real-world applicability. In this work, we propose a general domain adaptation framework that learns compact latent representations to capture distribution shifts relative to the prediction task and address the fundamental question of what representations should be learned and transferred. Notably, we first demonstrate that learning representations based on all the predictive information, i.e., the label's Markov blanket in terms of the learned representations, is often underspecified in general settings. Instead, we show that, interestingly, general domain adaptation can be achieved by partitioning the representations of Markov blanket into those of the label's parents, children, and spouses. Moreover, its identifiability guarantee can be established. Building on these theoretical insights, we develop a practical, nonparametric approach for domain adaptation in a general setting, which can handle different types of distribution shifts.

域适应表示学习可识别性马尔可夫毯

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。