{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T02:53:02Z","timestamp":1774147982639,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Digital Futures and VR","award":["2019-05319"],"award-info":[{"award-number":["2019-05319"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tsp.2025.3553355","type":"journal-article","created":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T19:03:45Z","timestamp":1742411025000},"page":"1518-1531","source":"Crossref","is-referenced-by-count":4,"title":["Locally Differentially Private Online Federated Learning With Correlated Noise"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4611-9424","authenticated-orcid":false,"given":"Jiaojiao","family":"Zhang","sequence":"first","affiliation":[{"name":"Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5484-1134","authenticated-orcid":false,"given":"Linglingzhi","family":"Zhu","sequence":"additional","affiliation":[{"name":"H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5530-2714","authenticated-orcid":false,"given":"Dominik","family":"Fay","sequence":"additional","affiliation":[{"name":"Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2237-2580","authenticated-orcid":false,"given":"Mikael","family":"Johansson","sequence":"additional","affiliation":[{"name":"Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9683589"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CDC49753.2023.10383924"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3565287.3610257"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2024.3356257"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3171065"},{"key":"ref7","first-page":"5213","article-title":"Practical and private (deep) learning without sampling or shuffling","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kairouz","year":"2021"},{"key":"ref8","first-page":"5910","article-title":"Improved differential privacy for SGD via optimal private linear operators on adaptive streams","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Denisov","year":"2022"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP48485.2024.10447047"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3317644"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"ref13","first-page":"74856","article-title":"(Amplified) Banded matrix factorization: A unified approach to private training","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Choquette-Choo","year":"2023"},{"key":"ref14","first-page":"35761","article-title":"Gradient descent with linearly correlated noise: Theory and applications to differential privacy","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Koloskova","year":"2023"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch183"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806787"},{"key":"ref17","first-page":"14654","article-title":"The price of differential privacy under continual observation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jain","year":"2023"},{"key":"ref18","article-title":"Federated learning with formal differential privacy guarantees","author":"McMahan","year":"2022","journal-title":"Google AI Blog"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0398-x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2794384"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2020.2976273"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3329832"},{"key":"ref23","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Artif. Intell. Statist.","author":"McMahan","year":"2017"},{"key":"ref24","first-page":"845","article-title":"Online non-convex learning: Following the perturbed leader is optimal","author":"Suggala","year":"2020","journal-title":"Algorithmic Learn. Theory"},{"key":"ref25","first-page":"235","article-title":"Online learning with non-convex losses and non-stationary regret","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Gao","year":"2018"},{"key":"ref26","article-title":"Improved dynamic regret for non-degenerate functions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Zhang","year":"2017"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton49937.2022.9929356"},{"key":"ref28","first-page":"637","article-title":"Improving dynamic regret in distributed online mirror descent using primal and dual information","volume-title":"Proc. Learn. Dyn. Control Conf.","author":"Eshraghi","year":"2022"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3293417"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174426"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1100-9"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-017-9366-8"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1232-1"},{"key":"ref34","article-title":"Gradient methods for convex minimization: Better rates under weaker conditions","author":"Zhang"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"ref36","article-title":"Interplay between optimization and generalization of stochastic gradient descent with covariance noise","author":"Wen"},{"key":"ref37","article-title":"(Nearly) optimal algorithms for private online learning in full-information and bandit settings","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Thakurta","year":"2013"},{"key":"ref38","first-page":"429","article-title":"Federated optimization in heterogeneous networks","volume-title":"Proc. Mach. Learn. Syst.","volume":"2","author":"Li","year":"2020"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2024.e27176"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_24"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/10807692\/10934741.pdf?arnumber=10934741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T04:49:49Z","timestamp":1744260589000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10934741\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/tsp.2025.3553355","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}