arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1404.3190cs.LG
收藏

Pareto路径多任务多核学习

Pareto-Path Multi-Task Multiple Kernel Learning

Cong Li, Michael Georgiopoulos, Georgios C. Anagnostopoulos

摘要:

一种传统且直观吸引人的多任务多核学习(MT-MKL)方法是优化具有(部分)共享核函数的目标函数之和(因此,平均值),其允许任务之间的信息共享。我们指出,所获得的解决方案对应于一个多目标优化(MOO)问题的Pareto Front(PF)上的一个点,它考虑了多任务学习(MTL)问题中涉及的所有任务目标的并发优化。出于这最后的观察,并认为前一种方法是启发式的,我们提出了一种新的支持向量机(SVM)MT-MKL框架,认为一组隐含定义的任务目标的圆锥组合。我们表明,解决我们的框架产生的解决方案,沿着上述PF的路径,它包括作为一个特殊情况下的目标函数的平均优化。使用我们推导的算法,我们证明了通过一系列的实验结果,该框架是能够实现更好的分类性能相比,其他类似的MTL方法。

英文摘要:

A traditional and intuitively appealing Multi-Task Multiple Kernel Learning (MT-MKL) method is to optimize the sum (thus, the average) of objective functions with (partially) shared kernel function, which allows information sharing amongst tasks. We point out that the obtained solution corresponds to a single point on the Pareto Front (PF) of a Multi-Objective Optimization (MOO) problem, which considers the concurrent optimization of all task objectives involved in the Multi-Task Learning (MTL) problem. Motivated by this last observation and arguing that the former approach is heuristic, we propose a novel Support Vector Machine (SVM) MT-MKL framework, that considers an implicitly-defined set of conic combinations of task objectives. We show that solving our framework produces solutions along a path on the aforementioned PF and that it subsumes the optimization of the average of objective functions as a special case. Using algorithms we derived, we demonstrate through a series of experimental results that the framework is capable of achieving better classification performance, when compared to other similar MTL approaches.

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

↑