{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T16:02:11Z","timestamp":1772553731597,"version":"3.50.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP-140102164"],"award-info":[{"award-number":["DP-140102164"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT-130101457"],"award-info":[{"award-number":["FT-130101457"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572428"],"award-info":[{"award-number":["61572428"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1509206"],"award-info":[{"award-number":["U1509206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2017,2,1]]},"DOI":"10.1109\/tpami.2016.2544314","type":"journal-article","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T18:56:56Z","timestamp":1458586616000},"page":"227-241","source":"Crossref","is-referenced-by-count":100,"title":["Algorithm-Dependent Generalization Bounds for Multi-Task Learning"],"prefix":"10.1109","volume":"39","author":[{"given":"Tongliang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[]},{"given":"Mingli","family":"Song","sequence":"additional","affiliation":[]},{"given":"Stephen J.","family":"Maybank","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"1383","article-title":"Learning task grouping and overlap in multi-task learning","author":"kumar","year":"0","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref38","first-page":"702","article-title":"Clustered multi-task learning via alternating structure optimization","author":"zhou","year":"0","journal-title":"Proc Adv Neural Inf Process Syst 24"},{"key":"ref33","article-title":"Excess risk bounds for multitask learning with trace norm regularization","author":"pontil","year":"0","journal-title":"Proc COLT"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/090763184"},{"key":"ref31","first-page":"25","article-title":"A spectral regularization framework for multi-task structure learning","author":"argyriou","year":"0","journal-title":"Proc Adv Neural Inf Process Syst 20"},{"key":"ref30","first-page":"942","article-title":"Stability and hypothesis transfer learning","author":"kuzborskij","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref37","first-page":"613","article-title":"Infinite predictor subspace models for multitask learning","author":"rai","year":"0","journal-title":"Proc 13th Int Conf Artif Intell Statist"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553392"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014067"},{"key":"ref34","article-title":"Taking advantage of sparsity in multi-task learning","author":"lounici","year":"0","journal-title":"Proc COLT"},{"key":"ref28","first-page":"1","article-title":"Stability of multi-task kernel regression algorithms","author":"audiffren","year":"0","journal-title":"Proc ACM"},{"key":"ref27","first-page":"3181","article-title":"Multi-task learning and algorithmic stability","author":"zhang","year":"0","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref29","first-page":"111","article-title":"Leave-one-out error and stability of learning algorithms with applications","volume":"190","author":"elisseeff","year":"2003","journal-title":"Nato Science Series Sub Series Computer and Systems Science"},{"key":"ref2","first-page":"142","article-title":"Boosted multi-task learning for face verification with applications to web image and video search","author":"wang","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recog"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-307-3.50012-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.623181"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813564"},{"key":"ref21","first-page":"527","article-title":"Covering number bounds of certain regularized linear function classes","volume":"2","author":"zhang","year":"2002","journal-title":"J Mach Learn Res"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.930926"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.971752"},{"key":"ref26","first-page":"499","article-title":"Stability and generalization","volume":"2","author":"bousquet","year":"2002","journal-title":"J Mach Learn Res"},{"key":"ref25","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"bartlett","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref50","first-page":"441","article-title":"On the generalization ability of online strongly convex programming algorithms","author":"kakade","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref51","author":"mohri","year":"2012","journal-title":"Foundations of Machine Learning"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176988477"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12788-9_6"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.189"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1613\/jair.731","article-title":"A model of inductive bias learning","volume":"12","author":"baxter","year":"2000","journal-title":"J Artif Intell Res"},{"key":"ref40","first-page":"296","article-title":"Multi-task vector field learning","author":"lin","year":"0","journal-title":"Proc Adv Neur Inf Process Syst"},{"key":"ref12","first-page":"567","article-title":"Exploiting task relatedness for multiple task learning","author":"ben-david","year":"0","journal-title":"Proc 16th Annu Conf Computational Learn Theory 7th Kernel Workshop"},{"key":"ref13","first-page":"1817","article-title":"A framework for learning predictive structures from multiple tasks and unlabeled data","volume":"6","author":"ando","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref14","first-page":"117","article-title":"Bounds for linear multi-task learning","volume":"7","author":"maurer","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5109-7"},{"key":"ref16","first-page":"343","article-title":"Sparse coding for multitask and transfer learning","author":"maurer","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref17","article-title":"Kernels for multi–task learning","author":"micchelli","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.705570"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3264-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-012-0582-z"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539975"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390177"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.297"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623641"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483272"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2343221"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0022-1236(67)90017-1"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90019-2"},{"key":"ref48","first-page":"449","article-title":"Making gradient descent optimal for strongly convex stochastic optimization","author":"rakhlin","year":"0","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref47","article-title":"Beyond the regret minimization barrier: An optimal algorithm for stochastic strongly-convex optimization","author":"hazan","year":"0","journal-title":"Proc COLT"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016304"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1109\/TPAMI.2008.296","article-title":"Semisupervised multitask learning","volume":"31","author":"liu","year":"2009","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.5802\/afst.961"},{"key":"ref43","first-page":"2635","article-title":"Learnability, stability and uniform convergence","volume":"11","author":"shalev-shwartz","year":"2010","journal-title":"J Mach Learn Res"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7809159\/07437460.pdf?arnumber=7437460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:12:50Z","timestamp":1642003970000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7437460\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,1]]},"references-count":54,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2016.2544314","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,1]]}}}