{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T09:00:04Z","timestamp":1767085204994,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61672444"],"award-info":[{"award-number":["61672444"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001747","name":"HKBU","doi-asserted-by":"publisher","award":["RC-FNRA-IG\/18-19\/SCI\/03","RC-IRCMs\/18-19\/SCI\/01"],"award-info":[{"award-number":["RC-FNRA-IG\/18-19\/SCI\/03","RC-IRCMs\/18-19\/SCI\/01"]}],"id":[{"id":"10.13039\/501100001747","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ITF of ITC of the Government of the Hong Kong SAR","award":["ITS\/339\/18"],"award-info":[{"award-number":["ITS\/339\/18"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/tnnls.2020.3020955","type":"journal-article","created":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T20:01:25Z","timestamp":1600372885000},"page":"4529-4543","source":"Crossref","is-referenced-by-count":14,"title":["An Uplink Communication-Efficient Approach to Featurewise Distributed Sparse Optimization With Differential Privacy"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4110-2068","authenticated-orcid":false,"given":"Jian","family":"Lou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7629-4648","authenticated-orcid":false,"given":"Yiu-ming","family":"Cheung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/72.788640"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2263427"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2382123"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2652478"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2677973"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2905261"},{"key":"ref8","first-page":"1069","article-title":"Differentially private empirical risk minimization","volume":"12","author":"Chaudhuri","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref10","first-page":"11282","article-title":"Private stochastic convex optimization with optimal rates","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bassily"},{"journal-title":"J. Mach. Learn. Res.","article-title":"Private convex empirical risk minimization and high-dimensional regression","author":"Kifer","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00001"},{"key":"ref14","first-page":"488","article-title":"Efficient private empirical risk minimization for high-dimensional learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kasiviswanathan"},{"key":"ref15","first-page":"7564","article-title":"cpsgd: Communication-efficient and differentially-private distributed SGD","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Agarwal"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2728644"},{"key":"ref17","article-title":"Stochastic-sign SGD for federated learning with theoretical guarantees","author":"Jin","year":"2020","journal-title":"arXiv:2002.10940"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2541298"},{"key":"ref19","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Suresh"},{"key":"ref20","first-page":"1509","article-title":"Terngrad: Ternary gradients to reduce communication in distributed deep learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wen"},{"key":"ref21","first-page":"560","article-title":"signSGD: Compressed optimisation for non-convex problems","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bernstein"},{"key":"ref22","first-page":"3252","article-title":"Error feedback fixes signsgd and other gradient compression schemes","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Karimireddy"},{"key":"ref23","first-page":"11450","article-title":"Communication-efficient distributed blockwise momentum SGD with error-feedback","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zheng"},{"key":"ref24","first-page":"14695","article-title":"Qsparse-local-SGD: Distributed SGD with quantization, sparsification and local computations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Basu"},{"key":"ref25","first-page":"1350","article-title":"A collaborative framework for distributed privacy-preserving support vector machine learning","volume-title":"Proc. AMIA Annu. Symp.","author":"Que"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/jamia\/ocv146"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1111\/nyas.13259"},{"key":"ref28","article-title":"Federated learning: Strategies for improving communication efficiency","author":"Kone\u010dn\u00fd","year":"2016","journal-title":"arXiv:1610.05492"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3298981"},{"key":"ref30","article-title":"Advances and open problems in federated learning","author":"Kairouz","year":"2019","journal-title":"arXiv:1912.04977"},{"key":"ref31","first-page":"3025","article-title":"Nearly optimal private lasso","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Talwar"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.54"},{"key":"ref33","first-page":"1548","article-title":"Parallel and distributed block-coordinate frank-wolfe algorithms","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref34","first-page":"53","article-title":"Block-coordinate frank-wolfe optimization for structural SVMs","volume-title":"Int. Conf. Mach. Learn.","author":"Lacoste-julien"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0901-6"},{"issue":"1","key":"ref36","first-page":"2657","article-title":"Distributed coordinate descent method for learning with big data","volume":"17","author":"Richt\u00e1rik","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1190360"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1190361"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11311"},{"key":"ref40","first-page":"427","article-title":"Revisiting frank-wolfe: Projection-free sparse convex optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jaggi"},{"key":"ref41","first-page":"9850","article-title":"Atomo: Communication-efficient learning via atomic sparsification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref42","article-title":"VqSGD: Vector quantized stochastic gradient descent","author":"Gandikota","year":"2019","journal-title":"arXiv:1911.07971"},{"key":"ref43","first-page":"13144","article-title":"Communication-efficient distributed SGD with sketching","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ivkin"},{"key":"ref44","article-title":"Enhancing the privacy of federated learning with sketching","author":"Liu","year":"2019","journal-title":"arXiv:1911.01812"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/sta4.189"},{"key":"ref46","article-title":"Quantized frank-wolfe: Faster optimization, lower communication, and projection free","author":"Zhang","year":"2019","journal-title":"arXiv:1902.06332"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v5i1.625"},{"issue":"1","key":"ref48","first-page":"5279","article-title":"Generalized conditional gradient for sparse estimation","volume":"18","author":"Yu","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref49","first-page":"304","article-title":"Accelerated coordinate descent with arbitrary sampling and best rates for minibatches","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Hanzely"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"volume-title":"Libsvm","year":"2019","key":"ref51"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/9559436\/09199286.pdf?arnumber=9199286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T01:41:17Z","timestamp":1706060477000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9199286\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":51,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2020.3020955","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}