Domain-shift adaptation via linear transformations
Not on the map. Why?
Abstract (arXiv)
A predictor, fA : X → Y, learned with data from a source domain (A) might not be accurate on a target domain (B) when their distributions are different. Domain adaptation aims to reduce the negative effects of this distribution mismatch. Here, we analyze the case where PA(Y | X) neq PB(Y | X), PA(X) neq PB(X) but PA(Y) = PB(Y); where there are affine transformations of X that makes all distributions equivalent. We propose an approach to project the source and target domains into a lower-dimensional, common space, by (1) projecting the domains into the eigenvectors of the empirical covariance matrices of each domain, then (2) finding an orthogonal matrix that minimizes the maximum mean discrepancy between the projections of both domains. For arbitrary affine transformations, there is an inherent unidentifiability problem when performing unsupervised domain adaptation that can be alleviated in the semi-supervised case. We show the effectiveness of our approach in simulated data and in binary digit classification tasks, obtaining improvements up to 48% accuracy when correcting for the domain shift in the data.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 44 references that are in the map. First posted on arXiv 14 Jan 2022.
Builds on
6 of 44 references.
References · 6
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2017Adversarial Discriminative Domain Adaptationcited by 1,311
- 2015Return of Frustratingly Easy Domain Adaptationcited by 391
- 2015The Variational Fair Autoencodercited by 223
- 2017Domain Adaptation for Visual Applications: A Comprehensive Surveycited by 128
- 2020Domain Adaptation with Conditional Distribution Matching and Generalized Label Shiftcited by 125
Built on by
Not cited yet.