Taking Advantage of Sparsity in Multi-Task Learning

Details Taking Advantage of Sparsity in Multi-Task Learning Taking Advantage of Sparsity in Multi-Task Learning

2009-03-09

arxiv.org/abs/0903.1468v1

Statistics

Machine Learning

Scientific paper

We study the problem of estimating multiple linear regression equations for the purpose of both prediction and variable selection. Following recent work on multi-task learning Argyriou et al. [2008], we assume that the regression vectors share the same sparsity pattern. This means that the set of relevant predictor variables is the same across the different equations. This assumption leads us to consider the Group Lasso as a candidate estimation method. We show that this estimator enjoys nice sparsity oracle inequalities and variable selection properties. The results hold under a certain restricted eigenvalue condition and a coherence condition on the design matrix, which naturally extend recent work in Bickel et al. [2007], Lounici [2008]. In particular, in the multi-task learning scenario, in which the number of tasks can grow, we are able to remove completely the effect of the number of predictor variables in the bounds. Finally, we show how our results can be extended to more general noise distributions, of which we only require the variance to be finite.

Affiliated with

Also associated with

No associations

Rating

Taking Advantage of Sparsity in Multi-Task Learning 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 Taking Advantage of Sparsity in Multi-Task Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Taking Advantage of Sparsity in Multi-Task Learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-95295