Subtype-Aware Dynamic Unsupervised Domain Adaptation

Abstract

Unsupervised domain adaptation (UDA) has been successfully applied to transfer knowledge from a labeled source domain to target domains without their labels. Recently introduced transferable prototypical networks (TPN) further addresses class-wise conditional alignment. In TPN, while the closeness of class centers between source and target domains is explicitly enforced in a latent space, the underlying finegrained subtype structure and the cross-domain within-class compactness have not been fully investigated. To counter this, we propose a new approach to adaptively perform a finegrained subtype-aware alignment to improve performance in the target domain without the subtype label in both domains. The insight of our approach is that the unlabeled subtypes in a class have the local proximity within a subtype, while exhibiting disparate characteristics, because of different conditional and label shifts. Specifically, we propose to simultaneously enforce subtype-wise compactness and class-wise separation, by utilizing intermediate pseudo-labels. In addition, we systematically investigate various scenarios with and without prior knowledge of subtype numbers, and propose to exploit the underlying subtype structure. Furthermore, a dynamic queue framework is developed to evolve the subtype cluster centroids steadily using an alternative processing scheme. Experimental results, carried out with multi-view congenital heart disease data and VisDA and DomainNet, show the effectiveness and validity of our subtypeaware UDA, compared with state-of-the-art UDA methods.

Exploration and Exploitation in Hierarchical Reinforcement Learning with Adaptive Scheduling

“…Representation refers to the process by which options are endowed with varying degrees of knowledge [21]. Currently, the dominant representation method applies mutual information [25] to establish the guiding relationship between options (including discrete options and continuous options) and trajectories (including various combinations of states and actions).…”

Unsupervised domain adaptation of dynamic extension networks based on class decision boundaries

“…In practical applications, due to the diversity of data sources and the difficulty of obtaining annotations, the generalization ability of models still needs to be further improved [2]. Unsupervised domain adaptation is a technique that uses unlabeled data to improve model generalization and adaptability [3,4], X-ray parsing from labeled CT scans. First, it is trained on chest X-rays, and then a task-driven generative adversarial network architecture is introduced to achieve simultaneous analysis of unseen real chest X-rays.…”

Unsupervised domain adaptation of dynamic extension networks based on class decision boundaries

“…In practical applications, due to the diversity of data sources and the difficulty of obtaining annotations, the generalization ability of models still needs to be further improved [2]. Unsupervised domain adaptation is a technique that uses unlabeled data to improve model generalization and adaptability [3] [4], especially in practical application scenarios where sample distribution differences are large and data labeling costs are high, its advantages are more prominent.…”