Geometric Understanding of Discriminability and Transferability for Visual Domain Adaptation
To overcome the restriction of identical distribution assumption, invariant representation learning for unsupervised domain adaptation (UDA) has made significant advances in computer vision and pattern recognition communities. In UDA scenario, the training and test data belong to different domains while the task model is learned to be invariant. Recently, empirical connections between transferability and discriminability have received increasing attention, which is the key to understanding the invariant representations. However, theoretical study of these abilities and in-depth analysis of the learned feature structures are unexplored yet. In this work, we systematically analyze the essentials of transferability and discriminability from the geometric perspective. Our theoretical results provide insights into understanding the co-regularization relation and prove the possibility of learning these abilities. From methodology aspect, the abilities are formulated as geometric properties between domain/cluster subspaces (i.e., orthogonality and equivalence) and characterized as the relation between the norms/ranks of multiple matrices. Two optimization-friendly learning principles are derived, which also ensure some intuitive explanations. Moreover, a feasible range for the co-regularization parameters is deduced to balance the learning of geometric structures. Based on the theoretical results, a geometry-oriented model is proposed for enhancing the transferability and discriminability via nuclear norm optimization. Extensive experiment results validate the effectiveness of the proposed model in empirical applications, and verify that the geometric abilities can be sufficiently learned in the derived feasible range.
Code (0)
등록된 구현이 없습니다.
Tasks
Domain AdaptationRepresentation LearningUnsupervised Domain AdaptationSimilar Papers 제목 키워드 기반
Balancing Transferability and Discriminability for Unsupervised Domain Adaptation.
Unsupervised domain adaptation (UDA) aims to leverage a sufficiently labeled source domain to classify or represent the fully unlabeled target domain with a different distribution. Generally, the existing approaches try …
Domain AdaptationRepresentation LearningUnsupervised Domain AdaptationTransferability vs. Discriminability: Batch Spectral Penalization for Adversarial Domain Adaptation
Adversarial domain adaptation has made remarkable advances in learning transferable representations for knowledge transfer across domains. While adversarial learning strengthens the feature transferability which the comm…
Domain AdaptationTransfer LearningBalancing Discriminability and Transferability for Source-Free Domain Adaptation
Conventional domain adaptation (DA) techniques aim to improve domain transferability by learning domain-invariant representations; while concurrently preserving the task-discriminability knowledge gathered from the label…
Domain AdaptationSemantic SegmentationSource-Free Domain AdaptationHarmonizing Transferability and Discriminability for Adapting Object Detectors
Recent advances in adaptive object detection have achieved compelling results in virtue of adversarial feature adaptation to mitigate the distributional shifts along the detection pipeline. Whilst adversarial adaptation …
Objectobject-detectionObject DetectionWeakly Supervised Object DetectionDual Progressive Prototype Network for Generalized Zero-Shot Learning
Generalized Zero-Shot Learning (GZSL) aims to recognize new categories with auxiliary semantic information,e.g., category attributes. In this paper, we handle the critical issue of domain shift problem, i.e., confusion b…
AttributeGeneralized Zero-Shot LearningZero-Shot Learning