Approximately optimal domain adaptation with Fisher's Linear Discriminant
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916144059777024 |
|---|---|
| author | Helm, Hayden S. De Silva, Ashwin Vogelstein, Joshua T. Priebe, Carey E. Yang, Weiwei |
| author_facet | Helm, Hayden S. De Silva, Ashwin Vogelstein, Joshua T. Priebe, Carey E. Yang, Weiwei |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_14186 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Approximately optimal domain adaptation with Fisher's Linear Discriminant Helm, Hayden S. De Silva, Ashwin Vogelstein, Joshua T. Priebe, Carey E. Yang, Weiwei Signal Processing Machine Learning Applications Methodology 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. |
| title | Approximately optimal domain adaptation with Fisher's Linear Discriminant |
| topic | Signal Processing Machine Learning Applications Methodology |
| url | https://arxiv.org/abs/2302.14186 |