{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T23:29:28Z","timestamp":1762039768192,"version":"build-2065373602"},"reference-count":50,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018AAA0100500"],"award-info":[{"award-number":["2018AAA0100500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu Provincial Key Laboratory of Network and Information Security","award":["BM2003201"],"award-info":[{"award-number":["BM2003201"]}]},{"DOI":"10.13039\/501100011151","name":"Key Laboratory of Computer Network and Information Integration of Ministry of Education of China","doi-asserted-by":"publisher","award":["93K-9"],"award-info":[{"award-number":["93K-9"]}],"id":[{"id":"10.13039\/501100011151","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3099400","type":"journal-article","created":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T21:48:32Z","timestamp":1627336112000},"page":"104079-104092","source":"Crossref","is-referenced-by-count":4,"title":["Fast and Privacy-Preserving Federated Joint Estimator of Multi-sUGMs"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3874-9557","authenticated-orcid":false,"given":"Xiao","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6057-9825","authenticated-orcid":false,"given":"Tianyi","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tongtong","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Fair resource allocation in federated learning","author":"li","year":"2019","journal-title":"arXiv 1905 10497"},{"key":"ref38","article-title":"Threats to federated learning: A survey","author":"lyu","year":"2020","journal-title":"arXiv 2003 02133"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2944481"},{"key":"ref32","article-title":"Local SGD converges fast and communicates little","author":"stich","year":"2018","journal-title":"arXiv 1805 09767"},{"key":"ref31","first-page":"445","article-title":"Node-based learning of multiple Gaussian graphical models","volume":"15","author":"mohan","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2011.00771.x"},{"key":"ref37","article-title":"Federated learning with non-IID data","author":"zhao","year":"2018","journal-title":"arXiv 1806 00582"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904348"},{"key":"ref35","article-title":"HOGWILD!: A lock-free approach to parallelizing stochastic gradient descent","author":"niu","year":"2011","journal-title":"arXiv 1106 5730"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3037554"},{"key":"ref28","first-page":"98","article-title":"Doubly accelerated methods for faster CCA and generalized eigendecomposition","author":"allen-zhu","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"journal-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","year":"2011","author":"boyd","key":"ref27"},{"key":"ref29","article-title":"Federated learning: Strategies for improving communication efficiency","author":"kone?n\u00fd","year":"2016","journal-title":"arXiv 1610 05492"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2003.03.019"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587367"},{"key":"ref20","first-page":"2","article-title":"Learning multiple tasks with a sparse matrix-normal penalty","volume":"6","author":"zhang","year":"2010","journal-title":"Proc NIPS"},{"key":"ref22","first-page":"1168","article-title":"A fast and scalable joint estimator for learning multiple related sparse Gaussian graphical models","author":"wang","year":"2017","journal-title":"Proc Artif Intell Statist"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2014.921182"},{"key":"ref24","first-page":"1691","article-title":"Fast and scalable learning of sparse changes in high-dimensional Gaussian graphical model structure","author":"wang","year":"2018","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref23","first-page":"5161","article-title":"A fast and scalable joint estimator for integrating additional knowledge in learning multiple related sparse Gaussian graphical models","author":"wang","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1037"},{"key":"ref25","article-title":"Federated multi-task learning","author":"smith","year":"2017","journal-title":"arXiv 1705 10467"},{"key":"ref50","first-page":"3367","article-title":"Matrix completion and low-rank SVD via fast alternating least squares","volume":"16","author":"hastie","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s41666-020-00082-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asm018"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref12","first-page":"485","article-title":"Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data","volume":"9","author":"banerjee","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref13","first-page":"92","article-title":"Multi-institutional deep learning modeling without sharing patient data: A feasibility study on brain tumor segmentation","author":"sheller","year":"2018","journal-title":"Proc Int MICCAI Brainlesion Workshop"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12033"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-010-9191-2"},{"key":"ref17","first-page":"1","article-title":"Multi-task learning of Gaussian graphical models","author":"honorio","year":"2010","journal-title":"Proc ICML"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asq060"},{"key":"ref19","article-title":"Learning structural changes of Gaussian graphical models in controlled experiments","author":"zhang","year":"2012","journal-title":"arXiv 1203 3532"},{"key":"ref4","first-page":"1465","article-title":"High-dimensional graphical model selection using $\\ell_{1}$\n-regularized logistic regression","volume":"19","author":"wainwright","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1126\/science.1250298"},{"key":"ref6","article-title":"Towards federated learning at scale: System design","author":"bonawitz","year":"2019","journal-title":"arXiv 1902 01046"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0230706"},{"key":"ref8","article-title":"Federated optimization in heterogeneous networks","author":"li","year":"2018","journal-title":"arXiv 1812 06127"},{"key":"ref7","article-title":"A theoretical framework for robustness of (deep) classifiers against adversarial examples","author":"wang","year":"2016","journal-title":"arXiv 1612 00334"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/BF01399088"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737416"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1183401.1183444"},{"key":"ref45","article-title":"Deep learning with elastic averaging SGD","author":"zhang","year":"2014","journal-title":"arXiv 1412 6651"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1045"},{"key":"ref47","first-page":"2530","article-title":"A linear speedup analysis of distributed deep learning with sparse and quantized communication","author":"jiang","year":"2018","journal-title":"Proc 32nd Int Conf Neural Inf Process Syst"},{"key":"ref42","article-title":"Protection against reconstruction and its applications in private federated learning","author":"bhowmick","year":"2018","journal-title":"arXiv 1812 00984"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3338501.3357370"},{"journal-title":"Codecarbon [EB\/OL]","year":"2021","key":"ref44"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1471-2105-5-1","article-title":"Content-rich biological network constructed by mining pubmed abstracts","volume":"5","author":"chen","year":"2004","journal-title":"BMC Bioinf"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09493203.pdf?arnumber=9493203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:57:10Z","timestamp":1639771030000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9493203\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3099400","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}