Learning the Graph of Relations Among Multiple Tasks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2013

Learning the Graph of Relations Among Multiple Tasks


We propose multitask Laplacian learning, a new method for jointly learning clusters of closely related tasks. Unlike standard multitask methodologies, the graph of relations among the tasks is not assumed to be known a priori, but is learned by the multitask Laplacian algorithm. The algorithm builds on kernel based methods and exploits an optimization approach for learning a continuously parameterized kernel. It involves solving a semidefinite program of a particu- lar type, for which we develop an algorithm based on Douglas-Rachford split- ting methods. Multitask Laplacian learning can find application in many cases in which tasks are related with each other to varying degrees, some strongly, oth- ers weakly. Our experiments highlight such cases in which multitask Laplacian learning outperforms independent learning of tasks and state of the art multitask learning methods. In addition, they demonstrate that our algorithm partitions the tasks into clusters each of which contains well correlated tasks.
Fichier principal
Vignette du fichier
MTGraph.pdf (299.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00940321 , version 1 (03-02-2014)


  • HAL Id : hal-00940321 , version 1


Andreas Argyriou, Stéphan Clémençon, Ruocong Zhang. Learning the Graph of Relations Among Multiple Tasks. [Research Report] 2013. ⟨hal-00940321⟩
462 View
743 Download


Gmail Facebook X LinkedIn More