BriefGPT.xyz
Oct, 2018
最优领域自适应的广义Neyman-Pearson标准
A Generalized Neyman-Pearson Criterion for Optimal Domain Adaptation
HTML
PDF
Clayton Scott
TL;DR
探讨了领域自适应中的二元分类问题，提出了一种新的 Neyman-Pearson 类似标准，并研究了一类广义的领域自适应问题，建立了在目标域中的最优分类结果，即使没有访问该域的标记数据。
Abstract
In the problem
domain adaptation
for
binary classification
, the learner is presented with labeled examples from a source domain, and must correctly classify unlabeled examples from a target domain, which may diff
→