{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:05:21Z","timestamp":1783577121904,"version":"3.55.0"},"reference-count":72,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004147","name":"Tsinghua University Dushi Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004147","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tnet.2024.3495522","type":"journal-article","created":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T19:16:09Z","timestamp":1732302969000},"page":"463-478","source":"Crossref","is-referenced-by-count":3,"title":["Smoothed Online Decision Making in Communication: Algorithms and Applications"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-5016-4281","authenticated-orcid":false,"given":"Qingsong","family":"Liu","sequence":"first","affiliation":[{"name":"Institute for Interdisciplinary Information Sciences (IIIS), Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8776-9562","authenticated-orcid":false,"given":"Zhuoran","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7979-4269","authenticated-orcid":false,"given":"Zhixuan","family":"Fang","sequence":"additional","affiliation":[{"name":"Institute for Interdisciplinary Information Sciences (IIIS), Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/5GWF.2019.8911626"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3222404"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155469"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3224427"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref6","first-page":"2818","article-title":"Power of hints for online learning with movement costs","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Bhaskara"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3392143"},{"key":"ref8","article-title":"Temporal variability in implicit online learning","author":"Campolongo","year":"2020","journal-title":"arXiv:2006.07503"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.3048844"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745854"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901464"},{"key":"ref12","first-page":"1574","article-title":"Smoothed online convex optimization in high dimensions via online balanced descent","volume-title":"Proc. 31st Conf. Learn. Theory","author":"Chen"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3322205.3311087"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132772"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2810156.2810168"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3466772.3467031"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2023.3294366"},{"key":"ref19","first-page":"1875","article-title":"Beyond online balanced descent: An optimal algorithm for smoothed online optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Goel"},{"key":"ref20","first-page":"2504","article-title":"An online algorithm for smoothed regression and LQR control","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Goel"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/UCC48980.2020.00042"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.9781\/ijimai.2021.03.004"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3390\/s21041308"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3025904"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901467"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/tsc.2024.3451163"},{"key":"ref27","first-page":"763","article-title":"An ensemble of classifiers for coping with recurring contexts in data streams","volume-title":"Proc. 18th Eur. Conf. Artif. Intell. (ECAI)","author":"Katakis"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2021.107379"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2539948"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2869874"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CSNT54456.2022.9787645"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/NCC55593.2022.9806728"},{"key":"ref33","first-page":"14520","article-title":"Leveraging predictions in smoothed online convex optimization via gradient-based algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Li"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8431296"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3040249"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MCOMSTD.0001.2200001"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228901"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2024.3425617"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.23919\/WiOpt56218.2022.9930570"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2021.102240"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2018.2828608"},{"key":"ref42","first-page":"525","article-title":"Follow-the-regularized-leader and mirror descent: Equivalence theorems and L1 regularization","volume-title":"Proc. 14th Int. Conf. Artif. Intell. Statist.","author":"McMahan"},{"issue":"1","key":"ref43","first-page":"3117","article-title":"A survey of algorithms and analysis for adaptive online learning","volume":"18","author":"McMahan","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2008.4.425"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517925"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2208828.2208847"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2914695"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2968424"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737446"},{"key":"ref50","article-title":"Online gradient descent for online portfolio optimization with transaction costs","author":"Restelli","year":"2020"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2023.102371"},{"key":"ref52","article-title":"Online optimization with memory and competitive control","author":"Shi","year":"2020","journal-title":"arXiv:2002.05318"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3053910"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3350990"},{"key":"ref55","first-page":"1953","article-title":"A Bayesian approach for bandit online optimization with switching cost","volume-title":"Uncertainty in Artificial Intelligence","author":"Shi","year":"2023"},{"key":"ref56","first-page":"529","article-title":"Learning relaxed belady for content distribution network caching","volume-title":"Proc. 17th USENIX Symp. Netw. Syst. Design Implement. (NSDI)","author":"Song"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.3037674"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.enpol.2005.07.012"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3416013.3426458"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3188285"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488698"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26430"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3068201"},{"key":"ref64","first-page":"13599","article-title":"Revisiting smoothed online learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref65","article-title":"Adaptive online learning in dynamic environments","author":"Zhang","year":"2018","journal-title":"arXiv:1810.10815"},{"key":"ref66","first-page":"732","article-title":"Improved dynamic regret for non-degenerate functions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref67","volume-title":"Bregman Divergence and Mirror Descent","author":"Zhang","year":"2024"},{"key":"ref68","first-page":"390","article-title":"A simple online algorithm for competing with dynamic comparators","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Zhang"},{"key":"ref69","article-title":"Improved analysis for dynamic regret of strongly convex and smooth functions","author":"Zhao","year":"2020","journal-title":"arXiv:2006.05876"},{"key":"ref70","first-page":"12510","article-title":"Dynamic regret of convex and smooth functions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhao"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/3375788"},{"key":"ref72","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. 20th Int. Conf. Mach. Learn.","author":"Zinkevich"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/10969151\/10765802.pdf?arnumber=10765802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T04:47:51Z","timestamp":1744951671000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10765802\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":72,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2024.3495522","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}