Learning the Graph of Relations Among Multiple Tasks

Abstract : 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.
Type de document :
[Research Report] 2013
Liste complète des métadonnées

Littérature citée [27 références]  Voir  Masquer  Télécharger

Contributeur : Puneet Kumar Dokania <>
Soumis le : lundi 3 février 2014 - 13:37:45
Dernière modification le : jeudi 29 mars 2018 - 13:36:02
Document(s) archivé(s) le : dimanche 9 avril 2017 - 05:03:54


Fichiers produits par l'(les) auteur(s)


  • 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〉



Consultations de la notice


Téléchargements de fichiers