{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T22:52:19Z","timestamp":1778799139956,"version":"3.51.4"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62473292"],"award-info":[{"award-number":["62473292"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62088101"],"award-info":[{"award-number":["62088101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shanghai Municipal Science and Technology Major Project","award":["2021SHZDZX0100"],"award-info":[{"award-number":["2021SHZDZX0100"]}]},{"DOI":"10.13039\/501100001809","name":"Joint Funds of the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U25A20458"],"award-info":[{"award-number":["U25A20458"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tsp.2026.3673260","type":"journal-article","created":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:40:10Z","timestamp":1773348010000},"page":"1357-1367","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Regret for Byzantine-Robust Online Federated Learning"],"prefix":"10.1109","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-0134-6929","authenticated-orcid":false,"given":"Haibao","family":"Tian","sequence":"first","affiliation":[{"name":"Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4108-6304","authenticated-orcid":false,"given":"Qiyong","family":"He","sequence":"additional","affiliation":[{"name":"Department of Control Science and Engineering, Tongji University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4996-4583","authenticated-orcid":false,"given":"Zhihai","family":"Qu","sequence":"additional","affiliation":[{"name":"Department of Control Science and Engineering, Tongji University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4938-0468","authenticated-orcid":false,"given":"Xiuxian","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Control Science and Engineering, College of Electronics and Information Engineering, State Key Laboratory of Autonomous Intelligent Unmanned System, Frontiers Science Center for Intelligent Autonomous Systems, Ministry of Education, Shanghai Research Institute for Intelligent Autonomous Systems, Shanghai Institute of Intelligent Science and Technology, Tongji University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"McMahan","year":"2017"},{"key":"ref2","article-title":"Federated learning for mobile keyboard prediction","author":"Hard","year":"2018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41746-020-00323-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref5","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zinkevich","year":"2003"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2024.3392361"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3129809"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2022.3216326"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/drones7100613"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006060"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3316672"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3340028"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9683589"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref17","first-page":"48","article-title":"Improved dynamic regret for non-degenerate functions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Zhang","year":"2017"},{"key":"ref18","first-page":"48","article-title":"Improved analysis for dynamic regret of strongly convex and smooth functions","volume":"30","author":"Zhao","year":"2021","journal-title":"Learn. Dyn. Control"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2024.3514802"},{"key":"ref20","article-title":"Explaining and harnessing adversarial examples","author":"Goodfellow","year":"2014"},{"key":"ref21","first-page":"5311","article-title":"Learning from history for byzantine robust optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Karimireddy","year":"2021"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3300629"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/17M1126680"},{"key":"ref24","article-title":"Scaffold: Stochastic controlled averaging for on-device federated learning","author":"Karimireddy","year":"2019"},{"key":"ref25","article-title":"Byzantine-robust learning on heterogeneous datasets via bucketing","author":"Karimireddy","year":"2020"},{"key":"ref26","article-title":"Fast convergence of stochastic gradient descent under a strong growth condition","author":"Schmidt","year":"2013"},{"key":"ref27","first-page":"3325","article-title":"The power of interpolation: Understanding the effectiveness of SGD in modern over-parametrized learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ma","year":"2018"},{"key":"ref28","article-title":"Painless stochastic gradient: Interpolation, line-search, and convergence rates","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Vaswani","year":"2019"},{"key":"ref29","first-page":"1375","article-title":"Fast and furious convergence: Stochastic second order methods under interpolation","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Meng","year":"2020"},{"key":"ref30","article-title":"Resilience in collaborative optimization: Redundant and independent cost functions","author":"Gupta","year":"2020"},{"key":"ref31","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yin","year":"2018"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3008139"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref34","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Blanchard","year":"2017"},{"key":"ref35","article-title":"Phocas: Dimensional byzantine-resilient stochastic gradient descent","author":"Xie","year":"2018"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/670"},{"key":"ref37","first-page":"1195","article-title":"Fast and faster convergence of SGD for over-parameterized models and an accelerated perceptron","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Vaswani","year":"2019"},{"key":"ref38","first-page":"34900","article-title":"Byzantine robustness and partial participation can be achieved at once: Just clip gradient differences","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"37","author":"Malinovsky","year":"2024"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3012952"},{"key":"ref40","article-title":"Optimal complexity in byzantine-robust distributed stochastic optimization with data heterogeneity","author":"Shi","year":"2025"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/11345506\/11432972.pdf?arnumber=11432972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T04:56:13Z","timestamp":1775537773000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11432972\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/tsp.2026.3673260","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}