|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM330208144 |
| 003 |
DE-627 |
| 005 |
20231225210805.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2022 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2021.3109287
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1100.xml
|
| 035 |
|
|
|a (DE-627)NLM330208144
|
| 035 |
|
|
|a (NLM)34478362
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Li, Jingjing
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Divergence-Agnostic Unsupervised Domain Adaptation by Adversarial Attacks
|
| 264 |
|
1 |
|c 2022
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 06.10.2022
|
| 500 |
|
|
|a Date Revised 19.11.2022
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a Conventional machine learning algorithms suffer the problem that the model trained on existing data fails to generalize well to the data sampled from other distributions. To tackle this issue, unsupervised domain adaptation (UDA) transfers the knowledge learned from a well-labeled source domain to a different but related target domain where labeled data is unavailable. The majority of existing UDA methods assume that data from the source domain and the target domain are available and complete during training. Thus, the divergence between the two domains can be formulated and minimized. In this paper, we consider a more practical yet challenging UDA setting where either the source domain data or the target domain data are unknown. Conventional UDA methods would fail this setting since the domain divergence is agnostic due to the absence of the source data or the target data. Technically, we investigate UDA from a novel view-adversarial attack-and tackle the divergence-agnostic adaptive learning problem in a unified framework. Specifically, we first report the motivation of our approach by investigating the inherent relationship between UDA and adversarial attacks. Then we elaborately design adversarial examples to attack the training model and harness these adversarial examples. We argue that the generalization ability of the model would be significantly improved if it can defend against our attack, so as to improve the performance on the target domain. Theoretically, we analyze the generalization bound for our method based on domain adaptation theories. Extensive experimental results on multiple UDA benchmarks under conventional, source-absent and target-absent UDA settings verify that our method is able to achieve a favorable performance compared with previous ones. Notably, this work extends the scope of both domain adaptation and adversarial attack, and expected to inspire more ideas in the community
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 700 |
1 |
|
|a Du, Zhekai
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Zhu, Lei
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Ding, Zhengming
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Lu, Ke
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Shen, Heng Tao
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 44(2022), 11 vom: 15. Nov., Seite 8196-8211
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:44
|g year:2022
|g number:11
|g day:15
|g month:11
|g pages:8196-8211
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2021.3109287
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 44
|j 2022
|e 11
|b 15
|c 11
|h 8196-8211
|