Title
Encoding sparse and competitive structures among tasks in multi-task learning.
Abstract
•we develop a new formulation for MTL based on the decomposition of the coeffcient matrix into a Hadamard (element-wise) product of two matrices. Comparing with conventional MTL methods and EL, the advantages of the proposed approach can be summarized as follows: (1) It is capable of capturing the competitive structure among tasks. (2) Unimportant features which are common across the tasks can be removed from the final model. Moreover, we propose to employ an alternating optimization method to iteratively estimate the coeffcients of the two components in the SpEL objective function.•We also provide an analysis of the proposed model based on the element- wise product decomposition framework to highlight its advantage.•We conduct experimental studies on both synthetic and real data in different application domains which include handwritten digit data and gene expression analysis. The experimental results demonstrate the effectiveness of the proposed model, and suggest potential applications of the proposed method.
Year
DOI
Venue
2019
10.1016/j.patcog.2018.12.018
Pattern Recognition
Keywords
Field
DocType
Multi-task learning,Sparse exclusive lasso,Task-competitive
Multi-task learning,Lasso (statistics),Artificial intelligence,Mathematics,Machine learning,Encoding (memory)
Journal
Volume
Issue
ISSN
88
1
0031-3203
Citations 
PageRank 
References 
1
0.36
26
Authors
5
Name
Order
Citations
PageRank
Cheng Liu1335.72
Chutao Zheng291.90
Sheng Qian3194.02
Si Wu4177.03
Hau-San Wong5100886.89