arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.05618cs.LGstat.ML
收藏

在多任务学习中学习可解释的图结构

Learning an Interpretable Graph Structure in Multi-Task Learning

NEC Laboratories Europe(NEC欧洲实验室);Heidelberg University(海德堡大学)

Shujian Yu, Francesco Alesiani, Ammar Shaker, Wenzhe Yin

摘要:

我们提出了一种新的方法来联合执行多任务学习和推断任务之间的内在关系,通过一个可解释的和稀疏的图。与现有的多任务学习方法不同,图结构不被假设为先验已知或在预处理步骤中单独估计。相反,我们的图是与每个任务的模型参数同时学习的,因此它反映了特定预测问题中任务之间的关键关系。我们用加权邻接矩阵描述了图的结构,并证明了总体目标可以交替优化,直到收敛。我们还表明,我们的方法可以简单地扩展到一个非线性形式嵌入到一个多头径向基函数网络(RBFN)。广泛的实验,对六个国家的最先进的方法,在合成数据和现实世界的应用表明,我们的方法是能够减少泛化误差,并在同一时间,揭示了稀疏图的任务,更容易解释。

英文摘要:

We present a novel methodology to jointly perform multi-task learning and infer intrinsic relationship among tasks by an interpretable and sparse graph. Unlike existing multi-task learning methodologies, the graph structure is not assumed to be known a priori or estimated separately in a preprocessing step. Instead, our graph is learned simultaneously with model parameters of each task, thus it reflects the critical relationship among tasks in the specific prediction problem. We characterize graph structure with its weighted adjacency matrix and show that the overall objective can be optimized alternatively until convergence. We also show that our methodology can be simply extended to a nonlinear form by being embedded into a multi-head radial basis function network (RBFN). Extensive experiments, against six state-of-the-art methodologies, on both synthetic data and real-world applications suggest that our methodology is able to reduce generalization error, and, at the same time, reveal a sparse graph over tasks that is much easier to interpret.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑