A Survey on Adversarial Domain Adaptation

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

StandardStandard

A Survey on Adversarial Domain Adaptation. / HassanPour Zonoozi, Mahta; Seydi, Vahid.
Yn: Neural Processing Letters, 01.06.2023.

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

HarvardHarvard

APA

CBE

MLA

VancouverVancouver

HassanPour Zonoozi M, Seydi V. A Survey on Adversarial Domain Adaptation. Neural Processing Letters. 2023 Meh 1. Epub 2022 Awst 13. doi: 10.1007/s11063-022-10977-5

Author

HassanPour Zonoozi, Mahta ; Seydi, Vahid. / A Survey on Adversarial Domain Adaptation. Yn: Neural Processing Letters. 2023.

RIS

TY - JOUR

T1 - A Survey on Adversarial Domain Adaptation

AU - HassanPour Zonoozi, Mahta

AU - Seydi, Vahid

PY - 2023/6/1

Y1 - 2023/6/1

N2 - Having a lot of labeled data is always a problem in machine learning issues. Even by collecting lots of data hardly, shift in data distribution might emerge because of differences in source and target domains. The shift would make the model to face with problems in test step. Therefore, the necessity of using domain adaptation emerges. There are three techniques in the field of domain adaptation namely discrepancy based, adversarial based and reconstruction based methods. For domain adaptation, adversarial learning approaches showed state-of-the-art performance. Although there are some comprehensive surveys about domain adaptation, we technically focus on adversarial based domain adaptation methods. We examine each proposed method in detail with respect to their structures and objective functions. The common aspect of proposed methods besides domain adaptation is considering the target labels are predicted as accurately as possible. It can be represented by some methods such as metric learning and multi-adversarial discriminators as are used in some of the papers. Also, we address the negative transfer issue for dissimilar distributions and propose the addition of clustering heuristics to the underlying structures for future research

AB - Having a lot of labeled data is always a problem in machine learning issues. Even by collecting lots of data hardly, shift in data distribution might emerge because of differences in source and target domains. The shift would make the model to face with problems in test step. Therefore, the necessity of using domain adaptation emerges. There are three techniques in the field of domain adaptation namely discrepancy based, adversarial based and reconstruction based methods. For domain adaptation, adversarial learning approaches showed state-of-the-art performance. Although there are some comprehensive surveys about domain adaptation, we technically focus on adversarial based domain adaptation methods. We examine each proposed method in detail with respect to their structures and objective functions. The common aspect of proposed methods besides domain adaptation is considering the target labels are predicted as accurately as possible. It can be represented by some methods such as metric learning and multi-adversarial discriminators as are used in some of the papers. Also, we address the negative transfer issue for dissimilar distributions and propose the addition of clustering heuristics to the underlying structures for future research

U2 - 10.1007/s11063-022-10977-5

DO - 10.1007/s11063-022-10977-5

M3 - Article

JO - Neural Processing Letters

JF - Neural Processing Letters

SN - 1370-4621

ER -