DACH: Domain Adaptation Without Domain Information

被引:12
作者
Cai, Ruichu [1 ]
Li, Jiahao [1 ]
Zhang, Zhenjie [2 ]
Yang, Xiaoyan [2 ]
Hao, Zhifeng [1 ,3 ]
机构
[1] Guangdong Univ Technol, Sch Comp, Guangzhou 510006, Peoples R China
[2] Yitu Technol Singapore, Singapore Res & Dev Ctr, Singapore 018960, Singapore
[3] Foshan Univ, Sch Math & Big Data, Foshan 528100, Peoples R China
基金
中国国家自然科学基金;
关键词
Task analysis; Deep learning; Bioinformatics; Feature extraction; Genomics; Learning systems; Causality; deep learning; domain adaptation; homomorphism operator;
D O I
10.1109/TNNLS.2019.2962817
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Domain adaptation is becoming increasingly important for learning systems in recent years, especially with the growing diversification of data domains in real-world applications, such as the genetic data from various sequencing platforms and video feeds from multiple surveillance cameras. Traditional domain adaptation approaches target to design transformations for each individual domain so that the twisted data from different domains follow an almost identical distribution. In many applications, however, the data from diversified domains are simply dumped to an archive even without clear domain labels. In this article, we discuss the possibility of learning domain adaptations even when the data does not contain domain labels. Our solution is based on our new model, named domain adaption using cross-domain homomorphism (DACH in short), to identify intrinsic homomorphism hidden in mixed data from all domains. DACH is generally compatible with existing deep learning frameworks, enabling the generation of nonlinear features from the original data domains. Our theoretical analysis not only shows the universality of the homomorphism, but also proves the convergence of DACH for significant homomorphism structures over the data domains is preserved. Empirical studies on real-world data sets validate the effectiveness of DACH on merging multiple data domains for joint machine learning tasks and the scalability of our algorithm to domain dimensionality.
引用
收藏
页码:5055 / 5067
页数:13
相关论文
共 54 条
[1]  
[Anonymous], 2010, P 2010 WORKSH DOM AD
[2]  
[Anonymous], 2013, P INT C LEARN REPR
[3]  
[Anonymous], 2014, ABS14123474 CORR
[4]  
[Anonymous], 1994, An Introduction to Computational Learning Theory, DOI DOI 10.7551/MITPRESS/3897.001.0001
[5]  
[Anonymous], 2016, GEODATASETS
[6]  
[Anonymous], 2018, ARXIV180501386
[7]  
[Anonymous], 2013, HDB MATH
[8]  
[Anonymous], 2016, ARXIV161108195
[9]   Unsupervised Domain Adaptation by Domain Invariant Projection [J].
Baktashmotlagh, Mahsa ;
Harandi, Mehrtash T. ;
Lovell, Brian C. ;
Salzmann, Mathieu .
2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2013, :769-776
[10]  
Basu S, 2009, CH CRC DATA MIN KNOW, P1