Transfer Adaptation Learning: A Decade Survey

被引:1
作者
Zhang, Lei [1 ]
Gao, Xinbo [2 ]
机构
[1] Chongqing Univ, Sch Microelect & Commun Engn, Chongqing 400044, Peoples R China
[2] Chongqing Univ Posts & Telecommun, Chongqing Key Lab Image Cognit, Chongqing 400065, Peoples R China
关键词
Adaptation models; Task analysis; Visualization; Target recognition; Training; Data models; Taxonomy; Distribution discrepancy; domain adaptation (DA); generalizable representation; transfer learning (TL); DOMAIN ADAPTATION; EVENT RECOGNITION; E-NOSE; K-SVD; MACHINE; KERNEL; DICTIONARY; FRAMEWORK; CLASSIFICATION; ALGORITHM;
D O I
10.1109/TNNLS.2022.3183326
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The world we see is ever-changing and it always changes with people, things, and the environment. Domain is referred to as the state of the world at a certain moment. A research problem is characterized as transfer adaptation learning (TAL) when it needs knowledge correspondence between different moments/domains. TAL aims to build models that can perform tasks of target domain by learning knowledge from a semantic-related but distribution different source domain. It is an energetic research field of increasing influence and importance, which is presenting a blowout publication trend. This article surveys the advances of TAL methodologies in the past decade, and the technical challenges and essential problems of TAL have been observed and discussed with deep insights and new perspectives. Broader solutions of TAL being created by researchers are identified, i.e., instance reweighting adaptation, feature adaptation, classifier adaptation, deep network adaptation, and adversarial adaptation, which are beyond the early semisupervised and unsupervised split. The survey helps researchers rapidly but comprehensively understand and identify the research foundation, research status, theoretical limitations, future challenges, and understudied issues (universality, interpretability, and credibility) to be broken in the field toward generalizable representation in open-world scenarios.
引用
收藏
页码:23 / 44
页数:22
相关论文
共 322 条
  • [1] K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    Aharon, Michal
    Elad, Michael
    Bruckstein, Alfred
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) : 4311 - 4322
  • [2] Ahmed E, 2015, PROC CVPR IEEE, P3908, DOI 10.1109/CVPR.2015.7299016
  • [3] Ahmed S. M., P CVPR, P10103
  • [4] Ajakan H., 2014, ARXIV14124446
  • [5] [Anonymous], 2009, P INT C NEUR INF PRO
  • [6] [Anonymous], ECOLOGY, V84, P2200
  • [7] [Anonymous], 2017, arXiv preprint arXiv:1703.00848
  • [8] Argyriou A., 2007, ADV NEURAL INFORM PR, P41, DOI DOI 10.7551/MITPRESS/7503.003.0010
  • [9] Unsupervised Domain Adaptation by Domain Invariant Projection
    Baktashmotlagh, Mahsa
    Harandi, Mehrtash T.
    Lovell, Brian C.
    Salzmann, Mathieu
    [J]. 2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2013, : 769 - 776
  • [10] Normalized Wasserstein for Mixture Distributions with Applications in Adversarial Learning and Domain Adaptation
    Balaji, Yogesh
    Chellappa, Rama
    Feizi, Soheil
    [J]. 2019 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2019), 2019, : 6509 - 6517