Name
Title | ||
|---|---|---|
Theoretic Analysis and Extremely Easy Algorithms for Domain Adaptive Feature Learning. |
Abstract | ||
|---|---|---|
Domain adaptation problems arise in a variety of applications, where a training dataset from the textit{source} domain and a test dataset from the textit{target} domain typically follow different distributions. The primary difficulty in designing effective learning models to solve such problems lies in how to bridge the gap between the source and target distributions. In this paper, we provide comprehensive analysis of feature learning algorithms used in conjunction with linear classifiers for domain adaptation. Our analysis shows that in order to achieve good adaptation performance, the second moments of the source domain distribution and target domain distribution should be similar. Based on our new analysis, a novel extremely easy feature learning algorithm for domain adaptation is proposed. Furthermore, our algorithm is extended by leveraging multiple layers, leading to a deep linear model. We evaluate the effectiveness of the proposed algorithms in terms of domain adaptation tasks on the Amazon review dataset and the spam dataset from the ECML/PKDD 2006 discovery challenge. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.24963/ijcai.2017/272 | IJCAI |
Field | DocType | Citations |
Linear model,Domain adaptation,Computer science,Algorithm,Learning models,Artificial intelligence,Machine learning,Feature learning | Conference | 3 |
PageRank | References | Authors |
0.39 | 13 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenhao Jiang | 1 | 17 | 2.27 |
| Cheng Deng | 2 | 1283 | 85.48 |
| Wei Liu | 3 | 4041 | 204.19 |
| Feiping Nie | 4 | 7061 | 309.42 |
| Fu-lai Chung | 5 | 244 | 34.50 |
| Heng Huang | 6 | 3080 | 203.21 |