Exploiting task-feature co-clusters in multi-task learning

18Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.

Abstract

In multi-task learning, multiple related tasks are considered simultaneously, with the goal to improve the generalization performance by utilizing the intrinsic sharing of information across tasks. This paper presents a multitask learning approach by modeling the task-feature relationships. Specifically, instead of assuming that similar tasks have similar weights on all the features, we start with the motivation that the tasks should be related in terms of subsets of features, which implies a co-cluster structure. We design a novel regularization term to capture this task-feature co-cluster structure. A proximal algorithm is adopted to solve the optimization problem. Convincing experimental results demonstrate the effectiveness of the proposed algorithm and justify the idea of exploiting the task-feature relationships.

Cite

CITATION STYLE

APA

Xu, L., Huang, A., Chen, J., & Chen, E. (2015). Exploiting task-feature co-clusters in multi-task learning. In Proceedings of the National Conference on Artificial Intelligence (Vol. 3, pp. 1931–1937). AI Access Foundation. https://doi.org/10.1609/aaai.v29i1.9483

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free