Stein Discrepancy for Unsupervised Domain Adaptation
원문 초록
Unsupervised domain adaptation (UDA) leverages information from a labeled source dataset to improve accuracy on a related but unlabeled target dataset. A common approach to UDA is aligning representations from the source and target domains by minimizing the distance between their data distributions. Previous methods have employed distances such as Wasserstein distance and maximum mean discrepancy. However, these approaches are less effective when the target data is significantly scarcer than the source data. Stein discrepancy is an asymmetric distance between distributions that relies on one distribution only through its score function. In this paper, we propose a novel UDA method that uses Stein discrepancy to measure the distance between source and target domains. We develop a learning framework using both non-kernelized and kernelized Stein discrepancy. Theoretically, we derive an upper bound for the generalization error. Numerical experiments show that our method outperforms existing methods using other domain discrepancy measures when only small amounts of target data are available.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Topology-Aware Modeling for Unsupervised Simulation-to-Reality Point Cloud Recognition
Unlocking Constraints: Source-Free Occlusion-Aware Seamless Segmentation
Diffusion Domain Teacher: Diffusion Guided Domain Adaptive Object Detector
Unleashing the Power of Intermediate Domains for Mixed Domain Semi-Supervised Medical Image Segmentation
Point-to-Region Loss for Semi-Supervised Point-Based Crowd Counting
BAH Dataset for Ambivalence/Hesitancy Recognition in Videos for Behavioural Change
토론
이 논문과 연결된 포럼 글이 아직 없습니다.