{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:22:21Z","timestamp":1775578941003,"version":"3.50.1"},"reference-count":70,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1912702"],"award-info":[{"award-number":["ECCS-1912702"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2106293"],"award-info":[{"award-number":["CCF-2106293"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2215088"],"award-info":[{"award-number":["CCF-2215088"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2219487"],"award-info":[{"award-number":["CNS-2219487"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2334449"],"award-info":[{"award-number":["CCF-2334449"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2422312"],"award-info":[{"award-number":["CNS-2422312"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1109\/tac.2024.3519938","type":"journal-article","created":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T14:58:35Z","timestamp":1734533915000},"page":"4238-4253","source":"Crossref","is-referenced-by-count":1,"title":["Local Differential Privacy for Decentralized Online Stochastic Optimization With Guaranteed Optimality and Convergence Speed"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7836-6238","authenticated-orcid":false,"given":"Ziqin","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Clemson University, Clemson, SC, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8600-0276","authenticated-orcid":false,"given":"Yongqiang","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Clemson University, Clemson, SC, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2950779"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2607691"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"issue":"1","key":"ref6","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":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2650563"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3126253"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134077"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63076-8_2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3523273"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2855169"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2968876"},{"key":"ref15","first-page":"1","article-title":"Slalom: Fast, verifiable and private execution of neural networks in trusted hardware","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Tramer","year":"2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.191"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3198030"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2728644"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2902731"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2020.109253"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2022.3219765"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1561\/9781601988195"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2684464.2684480"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2614100"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2541298"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2751458"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2931068"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2023.3264932"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2024.111514"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2024.3352328"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2023.3264164"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2024.3351068"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2023.3272968"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2794384"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2018.2797806"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TICPS.2023.3291667"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2020.2976273"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126531"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.127184"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2024.3379387"},{"key":"ref42","first-page":"5796","article-title":"Improving the privacy and accuracy of ADMM-based distributed algorithms","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhang","year":"2018"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3059427"},{"key":"ref44","first-page":"10561","article-title":"Local differential privacy for regret minimization in reinforcement learning","volume-title":"Proc. Int. Conf. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Garcelon","year":"2021"},{"key":"ref45","first-page":"1","article-title":"Locally differentially private decentralized stochastic bilevel optimization with guaranteed convergence accuracy","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen","year":"2024"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/jstsp.2025.3526081"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/tac.2024.3482977"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3378679.3394533"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413764"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3244092"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2818081"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2209984"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298712"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2648041"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2685559"},{"key":"ref57","first-page":"1","article-title":"Can gradient clipping mitigate label noise?","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Menon","year":"2020"},{"key":"ref58","first-page":"13773","article-title":"Understanding gradient clipping in private SGD: A geometric perspective","volume-title":"Proc. Int. Conf. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Chen","year":"2020"},{"key":"ref59","first-page":"1","article-title":"On the convergence of FedAvg on Non-IID data","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Li","year":"2019"},{"key":"ref60","first-page":"1","article-title":"Achieving linear speedup with partial worker participation in non-IID federated learning","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Yang","year":"2021"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3174187"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1137\/060657418"},{"key":"ref63","first-page":"26818","article-title":"A stochastic newton algorithm for distributed convex optimization","volume-title":"Proc. Int. Conf. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Bullins","year":"2021"},{"key":"ref64","first-page":"1","article-title":"Smooth loss functions for deep top-k classification","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Berrada","year":"2018"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.02.022"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2022.07.233"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/tac.2024.3488504"},{"key":"ref68","article-title":"UCI machine learning repository","author":"Dua","year":"2007"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref70","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/11060003\/10806815-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/9\/11060003\/10806815.pdf?arnumber=10806815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T21:07:06Z","timestamp":1769807226000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10806815\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":70,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tac.2024.3519938","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7]]}}}