Probabilistic Low-Rank Multitask Learning

doi:10.1109/TNNLS.2016.2641160

Probabilistic Low-Rank Multitask Learning

2018-03-01

15

OA

AI

DOI：10.1109/TNNLS.2016.2641160

Original

Original request for help

Save

Abstract

En 中文

In this paper, we consider the problem of learning multiple related tasks simultaneously with the goal of improving the generalization performance of individual tasks. The key challenge is to effectively exploit the shared information across multiple tasks as well as preserve the discriminative information for each individual task. To address this, we propose a novel probabilistic model for multitask learning (MTL) that can automatically balance between low-rank and sparsity constraints. The former assumes a low-rank structure of the underlying predictive hypothesis space to explicitly capture the relationship of different tasks and the latter learns the incoherent sparse patterns private to each task. We derive and perform inference via variational Bayesian methods. Experimental results on both regression and classification tasks on real-world applications demonstrate the effectiveness of the proposed method in dealing with the MTL problems.

Keywords:

Bayesian framework

low-rank modeling

multitask learning (MTL)

sparse representation

Probabilistic Low-Rank Multitask Learning

Abstract

Journal

Organization