The Community for Technology Leaders
Green Image
Issue No. 07 - July (2010 vol. 22)
ISSN: 1041-4347
pp: 957-968
Tsuyoshi Kato , Ochanomizu University, Tokyo
Hisahi Kashima , IBM Research, Yamato
Masashi Sugiyama , Tokyo Institute of Technology, Tokyo
Kiyoshi Asai , The University of Tokyo, Chiba
When we have several related tasks, solving them simultaneously has been shown to be more effective than solving them individually. This approach is called multitask learning (MTL). In this paper, we propose a novel MTL algorithm. Our method controls the relatedness among the tasks locally, so all pairs of related tasks are guaranteed to have similar solutions. We apply the above idea to support vector machines and show that the optimization problem can be cast as a second-order cone program, which is convex and can be solved efficiently. The usefulness of our approach is demonstrated in ordinal regression, link prediction, and collaborative filtering, each of which can be formulated as a structured multitask problem.
Multitask learning, second-order cone programming, ordinal regression, link prediction, collaborative filtering.

H. Kashima, M. Sugiyama, T. Kato and K. Asai, "Conic Programming for Multitask Learning," in IEEE Transactions on Knowledge & Data Engineering, vol. 22, no. , pp. 957-968, 2009.
87 ms
(Ver 3.3 (11022016))