Self-adaptive label filtering learning for unsupervised domain adaptation

摘要

1 Introduction As an emerging machine learning paradigm,unsupervised domain adaptation(UDA)aims to train an effective model for unlabeled target domain by leveraging knowledge from related but distribution-inconsistent source domain.Most of the existing UDA methods[2]align class-wise distributions resorting to target domain pseudo-labels,for which hard labels may be misguided by misclassifications while soft labels are confusing with trivial noises so that both of them tend to cause frustrating performance.To overcome such drawbacks,as shown in Fig.1,we propose to achieve UDA by performing self-adaptive label filtering learning(SALFL)from both the statistical and the geometrical perspectives,which filters out the misclassified pseudo-labels to reduce negative transfer.Specifically,the proposed SALFL firstly predicts labels for the target domain instances by graph-based random walking and then filters out those noise labels by self-adaptive learning strategy.