{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:48:34Z","timestamp":1762508914529,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["101017109 DAEMON"],"award-info":[{"award-number":["101017109 DAEMON"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"publisher","award":["16\/IA\/4610"],"award-info":[{"award-number":["16\/IA\/4610"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1109\/tnet.2022.3222404","type":"journal-article","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T18:39:08Z","timestamp":1674067148000},"page":"1935-1949","source":"Crossref","is-referenced-by-count":8,"title":["Lazy Lagrangians for Optimistic Learning With Budget Constraints"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1675-7764","authenticated-orcid":false,"given":"Daron","family":"Anderson","sequence":"first","affiliation":[{"name":"School of Computer Science and Statistics, Trinity College Dublin (TCD), Dublin 2, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1001-2323","authenticated-orcid":false,"given":"George","family":"Iosifidis","sequence":"additional","affiliation":[{"name":"Department of Software Technology, Delft University of Technology (TU Delft), Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4056-4014","authenticated-orcid":false,"given":"Douglas J.","family":"Leith","sequence":"additional","affiliation":[{"name":"School of Computer Science and Statistics, Trinity College Dublin (TCD), Dublin 2, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"402","article-title":"Adaptive algorithms for online convex optimization with long-term constraints","author":"jenatton","year":"2016","journal-title":"Proc ICML"},{"key":"ref35","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":"ref12","first-page":"2503","article-title":"Trading regret for efficiency: Online convex optimization with long term constraints","volume":"13","author":"mahdavi","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3379484"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00022"},{"key":"ref37","first-page":"1","article-title":"Online convex optimization with continuous switching constraint","author":"wang","year":"2021","journal-title":"Proc NeurIPS"},{"key":"ref14","first-page":"1","article-title":"Online convex optimization for cumulative constraints","author":"yuan","year":"2018","journal-title":"Proc NeurIPS"},{"key":"ref36","first-page":"1","article-title":"A low complexity algorithm with O(?T) regret and O (1) constraint violations for online convex optimization with long term constraints","volume":"21","author":"yu","year":"2020","journal-title":"J Mach Learn"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3072423"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2869583"},{"key":"ref11","first-page":"1","article-title":"Online convex optimization with stochastic constraints","author":"yu","year":"2017","journal-title":"Proc NIPS"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901464"},{"key":"ref10","first-page":"3280","article-title":"Safety-aware algorithms for adversarial contextual bandit","author":"sun","year":"2017","journal-title":"Proc ICML"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745854"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2968424"},{"key":"ref1","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc ICML"},{"key":"ref17","first-page":"1","article-title":"Competitive caching with machine learned advice","author":"lykouris","year":"2018","journal-title":"Proc ICML"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2860281"},{"key":"ref16","first-page":"2885","article-title":"Online convex optimization with perturbed constraints: Optimal rates against stronger benchmarks","author":"valls","year":"2020","journal-title":"Proc AISTATS"},{"key":"ref38","article-title":"Online convex optimization with time-varying constraints","author":"neely","year":"2017","journal-title":"arXiv 1702 04783"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.114"},{"key":"ref18","first-page":"1","article-title":"Improving online algorithms via ML predictions","author":"kumar","year":"2018","journal-title":"Proc NeurIPS"},{"key":"ref24","first-page":"9530","article-title":"Online linear optimization with many hints","author":"bhaskara","year":"2020","journal-title":"Proc NeurIPS"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1795"},{"key":"ref23","first-page":"822","article-title":"Online learning with imperfect hints","author":"bhaskara","year":"2020","journal-title":"Proc ICML"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref26","first-page":"848","article-title":"Accelerating online convex optimization via adaptive prediction","author":"mohri","year":"2016","journal-title":"Proc AISTATS"},{"key":"ref25","first-page":"1","article-title":"Optimization, learning, and games with predictable sequences","author":"rakhlin","year":"2013","journal-title":"Proc NIPS"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887322"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2021.102240"},{"key":"ref22","first-page":"1","article-title":"Online learning with a hint","author":"dekel","year":"2017","journal-title":"Proc NIPS"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1889(94)00819-4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72927-3_36"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1561\/1300000001"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2947591"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.1900394"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2954503"},{"key":"ref8","first-page":"3944","article-title":"Cautious regret minimization: Online optimization with long-term budget constraints","author":"liakopoulos","year":"2019","journal-title":"Proc ICML"},{"key":"ref7","first-page":"569","article-title":"Online learning with sample path constraints","volume":"10","author":"mannor","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3030883"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737600"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.04.016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-79995-2"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884653"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/10286433\/10021291.pdf?arnumber=10021291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T20:03:18Z","timestamp":1699300998000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10021291\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":46,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2022.3222404","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2023,10]]}}}