Scalable Causal Domain Adaptation
Mohammad Ali Javidian Affiliation: School of Electrical and Computer Engineering Affiliation: Purdue University Email: Om Pandey Affiliation: School of Computer Engineering Affiliation: Kalinga Institute of Industrial Technology Email: Pooyan Jamshidi Affiliation: Computer Science、Engineering Department Affiliation: University of South Carolina Email:
Abstract
One of the most critical problems in transfer learning is the task of domain adaptation, where the goal is to apply an algorithm trained in one or more source domains to a different (but related) target domain. This paper deals with domain adaptation in the presence of covariate shift while invariance exist across domains. One of the main limitations of existing causal inference methods for solving this problem is scalability. To overcome this difficulty, we propose SCTL, an algorithm that avoids an exhaustive search and identifies invariant causal features across source and target domains based on Markov blanket discovery. SCTL does not require having prior knowledge of the causal structure, the type of interventions, or the intervention targets. There is an intrinsic locality associated with SCTL that makes it practically scalable and robust because local causal discovery increases the power of computational independence tests and makes the task of domain adaptation computationally tractable. We show the scalability and robustness of SCTL for domain adaptation using synthetic and real data sets in low-dimensional and high-dimensional settings.
原文 arXiv:2103.00139;中英对照 + 大白话阅读 https://aha.fim.ai/paper/2103.00139v3