Structured feature selection and task relationship inference for multi-task learning

被引:20
作者
Fei, Hongliang [1 ]
Huan, Jun [1 ]
机构
[1] Univ Kansas, Dept EECS, Lawrence, KS 66045 USA
基金
美国国家科学基金会;
关键词
Multi-task learning; Task relationship inference; Structured input and structured output; Structural sparsity; CLASSIFICATION;
D O I
10.1007/s10115-012-0543-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-task learning (MTL) aims to enhance the generalization performance of supervised regression or classification by learning multiple related tasks simultaneously. In this paper, we aim to extend the current MTL techniques to high dimensional data sets with structured input and structured output (SISO), where the SI means the input features are structured and the SO means the tasks are structured. We investigate a completely ignored problem in MTL with SISO data: the interplay of structured feature selection and task relationship modeling. We hypothesize that combining the structure information of features and task relationship inference enables us to build more accurate MTL models. Based on the hypothesis, we have designed an efficient learning algorithm, in which we utilize a task covariance matrix related to the model parameters to capture the task relationship. In addition, we design a regularization formulation for incorporating the structured input features in MTL. We have developed an efficient iterative optimization algorithm to solve the corresponding optimization problem. Our algorithm is based on the accelerated first order gradient method in conjunction with the projected gradient scheme. Using two real-world data sets, we demonstrate the utility of the proposed learning methods.
引用
收藏
页码:345 / 364
页数:20
相关论文
共 51 条
[1]  
[Anonymous], INTRO LECT CONVEX OP
[2]  
[Anonymous], 2007, NIPS
[3]  
[Anonymous], CORE DISC PAPER
[4]  
[Anonymous], 2011, P 20 INT C WORLD WID, DOI DOI 10.1145/1963405.1963503
[5]  
[Anonymous], MET CANC
[6]  
[Anonymous], 2007, ADV NEURAL INF PROCE
[7]  
[Anonymous], 2011, ACM T INTEL SYST TEC
[8]  
[Anonymous], P INT ASTR UN S ASTR
[9]  
[Anonymous], 16 ACM SIGKDD INT C
[10]  
[Anonymous], P 26 C UNC ART INT U