{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T23:05:35Z","timestamp":1780009535487,"version":"3.53.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72495121"],"award-info":[{"award-number":["72495121"]}],"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":["12422111"],"award-info":[{"award-number":["12422111"]}],"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":["12371273"],"award-info":[{"award-number":["12371273"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tsp.2026.3688176","type":"journal-article","created":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T19:52:08Z","timestamp":1777319528000},"page":"1926-1941","source":"Crossref","is-referenced-by-count":0,"title":["Byzantine-Resilient Decentralized Optimization for Joint Feature Selection in Multi-Task Networks"],"prefix":"10.1109","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0154-9971","authenticated-orcid":false,"given":"Dazhong","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5449-9180","authenticated-orcid":false,"given":"Weidong","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9362-508X","authenticated-orcid":false,"given":"Xiaojun","family":"Mao","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS776"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/11-aos896"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s41591-021-01506-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-69250-1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.2986024"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014067"},{"key":"ref9","first-page":"745","article-title":"Clustered multi-task learning: A convex formulation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.,","author":"Jacob","year":"2008"},{"key":"ref10","first-page":"702","article-title":"Clustered multi-task learning via alternating structure optimization","author":"Zhou","year":"2011","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020423"},{"key":"ref12","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yin","year":"2018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130413"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2019.2957731"},{"key":"ref15","first-page":"4424","article-title":"Federated multi-task learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.,","author":"Smith","year":"2017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3492866.3549723"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2817461"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2461520"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2236830"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3466772.3467056"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2412918"},{"key":"ref22","first-page":"119","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.,","author":"Blanchard","year":"2017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2022.3188456"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3090952"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3300629"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2016.7905890"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2926022"},{"key":"ref30","article-title":"Fault-tolerant distributed optimization (Part IV): Constrained optimization with arbitrary directed networks","author":"Su","year":"2015"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332505"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/12-STS400"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623641"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-32792-4"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2283750"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/11345506\/11495284.pdf?arnumber=11495284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T22:54:19Z","timestamp":1780008859000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11495284\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/tsp.2026.3688176","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}