Conic多任务分类
Conic Multi-Task Classification
摘要:
传统上,多任务学习(MTL)模型优化任务相关目标函数的平均值,这是一种直观的方法,我们将其称为平均MTL。然而,一个更一般的框架,称为圆锥MTL,可以通过考虑目标函数的圆锥组合来制定;在这个框架中,平均MTL作为一个特殊情况出现,当所有组合系数等于1时。虽然圆锥MTL的优势,平均MTL已在以前的工作中实验证明,没有理论上的理由已提供日期。在本文中,我们推导出一个广义的圆锥MTL方法的范围,并证明了最紧的界限不一定实现,当所有的组合系数等于1,因此,平均MTL可能并不总是最佳的选择,它是重要的是要考虑圆锥MTL。作为推广界的一个副产品,它也从理论上解释了以前相关工作的良好实验结果。最后,我们提出了一个新的圆锥MTL模型,其圆锥组合系数最小化的推广界,而不是选择他们的启发式已经做了在以前的方法。通过一系列实验,与其他几种方法进行比较,证明了该模型的合理性和优越性。
英文摘要:
Traditionally, Multi-task Learning (MTL) models optimize the average of task-related objective functions, which is an intuitive approach and which we will be referring to as Average MTL. However, a more general framework, referred to as Conic MTL, can be formulated by considering conic combinations of the objective functions instead; in this framework, Average MTL arises as a special case, when all combination coefficients equal 1. Although the advantage of Conic MTL over Average MTL has been shown experimentally in previous works, no theoretical justification has been provided to date. In this paper, we derive a generalization bound for the Conic MTL method, and demonstrate that the tightest bound is not necessarily achieved, when all combination coefficients equal 1; hence, Average MTL may not always be the optimal choice, and it is important to consider Conic MTL. As a byproduct of the generalization bound, it also theoretically explains the good experimental results of previous relevant works. Finally, we propose a new Conic MTL model, whose conic combination coefficients minimize the generalization bound, instead of choosing them heuristically as has been done in previous methods. The rationale and advantage of our model is demonstrated and verified via a series of experiments by comparing with several other methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。