A Simple Unified Information Regularization Framework for Multi-Source Domain Adaptation
Adversarial learning strategy has demonstrated remarkable performance in dealing with single-source unsupervised Domain Adaptation (DA) problems, and it has recently been applied to multi-source DA problems. A potential pitfall of the existing DA methods that use multiple domain discriminators for each source domain is that domain-discriminative information is inevitably distributed across multiple discriminators. Despite this issue, the effect of using multiple discriminators on the quality of latent space representations has been poorly understood. To fully address this issue, we situate adversarial DA in the context of information regularization. First, we present a unified information regularization framework for multi-source DA. Our framework shows that the information shared across domains cannot be gleaned with multiple discriminators. It further provides a theoretical justification for using a single and unified domain discriminator to encourage the synergistic integration of the information gleaned from each domain. Second, this motivates us to implement a novel neural architecture called a Multi-source Information-regularized Adaptation Networks (MIAN). The proposed model significantly reduces the variance of stochastic gradients and increases computational-efficiency. Large-scale simulations on various multi-source DA scenarios demonstrate that MIAN, despite its structural simplicity, reliably outperforms other state-of-the-art methods by a large margin. Our work offers the possibility of garnering fundamental insights from multiple domains into the development of highly generalizable algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational EfficiencyDomain AdaptationUnsupervised Domain AdaptationSimilar Papers 제목 키워드 기반
A Simple Analysis for Exp-concave Empirical Minimization with Arbitrary Convex Regularizer
In this paper, we present a simple analysis of {\bf fast rates} with {\it high probability} of {\bf empirical minimization} for {\it stochastic composite optimization} over a finite-dimensional bounded convex set with ex…
Regularized Primitive Graph Learning for Unified Vector Mapping
Large-scale vector mapping is the foundation for transportation and urban planning. Most existing mapping methods are tailored to one specific mapping task, due to task-specific requirements on shape regularization a…
Graph LearningGraph ReconstructionA Unified Approach to Adaptive Regularization in Online and Stochastic Optimization
We describe a framework for deriving and analyzing online optimization algorithms that incorporate adaptive, data-dependent regularization, also termed preconditioning. Such algorithms have been proven useful in stochast…
Stochastic OptimizationDeconfounding and Causal Regularization for Stability and External Validity
We review some recent work on removing hidden confounding and causal regularization from a unified viewpoint. We describe how simple and user-friendly techniques improve stability, replicability and distributional robust…
High-order Correlation Preserved Incomplete Multi-view Subspace Clustering
Incomplete multi-view clustering aims to exploit theinformation of multiple incomplete views to partition data into their clusters. Existing methods only utilize the pair-wise sample correlation and pair-wise view correl…
ClusteringIncomplete multi-view clusteringMulti-view Subspace ClusteringVocal Bursts Intensity Prediction