Show simple item record

dc.contributor.authorYang, Peng
dc.contributor.authorZhao, Peilin
dc.contributor.authorGao, Xin
dc.date.accessioned2017-07-06T09:43:06Z
dc.date.available2017-07-06T09:43:06Z
dc.date.issued2017-06-29
dc.identifier.citationYANG P, Zhao P, Gao X (2017) Robust Online Multi-Task Learning with Correlative and Personalized Structures. IEEE Transactions on Knowledge and Data Engineering: 1–1. Available: http://dx.doi.org/10.1109/TKDE.2017.2703106.
dc.identifier.issn1041-4347
dc.identifier.doi10.1109/TKDE.2017.2703106
dc.identifier.urihttp://hdl.handle.net/10754/625169
dc.description.abstractMulti-Task Learning (MTL) can enhance a classifier's generalization performance by learning multiple related tasks simultaneously. Conventional MTL works under the offline setting and suffers from expensive training cost and poor scalability. To address such issues, online learning techniques have been applied to solve MTL problems. However, most existing algorithms of online MTL constrain task relatedness into a presumed structure via a single weight matrix, which is a strict restriction that does not always hold in practice. In this paper, we propose a robust online MTL framework that overcomes this restriction by decomposing the weight matrix into two components: the first one captures the low-rank common structure among tasks via a nuclear norm; the second one identifies the personalized patterns of outlier tasks via a group lasso. Theoretical analysis shows the proposed algorithm can achieve a sub-linear regret with respect to the best linear model in hindsight. However, the nuclear norm that simply adds all nonzero singular values together may not be a good low-rank approximation. To improve the results, we use a log-determinant function as a non-convex rank approximation. Experimental results on a number of real-world applications also verify the efficacy of our approaches.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttp://ieeexplore.ieee.org/document/7959634/
dc.rights(c) 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
dc.subjectartificial intelligence
dc.subjectlearning systems
dc.subjectonline learning
dc.subjectmultitask learning
dc.subjectclassification
dc.titleRobust Online Multi-Task Learning with Correlative and Personalized Structures
dc.typeArticle
dc.contributor.departmentComputational Bioscience Research Center (CBRC)
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.identifier.journalIEEE Transactions on Knowledge and Data Engineering
dc.eprint.versionPost-print
dc.contributor.institutionData Analytics, Institute for Infocomm Research, 68705 Singapore, Singapore Singapore 138632
dc.contributor.institutionAnt Finance, Alibaba, Hangzhou, Zhejiang China
kaust.personYang, Peng
kaust.personGao, Xin
refterms.dateFOA2018-06-13T14:43:51Z


Files in this item

Thumbnail
Name:
07959634.pdf
Size:
6.537Mb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record