Generalization Bounds Derived IPM-Based Regularization for Domain Adaptation. (27th December 2015)

• Record Type: Journal Article
• Authors: Meng, Juan; Hu, Guyu; Li, Dong; Zhang, Yanyan; Pan, Zhisong
• Other Names: Ayaz Hasan Academic Editor.
• Is Part Of: Computational intelligence and neuroscience. Volume 2016(2016)
• Publication Date: 2015-12-27
• Subjects: Neurosciences -- Data processing -- Periodicals; Computational intelligence -- Periodicals; Computational neuroscience -- Periodicals; 612.80285
• DOI: 10.1155/2016/7046563
• Languages: English
• ISSNs: 1687-5265

Abstract

Abstract : Domain adaptation has received much attention as a major form of transfer learning. One issue that should be considered in domain adaptation is the gap between source domain and target domain. In order to improve the generalization ability of domain adaption methods, we proposed a framework for domain adaptation combining source and target data, with a new regularizer which takes generalization bounds into account. This regularization term considers integral probability metric (IPM) as the distance between the source domain and the target domain and thus can bound up the testing error of an existing predictor from the formula. Since the computation of IPM only involves two distributions, this generalization term is independent with specific classifiers. With popular learning models, the empirical risk minimization is expressed as a general convex optimization problem and thus can be solved effectively by existing tools. Empirical studies on synthetic data for regression and real-world data for classification show the effectiveness of this method.