{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:05Z","timestamp":1740131705597,"version":"3.37.3"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1109\/tit.2023.3344141","type":"journal-article","created":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T19:29:25Z","timestamp":1702927765000},"page":"2807-2830","source":"Crossref","is-referenced-by-count":2,"title":["Order Optimal Bounds for One-Shot Federated Learning Over Non-Convex Loss Functions"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3910-2878","authenticated-orcid":false,"given":"Arsalan","family":"Sharifnassab","sequence":"first","affiliation":[{"name":"Computing Science Department, Reinforcement Learning and Artificial Intelligence (RLAI) lab, University of Alberta, Edmonton, AB, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3934-9931","authenticated-orcid":false,"given":"Saber","family":"Salehkaleybar","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Jamaloddin","family":"Golestani","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"1","key":"ref1","first-page":"1","article-title":"One-shot federated learning: Theoretical limits and algorithms to achieve them","volume":"22","author":"Salehkaleybar","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref2","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Artif. Intell. Statist.","author":"McMahan"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/447"},{"issue":"1","key":"ref4","first-page":"9709","article-title":"Cooperative SGD: A unified framework for the design and analysis of local-update SGD algorithms","volume":"22","author":"Wang","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref5","article-title":"Federated learning: Strategies for improving communication efficiency","author":"Kone\u010dn\u1ef3","year":"2016","journal-title":"arXiv:1610.05492"},{"key":"ref6","first-page":"2530","article-title":"A linear speedup analysis of distributed deep learning with sparse and quantized communication","volume-title":"Proc. 32nd Int. Conf. Neural Inf. Process. Syst.","author":"Jiang"},{"key":"ref7","article-title":"Expanding the reach of federated learning by reducing client resource requirements","author":"Caldas","year":"2018","journal-title":"arXiv:1812.07210"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2944481"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-29763-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC56025.2022.00044"},{"key":"ref11","first-page":"2595","article-title":"Parallelized stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"23","author":"Zinkevich"},{"key":"ref12","first-page":"1223","article-title":"More effective distributed ML via a stale synchronous parallel parameter server","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ho"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9195"},{"key":"ref14","first-page":"3581","article-title":"Federated learning with buffered asynchronous aggregation","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Nguyen"},{"key":"ref15","first-page":"814","article-title":"Papaya: Practical, private, and scalable federated learning","volume-title":"Proc. Mach. Learn. Syst.","volume":"4","author":"Huba"},{"issue":"4","key":"ref16","first-page":"7","article-title":"Parallel restarted SGD for non-convex optimization with faster convergence and less communication","volume":"2","author":"Yu","year":"2018","journal-title":"arXiv:1807.06629"},{"key":"ref17","first-page":"7184","article-title":"On the linear speedup analysis of communication efficient momentum sgd for distributed non-convex optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yu"},{"key":"ref18","first-page":"429","article-title":"Federated optimization in heterogeneous networks","volume-title":"Proc. Mach. Learn. Syst.","volume":"2","author":"Li"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904348"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00077"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00990"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01057"},{"key":"ref23","first-page":"7611","article-title":"Tackling the objective inconsistency problem in heterogeneous federated optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","volume":"33","author":"Wang"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155494"},{"key":"ref25","first-page":"12878","article-title":"Data-free knowledge distillation for heterogeneous federated learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhu"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"ref28","article-title":"Differentially private federated learning: A client level perspective","author":"Geyer","year":"2017","journal-title":"arXiv:1712.07557"},{"key":"ref29","article-title":"Scalable private learning with pate","author":"Papernot","year":"2018","journal-title":"arXiv:1802.08908"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2942179"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3458864.3466628"},{"key":"ref32","first-page":"2521","article-title":"Shuffled model of differential privacy in federated learning","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Girgis"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.01480"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3216981"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2021.3108434"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3196522"},{"key":"ref37","first-page":"35","article-title":"ABY3: A mixed protocol framework for machine learning","volume-title":"Proc. ACM SIGSAC Conf. Comput. Commun. Secur.","author":"Mohassel"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2018.8465894"},{"key":"ref39","article-title":"Secure computation for machine learning with SPDZ","author":"Chen","year":"2019","journal-title":"arXiv:1901.00329"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426691"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2018.1429274"},{"key":"ref42","article-title":"Distilled one-shot federated learning","author":"Zhou","year":"2020","journal-title":"arXiv:2009.07999"},{"key":"ref43","article-title":"One-shot federated learning for model clustering and learning in heterogeneous environments","author":"Armacki","year":"2022","journal-title":"arXiv:2209.10866"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3192506"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref46","first-page":"2737","article-title":"Asynchronous parallel stochastic gradient for nonconvex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lian"},{"article-title":"Order optimal one-shot distributed learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sharifnassab","key":"ref47"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"volume-title":"The MNIST Database of Handwritten Digits","year":"1998","author":"LeCun","key":"ref49"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"volume-title":"Deep Learning","year":"2016","author":"Goodfellow","key":"ref51"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"volume-title":"Information Theory","year":"1990","author":"Ash","key":"ref53"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.2307\/2533531"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316481"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10475890\/10364741.pdf?arnumber=10364741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T14:00:38Z","timestamp":1711461638000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10364741\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":55,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3344141","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2024,4]]}}}