Scalable Causal Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
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 invariances 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.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 15 of its 67 references that are in the map. First posted on arXiv 27 Feb 2021.
Builds on
15 of 67 references.
References · 15
- 2015Causal inference using invariant prediction: identification and confidence intervalscited by 533
- 2018Detecting and Correcting for Label Shift with Black Box Predictorscited by 364
- 2019A review of domain adaptation without target labelscited by 154
- 2017Domain Adaptation by Using Causal Inference to Predict Invariant Conditional Distributionscited by 125
- 2019Support and Invertibility in Domain-Invariant Representationscited by 87
- 2018Optimal Transport for Multi-source Domain Adaptation under Target Shiftcited by 67
- 2017Invariant Causal Prediction for Sequential Datacited by 63
- 2015Explaining the Success of AdaBoost and Random Forests as Interpolating Classifierscited by 45
- 2020Calibrated Prediction with Covariate Shift via Unsupervised Domain Adaptationcited by 43
- 2019Stabilizing Variable Selection and Regressioncited by 31
- 2014Bayesian Network Constraint-Based Structure Learning Algorithms: Parallel and Optimised Implementations in the bnlearn R Packagecited by 19
- 2019Robust Importance Weighting for Covariate Shiftcited by 14
3 more
Built on by
Citing papers per year: 2023: 2; 2024: 1.
3 papers.