{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T17:12:48Z","timestamp":1774631568171,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T00:00:00Z","timestamp":1749340800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T00:00:00Z","timestamp":1749340800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,8]]},"DOI":"10.1109\/ssp64130.2025.11073358","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T17:36:31Z","timestamp":1752687391000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Sparsity-based regularization for learning over multitask graphs"],"prefix":"10.1109","author":[{"given":"Yara","family":"Zgheib","sequence":"first","affiliation":[{"name":"Universit&#x00E9; C&#x00F4;ted&#x2019;Azur,I3S Laboratory, CNRS,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Antonini","sequence":"additional","affiliation":[{"name":"Universit&#x00E9; C&#x00F4;ted&#x2019;Azur,I3S Laboratory, CNRS,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roula","family":"Nassif","sequence":"additional","affiliation":[{"name":"Universit&#x00E9; C&#x00F4;ted&#x2019;Azur,I3S Laboratory, CNRS,France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Federated Learning: Strategies for improving communication efficiency","volume-title":"NIPS Workshop on Private Multi-Party Machine Learning","author":"Kone\u010dn\u00fd"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2200000051"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2231991"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2966273"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref8","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","volume-title":"Proc. International Conference on Machine Learning","volume":"97","author":"Koloskova"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2676468"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3160699"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/WorldS450073.2020.9210355"},{"key":"ref12","first-page":"4427","article-title":"Federated multitask learning","volume-title":"Proc. International Conference on Neural Information Processing Systems","volume":"30","author":"Smith"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2423256"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2365686"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2010.2047030"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2012.2219629"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2970336"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2981204"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/OJSP.2020.2989038"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2333560"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2686368"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422716"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783313"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2601282"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/050626090"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638699"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0472-0"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2011.02.079"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.21236\/ADA528514"},{"key":"ref31","article-title":"CVX: Matlab software for disciplined convex programming, version 2.1","author":"Grant","year":"2014"}],"event":{"name":"2025 IEEE Statistical Signal Processing Workshop (SSP)","location":"Edinburgh, United Kingdom","start":{"date-parts":[[2025,6,8]]},"end":{"date-parts":[[2025,6,11]]}},"container-title":["2025 IEEE Statistical Signal Processing Workshop (SSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11073125\/11073128\/11073358.pdf?arnumber=11073358","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T04:53:19Z","timestamp":1752727999000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11073358\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,8]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/ssp64130.2025.11073358","relation":{},"subject":[],"published":{"date-parts":[[2025,6,8]]}}}