{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:54Z","timestamp":1773377694366,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834445","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2028-2033","source":"Crossref","is-referenced-by-count":11,"title":["Stochastic Coded Federated Learning with Convergence and Privacy Guarantees"],"prefix":"10.1109","author":[{"given":"Yuchang","family":"Sun","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science and Technology"}]},{"given":"Jiawei","family":"Shao","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology"}]},{"given":"Songze","family":"Li","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology"}]},{"given":"Yuyi","family":"Mao","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University"}]},{"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref11","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/GCWkshps45667.2019.9024521"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3036961"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/DSLW51110.2021.9523408"},{"key":"ref15","first-page":"165","article-title":"Optimal distributed online prediction using mini-batches","volume":"13","author":"dekel","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978308"},{"key":"ref17","author":"ghosh","year":"2010","journal-title":"Fundamentals of LTE"},{"key":"ref18","article-title":"Privacy-utility tradeoff of linear regression under random projections and additive noise","author":"showkatbakhsh","year":"2018","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2935189"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2844341"},{"key":"ref6","article-title":"Achieving linear speedup with partial worker participation in non-iid federated learning","author":"yang","year":"2021","journal-title":"Proc Int Conf Learn Repr (ICLR) Virtual Event"},{"key":"ref5","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"mcmahan","year":"2017","journal-title":"Proc Int Conf Artif Intell Stat (AISTATS)"},{"key":"ref8","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"Proc Int Conf Artif Intell Stat"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0100000103","article-title":"Coded computing: Mitigating fundamental bottlenecks in large-scale distributed computing and machine learning","volume":"17","author":"li","year":"2020","journal-title":"Found Trends Commun Inf Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2962338"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/RBME.2020.3013489"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref22","article-title":"The non-IID data quagmire of decentralized machine learning","author":"hsieh","year":"2020","journal-title":"Proc Int Conf Mach Learn (ICML) Virtual Event"},{"key":"ref21","article-title":"Learning multiple layers of features from tiny images","author":"krizhevsky","year":"0"},{"key":"ref24","article-title":"Very deep convolutional networks for large-scale image recognition","author":"simonyan","year":"2014","journal-title":"Proc Int Conf Learn Repr (ICLR)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797607"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834445.pdf?arnumber=9834445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:54Z","timestamp":1773347694000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834445\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834445","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}