Approximately optimal domain adaptation with Fisher's Linear Discriminant
Not on the map. Why?
Abstract (arXiv)
We propose a class of models based on Fisher's Linear Discriminant (FLD) in the context of domain adaptation. The class is the convex combination of two hypotheses: i) an average hypothesis representing previously seen source tasks and ii) a hypothesis trained on a new target task. For a particular generative setting we derive the optimal convex combination of the two models under 0-1 loss, propose a computable approximation, and study the effect of various parameter settings on the relative risks between the optimal hypothesis, hypothesis i), and hypothesis ii). We demonstrate the effectiveness of the proposed optimal classifier in the context of EEG- and ECG-based classification settings and argue that the optimal classifier can be computed without access to direct information from any of the individual source tasks. We conclude by discussing further applications, limitations, and possible future directions.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 14 of its 66 references that are in the map. First posted on arXiv 27 Feb 2023.
Builds on
14 of 66 references.
References · 14
- 2020Meta-Learning in Neural Networks: A Surveycited by 944
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2018Taskonomy: Disentangling Task Transfer Learningcited by 631
- 2019Three scenarios for continual learningcited by 610
- 2020LEEP: A New Measure to Evaluate Transferability of Learned Representationscited by 182
- 2019Online Meta-Learningcited by 137
- 2019Transferability and Hardness of Supervised Classification Taskscited by 125
- 2018Multi-Source Domain Adaptation with Mixture of Expertscited by 62
- 2022The Value of Out-of-Distribution Datacited by 12
- 2019The Effect of Person-Specific Biometrics in Improving Generic Stress Predictive Modelscited by 10
- 2020Simple Lifelong Learning Machinescited by 9
- 2022Mental State Classification Using Multi-graph Featurescited by 7
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.