A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Reliable Weighted Optimal Transport for Unsupervised Domain Adaptation
2020
2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
Recently, extensive researches have been proposed to address the UDA problem, which aims to learn transferrable models for the unlabeled target domain. Among them, the optimal transport is a promising metric to align the representations of the source and target domains. However, most existing works based on optimal transport ignore the intra-domain structure, only achieving coarse pair-wise matching. The target samples distributed near the edge of the clusters, or far from their corresponding
doi:10.1109/cvpr42600.2020.00445
dblp:conf/cvpr/XuLWC020
fatcat:n2o2frrmrbaplouusdhnrzwlee