Timezone: »

Multitask Learning without Label Correspondences
Novi Quadrianto · Alexander Smola · Tiberio Caetano · S.V.N. Vishwanathan · James Petterson

Mon Dec 06 12:00 AM -- 12:00 AM (PST) @

We propose an algorithm to perform multitask learning where each task has potentially distinct label sets and label correspondences are not readily available. This is in contrast with existing methods which either assume that the label sets shared by different tasks are the same or that there exists a label mapping oracle. Our method directly maximizes the mutual information among the labels, and we show that the resulting objective function can be efficiently optimized using existing algorithms. Our proposed approach has a direct application for data integration with different label spaces for the purpose of classification, such as integrating Yahoo! and DMOZ web directories.

Author Information

Novi Quadrianto (University of Sussex and HSE)
Alexander Smola (Amazon)

**AWS Machine Learning**

Tiberio Caetano (NICTA Canberra)
S.V.N. Vishwanathan (UCSC)
James Petterson (NICTA)

More from the Same Authors