arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.03426cs.LGstat.ML
收藏

基于邻域核的多任务学习

Multi-Task Learning Using Neighborhood Kernels

University of Central Florida(中佛罗里达大学);Florida Institute of Technology(佛罗里达理工学院)

Niloofar Yousefi, Cong Li, Mansooreh Mollaghasemi, Georgios Anagnostopoulos, Michael Georgiopoulos

摘要:

本文介绍了一种新的和有效的算法学习核在多任务学习(MTL)设置。虽然我们在这里考虑的是MTL场景,但我们的方法也可以很容易地应用于标准的单任务学习。实验结果表明,该算法的性能始终优于传统的核学习算法,如均匀组合算法、基核的凸组合算法以及一些基于核函数的模型,这些算法在过去已经被证明是有前途的。我们提出了一个Rademacher复杂性界,在此基础上推导出一个新的多任务多核学习(MT-MKL)模型。特别是,我们提出了一个支持向量机正则化模型,其中,对于每个任务,一个最佳的内核是学习的基础上的邻域定义的内核,不限于半正定。比较实验结果显示,强调我们的邻居定义框架的优点,在分类和回归问题。

英文摘要:

This paper introduces a new and effective algorithm for learning kernels in a Multi-Task Learning (MTL) setting. Although, we consider a MTL scenario here, our approach can be easily applied to standard single task learning, as well. As shown by our empirical results, our algorithm consistently outperforms the traditional kernel learning algorithms such as uniform combination solution, convex combinations of base kernels as well as some kernel alignment-based models, which have been proven to give promising results in the past. We present a Rademacher complexity bound based on which a new Multi-Task Multiple Kernel Learning (MT-MKL) model is derived. In particular, we propose a Support Vector Machine-regularized model in which, for each task, an optimal kernel is learned based on a neighborhood-defining kernel that is not restricted to be positive semi-definite. Comparative experimental results are showcased that underline the merits of our neighborhood-defining framework in both classification and regression problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑