UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Taking advantage of sparsity in multi-task learning

Lounici, K; Pontil, M; Tsybakov, AB; Van De Geer, SA; (2009) Taking advantage of sparsity in multi-task learning. In: Green open access

[thumbnail of Pontil_008[1].pdf]
Preview
PDF
Pontil_008[1].pdf

Download (212kB)

Abstract

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 [1], we assume that the sparsity patterns of the regression vectors are included in the same set of small cardinality. 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 [3, 19]. 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.

Type: Proceedings paper
Title: Taking advantage of sparsity in multi-task learning
Open access status: An open access version is available from UCL Discovery
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: https://discovery.ucl.ac.uk/id/eprint/163467
Downloads since deposit
52Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item