Learning Sparse Task Relations in Multi-Task Learning

doi:10.1609/aaai.v31i1.10820

Learning Sparse Task Relations in Multi-Task Learning

2017-02-13

0

OA

AI

DOI：10.1609/aaai.v31i1.10820

Original

Original request for help

Save

Abstract

En 中文

In multi-task learning, when the number of tasks is large, pairwise task relations exhibit sparse patterns since usually a task cannot be helpful to all of the other tasks and moreover, sparse task relations can reduce the risk of overfitting compared with the dense ones. In this paper, we focus on learning sparse task relations. Based on a regularization framework which can learn task relations among multiple tasks, we propose a SParse covAriance based mulTi-taSk (SPATS) model to learn a sparse covariance by using the ℓl regularization. The resulting objective function of the SPATS method is convex, which allows us to devise an alternating method to solve it. Moreover, some theoretical properties of the proposed model are studied. Experiments on synthetic and real-world datasets demonstrate the effectiveness of the proposed method.

Learning Sparse Task Relations in Multi-Task Learning

Abstract

Journal

Organization

Cited Papers