Learning Multi-Task Communication with Message Passing for Sequence Learning

被引:0
作者
Liu, Pengfei [1 ,2 ]
Fu, Jie [2 ]
Dong, Yue [2 ,3 ]
Qiu, Xipeng [1 ]
Cheung, Jackie Chi Kit [2 ,3 ]
机构
[1] Fudan Univ, Sch Comp Sci, Shanghai Inst Intelligent Elect & Syst, Shanghai, Peoples R China
[2] MILA, Berlin, Germany
[3] McGill Univ, Montreal, PQ, Canada
来源
THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE | 2019年
基金
加拿大自然科学与工程研究理事会; 中国国家自然科学基金;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present two architectures for multi-task learning with neural sequence models. Our approach allows the relationships between different tasks to be learned dynamically, rather than using an ad-hoc pre-defined structure as in previous work. We adopt the idea from message-passing graph neural networks, and propose a general graph multi-task learning framework in which different tasks can communicate with each other in an effective and interpretable way. We conduct extensive experiments in text classification and sequence labelling to evaluate our approach on multi-task learning and transfer learning. The empirical results show that our models not only outperform competitive baselines, but also learn interpretable and transferable patterns across tasks.
引用
收藏
页码:4360 / 4367
页数:8
相关论文
共 29 条
  • [1] [Anonymous], 2004, The Journal of Machine Learning Research, DOI DOI 10.1162/153244304322765658
  • [2] [Anonymous], 2010, Graph-structured multi-task regression and an efficient optimization method for general fused lasso
  • [3] GROMACS - A MESSAGE-PASSING PARALLEL MOLECULAR-DYNAMICS IMPLEMENTATION
    BERENDSEN, HJC
    VANDERSPOEL, D
    VANDRUNEN, R
    [J]. COMPUTER PHYSICS COMMUNICATIONS, 1995, 91 (1-3) : 43 - 56
  • [4] Chen JZ, 2016, PROCEEDINGS OF 2016 12TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), P551, DOI [10.1109/CIS.2016.133, 10.1109/CIS.2016.0134]
  • [5] Collobert R., 2008, P 25 INT C MACHINE L, P160, DOI [10.1145/1390156.1390177, DOI 10.1145/1390156.1390177]
  • [6] Dong Daxiang, 2015, P ACL
  • [7] Firat O, 2016, P 2016 C N AM CHAPT, P866, DOI 10.18653/v1/n16-1101
  • [8] Gilmer J, 2017, PR MACH LEARN RES, V70
  • [9] Graves A, 2012, STUD COMPUT INTELL, V385, P1, DOI [10.1162/neco.1997.9.1.1, 10.1007/978-3-642-24797-2]
  • [10] Guo J, 2016, ARXIV160601161