Transferable Semantic Augmentation for Domain Adaptation
원문 초록
Domain adaptation has been widely explored by transferring the knowledge from a label-rich source domain to a related but unlabeled target domain. Most existing domain adaptation algorithms attend to adapting feature representations across two domains with the guidance of a shared source-supervised classifier. However, such classifier limits the generalization ability towards unlabeled target recognition. To remedy this, we propose a Transferable Semantic Augmentation (TSA) approach to enhance the classifier adaptation ability through implicitly generating source features towards target semantics. Specifically, TSA is inspired by the fact that deep feature transformation towards a certain direction can be represented as meaningful semantic altering in the original input space. Thus, source features can be augmented to effectively equip with target semantics to train a more transferable classifier. To achieve this, for each class, we first use the inter-domain feature mean difference and target intra-class feature covariance to construct a multivariate normal distribution. Then we augment source features with random directions sampled from the distribution class-wisely. Interestingly, such source augmentation is implicitly implemented through an expected transferable cross-entropy loss over the augmented source distribution, where an upper bound of the expected loss is derived and minimized, introducing negligible computational overhead. As a light-weight and general technique, TSA can be easily plugged into various domain adaptation methods, bringing remarkable improvements. Comprehensive experiments on cross-domain benchmarks validate the efficacy of TSA.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Domain Borders Are There to Be Crossed With Federated Few-Shot Adaptation
UMDATrack: Unified Multi-Domain Adaptive Tracking Under Adverse Weather Conditions
Topology-Aware Modeling for Unsupervised Simulation-to-Reality Point Cloud Recognition
Unlocking Constraints: Source-Free Occlusion-Aware Seamless Segmentation
Efficient and Generalizable Speaker Diarization via Structured Pruning of Self-Supervised Models
Expressive Score-Based Priors for Distribution Matching with Geometry-Preserving Regularization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.