.png){kind=icon}
返回
Flexible multi-task learning with latent task grouping
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2015.12.092.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In multi-task learning, using task grouping structure has been shown to be effective in preventing inappropriate knowledge transfer among unrelated tasks. However, the group structure often has to be predetermined using prior knowledge or heuristics, which has no theoretical guarantee and could lead to unsatisfactory learning performance. In this paper, we present a flexible multi-task learning framework to identify latent grouping structures under agnostic settings, where the prior of the latent subspace is unknown to the learner. In particular, we relax the latent subspace to be full rank, while imposing sparsity and orthogonality on the representation coefficients of target models. As a result, the target models still lie on a low dimensional subspace spanned by the selected basis tasks, and the structure of the latent task subspace is fully determined by the data. The final learning process is formulated as a joint optimization procedure over both the latent space and the target models. Besides providing proofs of theoretical guarantee on learning performance, we also conduct empirical evaluations on both synthetic and real data. Experimental results and comparisons with competing approaches corroborate the effectiveness of the proposed method. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Multi-task learning
Group structure
Regularization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Graphene/Ionic Liquid Binary Electrode Material for High Performance Supercapacitor用于高性能超级电容器的石墨烯/离子液体二元电极材料
PREAI
分享收藏分享收藏ESTIMATION OF (NEAR) LOW-RANK MATRICES WITH NOISE AND HIGH-DIMENSIONAL SCALING具有噪声和高维缩放的 (近) 低秩矩阵的估计.png)
ANNALS OF STATISTICSOAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏分享收藏
查看更多内容