Multitask Learning without Label Correspondences

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.

Authors

• Novi Quadrianto
• James Petterson
• Tibério Caetano
• Alex Smola
• S. V. N. Vishwanathan

Keywords

No keywords are indexed for this paper.