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

基于柔性任务簇的凸多任务学习

Convex Multitask Learning with Flexible Task Clusters

Hong Kong University of Science and Technology(香港科技大学)

Wenliang Zhong, James Kwok

摘要:

传统上,多任务学习(MTL)假设所有的任务都是相关的。当任务确实不连贯时,这可能导致负迁移。最近,已经提出了许多方法,通过发现底层任务集群或关系来缓解这个问题。但是,它们仅限于在任务级别对这些关系进行建模,这在某些应用程序中可能会受到限制。在本文中,我们提出了一种新的MTL制定,捕捉任务的关系,在功能级别。该方法根据任务与特征之间的交互关系,为不同的特征构造不同的任务簇,甚至不需要预先指定簇的个数。在计算上,所提出的配方是强凸的,可以有效地解决加速邻近方法。实验进行了一些合成和真实世界的数据集。在不同程度的任务关系下,所提出的方法的准确性始终是最好的。此外,获得的特定功能的任务集群同意与已知的/合理的任务结构的数据。

英文摘要:

Traditionally, multitask learning (MTL) assumes that all the tasks are related. This can lead to negative transfer when tasks are indeed incoherent. Recently, a number of approaches have been proposed that alleviate this problem by discovering the underlying task clusters or relationships. However, they are limited to modeling these relationships at the task level, which may be restrictive in some applications. In this paper, we propose a novel MTL formulation that captures task relationships at the feature-level. Depending on the interactions among tasks and features, the proposed method construct different task clusters for different features, without even the need of pre-specifying the number of clusters. Computationally, the proposed formulation is strongly convex, and can be efficiently solved by accelerated proximal methods. Experiments are performed on a number of synthetic and real-world data sets. Under various degrees of task relationships, the accuracy of the proposed method is consistently among the best. Moreover, the feature-specific task clusters obtained agree with the known/plausible task structures of the data.

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

↑