As the sheer volume of available benchmark datasets increases, the problem of joint learning of classifiers and knowledge-transfer between classifiers, becomes more and more relevant. We present a hierarchical approach which exploits information sharing among different classification tasks, in multi-task and multi-class settings. It engages a top-down iterative method, which begins by posing an optimization problem with an incentive for large scale sharing among all classes. This incentive to share is gradually decreased, until there is no sharing and all tasks are considered separately. The method therefore exploits different levels of sharing within a given group of related tasks, without having to make hard decisions about the grouping of tasks. In order to deal with large scale problems, with many tasks and many classes, we extend our batch approach to an online setting and provide regret analysis of the algorithm. We tested our approach extensively on synthetic and real datasets, showing significant improvement over baseline and state-of-the-art methods.
|Original language||American English|
|Number of pages||9|
|State||Published - 2013|
|Event||30th International Conference on Machine Learning, ICML 2013 - Atlanta, GA, United States|
Duration: 16 Jun 2013 → 21 Jun 2013
|Conference||30th International Conference on Machine Learning, ICML 2013|
|Period||16/06/13 → 21/06/13|