{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:21:28Z","timestamp":1759332088735,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Swedish research council","award":["2019-03606"],"award-info":[{"award-number":["2019-03606"]}]},{"name":"EU Marie Sklodowska-Curie Actions Project"},{"name":"High-reliability Low-latency Communications with network coding"},{"name":"ERA-NET Smart Energy Systems SG+ 2017 Program"},{"name":"SMART-MLA","award":["89029"],"award-info":[{"award-number":["89029"]}]},{"name":"High-reliable Low-latency Industrial Wireless Communications, and Swedish Foundation for International Cooperation in Research and Higher Education"},{"name":"Efficient and Secure Distributed Machine Learning with Gradient Descend"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tsp.2021.3078625","type":"journal-article","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T19:52:20Z","timestamp":1620762740000},"page":"2844-2857","source":"Crossref","is-referenced-by-count":7,"title":["Randomized Neural Networks Based Decentralized Multi-Task Learning via Hybrid Multi-Block ADMM"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4686-0973","authenticated-orcid":false,"given":"Yu","family":"Ye","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5407-0835","authenticated-orcid":false,"given":"Ming","family":"Xiao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7926-5081","authenticated-orcid":false,"given":"Mikael","family":"Skoglund","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2737319"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084705"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-016-0318-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.03.112"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2896266"},{"key":"ref37","first-page":"1171","article-title":"A proximal alternating direction method for multi-block coupled convex optimization","author":"liu","year":"2018","journal-title":"J Ind Manage Optim"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/120887679"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0877-2"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-016-0131-5"},{"key":"ref10","first-page":"733","article-title":"A convex formulation for learning task relationships in multi-task learning","author":"zhang","year":"0"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-018-0757-z"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2690683"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.189"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2671789"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2601282"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71246-8_40"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2626801"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-017-5676-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2884996"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098136"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2367458"},{"key":"ref4","first-page":"41","article-title":"Multi-task feature learning","author":"argyriou","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2254478"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2452911"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273499"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2602803"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"ref8","first-page":"1383","article-title":"Learning task grouping and overlap in multi-task learning","author":"kumar","year":"0"},{"key":"ref7","first-page":"521","article-title":"Learning with whom to share in multi-task feature learning","author":"kang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014067"},{"key":"ref9","first-page":"951","article-title":"Exploiting unrelated tasks in multi-task learning","author":"romera-paredes","year":"0","journal-title":"Int Conf Arti Intel Stat"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/130943170"},{"key":"ref20","first-page":"4424","article-title":"Federated multi-task learning","author":"smith","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/72.471375"},{"key":"ref22","first-page":"751","article-title":"Distributed multi-task learning","author":"wang","year":"0","journal-title":"Proc Artif Intell Statist"},{"article-title":"Distributed stochastic multi-task learning with graph regularization","year":"2018","author":"wang","key":"ref21"},{"article-title":"Federated learning:Strategies for improving communication efficiency","year":"2016","author":"kone?n?","key":"ref42"},{"article-title":"Distributed multi-task learning with shared representation","year":"2016","author":"wang","key":"ref24"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2168604"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2016.2588463"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2734043"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.01.070"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/13094829X"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9307529\/09428542.pdf?arnumber=9428542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:45Z","timestamp":1652194245000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9428542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/tsp.2021.3078625","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2021]]}}}