{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:43:05Z","timestamp":1782834185427,"version":"3.54.5"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":"publisher","award":["62003243"],"award-info":[{"award-number":["62003243"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Municipal Science and Technology Major Project","award":["2021SHZDZX0100"],"award-info":[{"award-number":["2021SHZDZX0100"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tsp.2024.3392361","type":"journal-article","created":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T20:13:52Z","timestamp":1713903232000},"page":"2160-2172","source":"Crossref","is-referenced-by-count":4,"title":["Online Optimization Under Randomly Corrupted Attacks"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4996-4583","authenticated-orcid":false,"given":"Zhihai","family":"Qu","sequence":"first","affiliation":[{"name":"Department of Control Science and Engineering, College of Electronics and Information Engineering, Shanghai Research Institute for Intelligent Autonomous Systems, and Shanghai Institute of Intelligent Science and Technology, Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"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, Shanghai Research Institute for Intelligent Autonomous Systems, and Shanghai Institute of Intelligent Science and Technology, Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5097-9972","authenticated-orcid":false,"given":"Li","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Control Science and Engineering, College of Electronics and Information Engineering, Shanghai Research Institute for Intelligent Autonomous Systems, and Shanghai Institute of Intelligent Science and Technology, Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4299-0471","authenticated-orcid":false,"given":"Xinlei","family":"Yi","sequence":"additional","affiliation":[{"name":"Lab for Information & Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref2","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. 20th Int. Conf. Int. Conf. Mach. Learn.","author":"Zinkevich","year":"2003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref4","first-page":"449","article-title":"Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient","volume-title":"Proc. 33rd Int. Conf. Int. Conf. Mach. Learn.,","volume":"48","author":"Yang","year":"2016"},{"key":"ref5","first-page":"235","article-title":"Online learning with non-convex losses and non-stationary regret","volume-title":"Proc. 21st Int. Conf. Artif. Intell. Statist.","volume":"84","author":"Gao","year":"2018"},{"key":"ref6","first-page":"579","article-title":"Dynamical models and tracking regret in online convex programming","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","volume":"28","author":"Hall","year":"2013"},{"key":"ref7","first-page":"4160","article-title":"Parameter-free mirror descent","volume-title":"Proc. 35th Conf. Learn. Theory","author":"Jacobsen","year":"2022"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2964200"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3222404"},{"key":"ref10","first-page":"6544","article-title":"No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Hsieh","year":"2022"},{"key":"ref11","first-page":"5118","article-title":"Learning general halfspaces with adversarial label noise via online gradient descent","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","volume":"162","author":"Diakonikolas","year":"2022"},{"key":"ref12","first-page":"5002","article-title":"Optimistic online mirror descent for bridging stochastic and adversarial online convex optimization","volume-title":"Proc. 40th Int. Conf. Mach. Learn.","volume":"202","author":"Chen","year":"2023"},{"key":"ref13","first-page":"691","article-title":"Between stochastic and adversarial online convex optimization: Improved regret bounds via smoothness","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Sachs","year":"2022"},{"key":"ref14","article-title":"Explaining and harnessing adversarial examples","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Goodfellow","year":"2015"},{"key":"ref15","first-page":"8635","article-title":"A little is enough: Circumventing defenses for distributed learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Baruch","year":"2019"},{"key":"ref16","first-page":"261","article-title":"Fall of empires: Breaking Byzantine-tolerant SGD by inner product manipulation","volume-title":"Proc. 35th Uncertainty Artif. Intell. Conf.","volume":"115","author":"Xie","year":"2020"},{"key":"ref17","first-page":"118","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":"ref18","doi-asserted-by":"publisher","DOI":"10.23919\/ACC50511.2021.9483127"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3185885"},{"key":"ref20","first-page":"5429","article-title":"Adversarial online learning with noise","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","volume":"97","author":"Resler","year":"2019"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-018-5758-5"},{"key":"ref22","article-title":"Online learning under adversarial corruptions","author":"Awasthi","year":"2021"},{"key":"ref23","first-page":"415","article-title":"Optimal strategies and minimax lower bounds for online convex games","volume-title":"Proc. 19th Annu. Conf. Comput. Learn. Theory","author":"Abernethy","year":"2008"},{"key":"ref24","first-page":"1764","article-title":"Online learning: Stochastic, constrained, and smoothed adversaries","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"24","author":"Rakhlin","year":"2011"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-022-3777-y"},{"key":"ref26","first-page":"732","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","first-page":"48","article-title":"Improved analysis for dynamic regret of strongly convex and smooth functions","volume-title":"Proc. 3rd Conf. Learn. Dyn. Control","volume":"144","author":"Zhao","year":"2021"},{"key":"ref28","first-page":"1330","article-title":"Adaptive online learning in dynamic environments","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Zhang","year":"2018"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref30","first-page":"6.1","article-title":"Online optimization with gradual variations","volume-title":"Proc. 25th Annu. Conf. Learn. Theory","volume":"23","author":"Chiang","year":"2012"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3340028"},{"key":"ref32","first-page":"3521","article-title":"The hidden vulnerability of distributed learning in Byzantium","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Mhamdi","year":"2018"},{"key":"ref33","first-page":"6893","article-title":"Zeno: Distributed stochastic gradient descent with suspicion-based fault-tolerance","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Xie","year":"2019"},{"key":"ref34","first-page":"10495","article-title":"Zeno++: Robust fully asynchronous SGD","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Xie","year":"2020"},{"key":"ref35","article-title":"Byzantine-robust learning on heterogeneous datasets via bucketing","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Karimireddy","year":"2022"},{"key":"ref36","first-page":"1232","article-title":"Fixing by mixing: A recipe for optimal Byzantine ML under heterogeneity","volume-title":"Proc. 26th Int. Conf. Artif. Intell. Statist.","volume":"206","author":"Allouah","year":"2023"},{"key":"ref37","first-page":"23951","article-title":"A robust phased elimination algorithm for corruption-tolerant Gaussian process bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Bogunovic","year":"2022"},{"key":"ref38","first-page":"39834","article-title":"Corruption-robust algorithms with uncertainty weighting for nonlinear contextual bandits and Markov decision processes","volume-title":"Proc. 40th Int. Conf. Mach. Learn.","volume":"202","author":"Ye","year":"2023"},{"key":"ref39","first-page":"18","article-title":"Learning in non-convex games with an optimization oracle","volume-title":"Proc. 32nd Conf. Learn. Theory","volume":"99","author":"Agarwal","year":"2019"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/BF02124750"},{"key":"ref41","article-title":"MobileNets: Efficient convolutional neural networks for mobile vision applications","author":"Howard","year":"2017"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/10347386\/10507162.pdf?arnumber=10507162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T19:12:24Z","timestamp":1714763544000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10507162\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/tsp.2024.3392361","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}