Clustered Multi-Task Learning: A Convex Formulation

Details Clustered Multi-Task Learning: A Convex Formulation Clustered Multi-Task Learning: A Convex Formulation

2008-09-11

arxiv.org/abs/0809.2085v1

Computer Science

Learning

Scientific paper

In multi-task learning several related tasks are considered simultaneously, with the hope that by an appropriate sharing of information across tasks, each task may benefit from the others. In the context of learning linear functions for supervised classification or regression, this can be achieved by including a priori information about the weight vectors associated with the tasks, and how they are expected to be related to each other. In this paper, we assume that tasks are clustered into groups, which are unknown beforehand, and that tasks within a group have similar weight vectors. We design a new spectral norm that encodes this a priori assumption, without the prior knowledge of the partition of tasks into groups, resulting in a new convex optimization formulation for multi-task learning. We show in simulations on synthetic examples and on the IEDB MHC-I binding dataset, that our approach outperforms well-known convex methods for multi-task learning, as well as related non convex methods dedicated to the same problem.

Affiliated with

Also associated with

No associations

Rating

Clustered Multi-Task Learning: A Convex Formulation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustered Multi-Task Learning: A Convex Formulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustered Multi-Task Learning: A Convex Formulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-474558