杠杆(统计)
计算机科学
支持向量机
任务(项目管理)
正多边形
人工智能
机器学习
凸组合
凸优化
多任务学习
数学优化
算法
数学
几何学
经济
管理
作者
Carlos Ruiz,Carlos M. Alaíz,José R. Dorronsoro
出处
期刊:Neurocomputing
[Elsevier BV]
日期:2021-06-17
卷期号:456: 599-608
被引量:10
标识
DOI:10.1016/j.neucom.2021.01.137
摘要
Quite often a machine learning problem lends itself to be split in several well-defined subproblems, or tasks. The goal of Multi-Task Learning (MTL) is to leverage the joint learning of the problem from two different perspectives: on the one hand, a single, overall model, and on the other hand task-specific models. In this way, the found solution by MTL may be better than those of either the common or the task-specific models. Starting with the work of Evgeniou et al., support vector machines (SVMs) have lent themselves naturally to this approach. This paper proposes a convex formulation of MTL for the L1-, L2- and LS-SVM models that results in dual problems quite similar to the single-task ones, but with multi-task kernels; in turn, this makes possible to train the convex MTL models using standard solvers. As an alternative approach, the direct optimal combination of the already trained common and task-specific models can also be considered. In this paper, a procedure to compute the optimal combining parameter with respect to four different error functions is derived. As shown experimentally, the proposed convex MTL approach performs generally better than the alternative optimal convex combination, and both of them are better than the straight use of either common or task-specific models.
科研通智能强力驱动
Strongly Powered by AbleSci AI