摘要
在线多任务学习(MTL)算法大多利用单个权重矩阵约束任务相关性,且该约束较为严格,在实践中难以满足。为此,提出一种改进的在线MTL算法,通过将权重矩阵分解为2个子矩阵来克服上述约束。对第1个子矩阵进行迹-范数正规化,获得低秩相关结构。利用正规化项对第2个子矩阵进行个性化任务的群组式Lasso惩罚,确定个性化模式。采用投影梯度算法对子矩阵进行自适应学习并获得最优解。实验结果表明,该算法相对于最优线性后验模型可实现次线性遗憾,其预测精度、运行速度优于TRML、MTFL等算法,且在垃圾邮件数据集上的累计误差率可降至4.97 %。
Most algorithms for online Multi-Task Learning(MTL) constrain task relatedness via a single weight matrix,and the constraint is so strict that it can not always hold in practice.Thus an improved online MTL algorithm is proposed to overcome this constraint by decomposing the weight matrix into two sub-matrics.A trace-norm regularization is imposed on the first sub-matrics to induce a low-rank correlative structure.A group Lasso penalty over individual tasks is applied on the second sub-matrics through a regularization term to identify personalized patterns.The projection gradient algorithm is applied to the adaptive learning of these sub-matrices and the optimal solution is obtained.Experimental results show that the proposed algorithm can achieve a sub-linear regret with respect to the best linear model in hindsight,the accuracy and the running time of the algorithm is better than TRML、MTFL and other algorithms,its cumulative error rate on the spam mail data set can be reduced to 4.97 %.
作者
张文金
ZHANG Wenjin(Department of Information Engineering,Guangzhou Railway Polytechnic,Guangzhou 510430,China)
出处
《计算机工程》
CAS
CSCD
北大核心
2019年第8期190-197,共8页
Computer Engineering
基金
广东省科技计划项目(2015A030401005)
关键词
多任务学习
权重矩阵
相关性结构
个性化模式
次线性遗憾
Multi-Task Learning(MTL)
weight matrix
correlative structure
personalized patterns
sub-linear regret
