无监督领域适应中的二分类问题:不可观测的源子群体
Unsupervised Domain Adaptation for Binary Classification with an Unobservable Source Subpopulation
AI总结:
本文研究了在源域中存在不可观测子群体的无监督领域适应问题,提出通过分布匹配方法估计子群体比例,并理论保证了预测误差上界,实验表明方法在合成和真实数据集上优于传统基准。
摘要:
我们研究了一个无监督领域适应问题,其中源域由二元标签$Y$和二元背景(或环境)$A$定义的子群体组成。我们聚焦于一个具有挑战性的设置,即源域中一个子群体不可观测。简单忽略该未观测组可能导致估计偏差和预测性能下降。尽管存在这种结构缺失,我们证明目标域的预测仍可恢复。具体而言,我们严格推导了目标域的背景特定和总体预测模型。在实际应用中,我们提出分布匹配方法来估计子群体比例。我们为估计器的渐近行为提供了理论保证,并建立了预测误差的上界。在合成和真实数据集上的实验表明,我们的方法优于不考虑该不可观测源子群体的朴素基准。
英文摘要:
We study an unsupervised domain adaptation problem where the source domain consists of subpopulations defined by the binary label $Y$ and a binary background (or environment) $A$. We focus on a challenging setting in which one such subpopulation in the source domain is unobservable. Naively ignoring this unobserved group can result in biased estimates and degraded predictive performance. Despite this structured missingness, we show that the prediction in the target domain can still be recovered. Specifically, we rigorously derive both background-specific and overall prediction models for the target domain. For practical implementation, we propose the distribution matching method to estimate the subpopulation proportions. We provide theoretical guarantees for the asymptotic behavior of our estimator, and establish an upper bound on the prediction error. Experiments on both synthetic and real-world datasets show that our method outperforms the naive benchmark that does not account for this unobservable source subpopulation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。