Learning Domain-Invariant Subspace using Domain Features and Independence Maximization
Not on the map. Why?
Abstract (arXiv)
Domain adaptation algorithms are useful when the distributions of the training and the test data are different. In this paper, we focus on the problem of instrumental variation and time-varying drift in the field of sensors and measurement, which can be viewed as discrete and continuous distributional change in the feature space. We propose maximum independence domain adaptation (MIDA) and semi-supervised MIDA (SMIDA) to address this problem. Domain features are first defined to describe the background information of a sample, such as the device label and acquisition time. Then, MIDA learns a subspace which has maximum independence with the domain features, so as to reduce the inter-domain discrepancy in distributions. A feature augmentation strategy is also designed to project samples according to their backgrounds so as to improve the adaptation. The proposed algorithms are flexible and fast. Their effectiveness is verified by experiments on synthetic datasets and four real-world ones on sensors, measurement, and computer vision. They can greatly enhance the practicability of sensor systems, as well as extend the application scope of existing domain adaptation algorithms by uniformly handling different kinds of distributional change.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Mar 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 3; 2023: 2.
9 papers.
- 2021Geometric Unsupervised Domain Adaptation for Semantic Segmentationcited by 33
- 2021Multi-Source Video Domain Adaptation with Temporal Attentive Moment Alignmentcited by 20
- 2022Toward cross-subject and cross-session generalization in EEG-based emotion recognition: Systematic review, taxonomy, and methodscited by 17
- 2023Towards Domain Generalization for ECG and EEG Classification: Algorithms and Benchmarkscited by 14
- 2022On The Effects Of Data Normalisation For Domain Adaptation On EEG Datacited by 13
- 2023f-FERM: A Scalable Framework for Robust Fair Empirical Risk Minimizationcited by 4
- 2021PyKale: Knowledge-Aware Machine Learning from Multiple Sources in Pythoncited by 2
- 2022Maximizing Conditional Independence for Unsupervised Domain Adaptationcited by 2
- 2021A Unified Joint Maximum Mean Discrepancy for Domain Adaptationcited by 1
- 2023f-FERM: A Scalable Framework for Robust Fair Empirical Risk Minimization6 Dec 2023
- 2023Towards Domain Generalization for ECG and EEG Classification: Algorithms and Benchmarks20 Mar 2023
- 2022Toward cross-subject and cross-session generalization in EEG-based emotion recognition: Systematic review, taxonomy, and methods16 Dec 2022
- 2022On The Effects Of Data Normalisation For Domain Adaptation On EEG Data3 Oct 2022
- 2022Maximizing Conditional Independence for Unsupervised Domain Adaptation7 Mar 2022
- 2021Multi-Source Video Domain Adaptation with Temporal Attentive Moment Alignment21 Sep 2021
- 2021PyKale: Knowledge-Aware Machine Learning from Multiple Sources in Python17 Jun 2021
- 2021Geometric Unsupervised Domain Adaptation for Semantic Segmentation30 Mar 2021
- 2021A Unified Joint Maximum Mean Discrepancy for Domain Adaptation25 Jan 2021