arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1702.05993cs.CVcs.LG
收藏

边缘化领域自适应的扩展框架

An Extended Framework for Marginalized Domain Adaptation

Xerox Research Center Europe(欧洲施乐研究院)

Gabriela Csurka, Boris Chidlovski, Stephane Clinchant, Sophia Michel

摘要:

我们提出了一个扩展的框架边缘化领域自适应,旨在解决无监督,监督和半监督的情况。我们认为,去噪原则应扩展到明确促进域不变的功能,以及帮助分类任务。因此,我们建议联合学习数据自动编码器和目标分类器。首先,为了使去噪特征域不变,我们提出了一种域正则化,它可以是域预测损失或源数据和目标数据之间的最大平均差异。这种情况下的噪声边缘化被简化为求解具有封闭形式解的线性矩阵系统$AX=B$。其次,为了帮助分类,我们包括一个类正则化项。添加该组件将学习问题简化为求解Sylvester线性矩阵方程$AX+BX=C$,对于该方程也存在有效的迭代过程。我们做了广泛的研究,以评估这些正则化条款如何提高基线性能的三个领域自适应的情况下,目前的实验结果在两个图像和一个文本基准数据集,传统上用于验证领域自适应方法。我们报告了我们的研究结果,并与最先进的方法进行了比较。

英文摘要:

We propose an extended framework for marginalized domain adaptation, aimed at addressing unsupervised, supervised and semi-supervised scenarios. We argue that the denoising principle should be extended to explicitly promote domain-invariant features as well as help the classification task. Therefore we propose to jointly learn the data auto-encoders and the target classifiers. First, in order to make the denoised features domain-invariant, we propose a domain regularization that may be either a domain prediction loss or a maximum mean discrepancy between the source and target data. The noise marginalization in this case is reduced to solving the linear matrix system $AX=B$ which has a closed-form solution. Second, in order to help the classification, we include a class regularization term. Adding this component reduces the learning problem to solving a Sylvester linear matrix equation $AX+BX=C$, for which an efficient iterative procedure exists as well. We did an extensive study to assess how these regularization terms improve the baseline performance in the three domain adaptation scenarios and present experimental results on two image and one text benchmark datasets, conventionally used for validating domain adaptation methods. We report our findings and comparison with state-of-the-art methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑