{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T19:57:22Z","timestamp":1793131042576,"version":"4.5.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Berlin Institute for the Foundations of Learning and Data","award":["01IS18025A"],"award-info":[{"award-number":["01IS18025A"]}],"id":[{"id":"https:\/\/ror.org\/05dsfb086","id-type":"ROR","asserted-by":"crossref"}]},{"name":"Berlin Institute for the Foundations of Learning and Data","award":["01IS18037"],"award-info":[{"award-number":["01IS18037"]}],"id":[{"id":"https:\/\/ror.org\/05dsfb086","id-type":"ROR","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","award":["EXC 2046\/1"],"award-info":[{"award-number":["EXC 2046\/1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","award":["390685689"],"award-info":[{"award-number":["390685689"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Information & Communications Technology Planning & Evaluation"},{"DOI":"10.13039\/501100003621","name":"Korea Government","doi-asserted-by":"publisher","award":["2017-0-00451"],"award-info":[{"award-number":["2017-0-00451"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1109\/tnnls.2020.3015958","type":"journal-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T16:38:16Z","timestamp":1598287096000},"page":"3710-3722","source":"Crossref","is-referenced-by-count":1205,"title":["Clustered Federated Learning: Model-Agnostic Distributed Multitask Optimization Under Privacy Constraints"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9425-2238","authenticated-orcid":false,"given":"Felix","family":"Sattler","sequence":"first","affiliation":[{"name":"Fraunhofer Heinrich Hertz Institute, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3861-7685","authenticated-orcid":false,"given":"Klaus-Robert","family":"Muller","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Technische Universität Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6283-3265","authenticated-orcid":false,"given":"Wojciech","family":"Samek","sequence":"additional","affiliation":[{"name":"Fraunhofer Heinrich Hertz Institute, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2020.2969554"},{"key":"ref38","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","author":"alistarh","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","article-title":"Exploiting unintended feature leakage in collaborative learning","author":"melis","year":"2018","journal-title":"arXiv 1805 04049"},{"key":"ref32","article-title":"The secret sharer: Evaluating and testing unintended memorization in neural networks","author":"carlini","year":"2018","journal-title":"arXiv 1802 08232"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813677"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134012"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref35","author":"krizhevsky","year":"2014","journal-title":"CIFAR-10 Dataset"},{"key":"ref34","author":"lecun","year":"1998","journal-title":"The MNIST Database of Handwritten Digits"},{"key":"ref10","article-title":"Robust federated learning in a heterogeneous environment","author":"ghosh","year":"2019","journal-title":"arXiv 1906 06629"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2910073"},{"key":"ref11","article-title":"LEAF: A benchmark for federated settings","author":"caldas","year":"2018","journal-title":"arXiv 1812 01097"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3298981"},{"key":"ref13","article-title":"Don’t use large mini-batches, use local SGD","author":"lin","year":"2018","journal-title":"arXiv 1808 07217"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2019.8852172"},{"key":"ref15","article-title":"Robust and communication-efficient federated learning from non-i.I.d. data","author":"sattler","year":"2019","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref16","article-title":"Federated learning with non-IID data","author":"zhao","year":"2018","journal-title":"arXiv 1806 00582"},{"key":"ref17","first-page":"2525","article-title":"A linear speedup analysis of distributed deep learning with sparse and quantized communication","author":"jiang","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","author":"yu","year":"2018","journal-title":"arXiv 1807 06629"},{"key":"ref19","article-title":"Decentralized deep learning with arbitrary communication compression","author":"koloskova","year":"2019","journal-title":"arXiv 1907 09356"},{"key":"ref28","article-title":"Deep gradient compression: Reducing the communication bandwidth for distributed training","author":"lin","year":"2017","journal-title":"arXiv 1712 01887"},{"key":"ref4","article-title":"Towards federated learning at scale: System design","author":"bonawitz","year":"2019","journal-title":"arXiv 1902 01046"},{"key":"ref27","article-title":"Variational federated multi-task learning","author":"corinzia","year":"2019","journal-title":"arXiv 1906 06268"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054676"},{"key":"ref29","article-title":"Protection against reconstruction and its applications in private federated learning","author":"bhowmick","year":"2018","journal-title":"arXiv 1812 00984"},{"key":"ref5","article-title":"Federated learning: Challenges, methods, and future directions","author":"li","year":"2019","journal-title":"arXiv 1908 07873"},{"key":"ref8","article-title":"Federated optimization in heterogeneous networks","author":"li","year":"2018","journal-title":"arXiv 1812 06127"},{"key":"ref7","article-title":"On the convergence of FedAvg on non-IID data","author":"li","year":"2019","journal-title":"arXiv 1907 02189"},{"key":"ref2","article-title":"Federated optimization: Distributed machine learning for on-device intelligence","author":"kone?n\u00fd","year":"2016","journal-title":"arXiv 1610 02527"},{"key":"ref9","first-page":"4424","article-title":"Federated multi-task learning","author":"smith","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"mcmahan","year":"2016","journal-title":"arXiv 1602 05629"},{"key":"ref20","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","author":"koloskova","year":"2019","journal-title":"arXiv 1902 00340"},{"key":"ref22","article-title":"CoCoA: A general framework for communication-efficient distributed optimization","author":"smith","year":"2016","journal-title":"arXiv 1611 02189"},{"key":"ref21","first-page":"4447","article-title":"Sparsified SGD with memory","author":"stich","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-08987-4"},{"key":"ref24","first-page":"745","article-title":"Clustered multi-task learning: A convex formulation","author":"jacob","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-28954-6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"ref26","article-title":"An overview of multi-task learning in deep neural networks","author":"ruder","year":"2017","journal-title":"ArXiv 1706 05098"},{"key":"ref25","article-title":"Learning task grouping and overlap in multi-task learning","author":"kumar","year":"2012","journal-title":"arXiv 1206 6417"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/9505270\/09174890.pdf?arnumber=9174890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T15:43:56Z","timestamp":1642175036000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174890\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":42,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2020.3015958","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8]]}}}