{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:39:28Z","timestamp":1782405568243,"version":"3.54.5"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFA0703800"],"award-info":[{"award-number":["2018YFA0703800"]}]},{"DOI":"10.13039\/501100002367","name":"Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["YSBR-008"],"award-info":[{"award-number":["YSBR-008"]}],"id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Strategic Priority Research Program of Chinese Academy of Sciences","award":["XDA27000000"],"award-info":[{"award-number":["XDA27000000"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2204240"],"award-info":[{"award-number":["DMS-2204240"]}],"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":[[2024,8]]},"DOI":"10.1109\/tac.2023.3340120","type":"journal-article","created":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T19:28:04Z","timestamp":1701890884000},"page":"5034-5048","source":"Crossref","is-referenced-by-count":12,"title":["Forgetting-Factor Regrets for Online Convex Optimization"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2638-6499","authenticated-orcid":false,"given":"Yuhang","family":"Liu","sequence":"first","affiliation":[{"name":"Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0371-5664","authenticated-orcid":false,"given":"Wenxiao","family":"Zhao","sequence":"additional","affiliation":[{"name":"Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2951-0704","authenticated-orcid":false,"given":"George","family":"Yin","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Connecticut, Storrs, CT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1330","article-title":"Adaptive online learning in dynamic environments","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang","year":"2018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2568161"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34239-7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258179"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/307400.307410"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7503.003.0163"},{"key":"ref9","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. 20th Int. Conf. Mach. Learn.","author":"Zinkevich","year":"2003"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref11","first-page":"1843","article-title":"Projection-free online learning","volume-title":"Proc. 29th Int. Conf. Mach. Learn.","author":"Hazan","year":"2012"},{"key":"ref12","first-page":"814","article-title":"Projection-free online optimization with stochastic gradient: From convexity to submodularity","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Chen","year":"2018"},{"key":"ref13","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","volume-title":"Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Flaxman","year":"2005"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5014-x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273598"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6116"},{"key":"ref18","first-page":"3211","article-title":"Logarithmic regret for adversarial online control","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Foster","year":"2020"},{"key":"ref19","first-page":"10175","article-title":"Logarithmic regret for online control","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Agarwal","year":"2019"},{"key":"ref20","first-page":"402","article-title":"Adaptive algorithms for online convex optimization with long-term constraints","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","author":"Jenatton","year":"2016"},{"issue":"1","key":"ref21","first-page":"2903","article-title":"Online submodular minimization","volume":"13","author":"Hazan","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","volume-title":"Proc. 23rd Conf. Learn. Theory","author":"Agarwal","year":"2010"},{"key":"ref23","first-page":"784","article-title":"Bandit convex optimization: Towards tight bounds","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hazan","year":"2014"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3453721"},{"key":"ref25","first-page":"2047","article-title":"Projection-free bandit convex optimization","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Chen","year":"2019"},{"key":"ref26","first-page":"2196","article-title":"Improved regret bounds for projection-free bandit convex optimization","volume-title":"Proc. 23rd Int. Conf. Artif. Intell. Statist.","author":"Garber","year":"2020"},{"key":"ref27","article-title":"Adaptive algorithms for online decision problems","author":"Hazan","year":"2007","journal-title":"Electron. Colloq. Comput. Complexity"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2017.7963457"},{"key":"ref29","first-page":"1405","article-title":"Strongly adaptive online learning","volume-title":"Proc. 32nd Int. Conf. Mach. Learn.","author":"Foster","year":"2015"},{"key":"ref30","first-page":"5882","article-title":"Dynamic regret of strongly adaptive methods","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Zhang","year":"2018"},{"key":"ref31","first-page":"579","article-title":"Dynamical models and tracking regret in online convex programming","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","author":"Hall","year":"2013"},{"key":"ref32","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. Mach. Learn.","author":"Yang","year":"2016"},{"key":"ref33","first-page":"732","article-title":"Improved dynamic regret for non-degenerate functions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang","year":"2017"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3051871"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i11.17208"},{"key":"ref36","first-page":"199","article-title":"Stochastic multi-armed-bandit problem with non-stationary rewards","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gur","year":"2014"},{"key":"ref37","first-page":"1739","article-title":"Efficient contextual bandits in non-stationary worlds","volume-title":"Proc. 31st Conf. Learn. Theory","author":"Luo","year":"2018"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3261050"},{"key":"ref39","first-page":"1508","article-title":"Bandit convex optimization in non-stationary environments","volume-title":"Proc. 23rd Int. Conf. Artif. Intell. Statist.","author":"Zhao","year":"2020"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/9.402230"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1561\/2200000001"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102464"},{"key":"ref43","volume-title":"Stochastic Approximation and Recursive Algorithms and Applications","author":"Kushner","year":"2003"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1214\/22-AAP1829"},{"key":"ref45","article-title":"A class of constrained stochastic convex optimization algorithms with sparsity","author":"Zhao","year":"2023","journal-title":"Automatica"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729392"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2964200"},{"issue":"3","key":"ref49","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/s10957-010-9737-7","article-title":"Distributed stochastic subgradient projection algorithms for convex optimization","volume":"147","author":"Ram","year":"2010","journal-title":"J. Optim. Theory Appl."},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582255"},{"key":"ref51","first-page":"980","article-title":"Mirror descent meets fixed share (and feels no regret","volume-title":"Proc. 25th Adv. Neural Inf. Process. Syst.","author":"Cesa-bianchi","year":"2012"},{"key":"ref52","first-page":"993","article-title":"Online learning with predictable sequences","volume-title":"Proc. 26th Conf. Learn. Theory","author":"Rakhlin","year":"2013"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/10614334\/10345759-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/10614334\/10345759.pdf?arnumber=10345759","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T05:26:24Z","timestamp":1722317184000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10345759\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":52,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tac.2023.3340120","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":[[2024,8]]}}}