{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T02:31:44Z","timestamp":1730341904066,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T00:00:00Z","timestamp":1654646400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T00:00:00Z","timestamp":1654646400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,8]]},"DOI":"10.23919\/acc53348.2022.9867328","type":"proceedings-article","created":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T20:24:10Z","timestamp":1662409450000},"page":"2104-2109","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Dynamic Regret for Online Convex Optimization with Squared l<sub>2<\/sub> Norm Switching Cost"],"prefix":"10.23919","author":[{"given":"Qingsong","family":"Liu","sequence":"first","affiliation":[{"name":"Tsinghua University,Institute for Interdisciplinary Information Sciences,China"}]},{"given":"Yaoyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University,Institute for Interdisciplinary Information Sciences,China"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Online optimization with predictions and switching costs: Fast algorithms and the fundamental limit","author":"li","year":"2020","journal-title":"IEEE Transactions on Automatic Control"},{"journal-title":"Linear coupling An ultimate unification of gradient and mirror descent","year":"2017","author":"orecchia","key":"ref11"},{"journal-title":"Online gradient descent for online portfolio optimization with transaction costs","year":"2020","author":"restelli","key":"ref12"},{"journal-title":"Online accelerated gradient descent and variational regret bounds","year":"2016","author":"yang","key":"ref13"},{"key":"ref14","first-page":"732","article-title":"Improved dynamic regret for non-degenerate functions","author":"zhang","year":"2017","journal-title":"Advances in neural information processing systems"},{"journal-title":"Improved analysis for dynamic regret of strongly convex and smooth functions","year":"2020","author":"zhao","key":"ref15"},{"key":"ref16","article-title":"Dynamic regret of convex and smooth functions","volume":"33","author":"zhao","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3375788"},{"key":"ref4","first-page":"508","article-title":"Improved path-length regret bounds for bandits","author":"bubeck","year":"2019","journal-title":"Conference on Learning Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref6","first-page":"1875","article-title":"Beyond online balanced descent: An optimal algorithm for smoothed online optimization","volume":"32","author":"goel","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3309697.3331516"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2539948"},{"key":"ref7","first-page":"2504","article-title":"An online algorithm for smoothed regression and lqr control","author":"goel","year":"2019","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"year":"2021","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8431296"}],"event":{"name":"2022 American Control Conference (ACC)","start":{"date-parts":[[2022,6,8]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2022,6,10]]}},"container-title":["2022 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9866948\/9867142\/09867328.pdf?arnumber=9867328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T20:39:19Z","timestamp":1664829559000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9867328\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,8]]},"references-count":17,"URL":"https:\/\/doi.org\/10.23919\/acc53348.2022.9867328","relation":{},"subject":[],"published":{"date-parts":[[2022,6,8]]}}}