{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:26:03Z","timestamp":1783614363295,"version":"3.55.0"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"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"],"award-info":[{"award-number":["101017109"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Mobile Comput."],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1109\/tmc.2023.3317943","type":"journal-article","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T17:51:39Z","timestamp":1695318699000},"page":"5949-5965","source":"Crossref","is-referenced-by-count":10,"title":["Online Caching With no Regret: Optimistic Learning via Recommendations"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0211-2666","authenticated-orcid":false,"given":"Naram","family":"Mhaisen","sequence":"first","affiliation":[{"name":"Department of Software Technology, Delft University of Technology, Delft, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"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, Delft, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4056-4014","authenticated-orcid":false,"given":"Douglas","family":"Leith","sequence":"additional","affiliation":[{"name":"School of Computer Science and Statistics, Trinity College Dublin, Dublin, The Ireland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.23919\/IFIPNetworking55013.2022.9829806","article-title":"Online caching with optimistic learning","author":"Mhaisen","year":"2022"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844939"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/69.755618"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(01)00409-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2013.6495773"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1453175.1453203"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/301464.301487"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2541468.2541470"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITC.2014.6932936"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524380"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2810156.2810168"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844985"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2787979"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2022.3214075"},{"key":"ref18","first-page":"132","article-title":"Regret minimization for online buffering problems using the weighted majority algorithm","volume-title":"Proc. 23rd Conf. Learn. Theory","author":"Geulen"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737446"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3491047"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500487"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3392143"},{"key":"ref23","first-page":"4435","article-title":"LeadCache: Regret-optimal caching in networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Paria"},{"key":"ref24","first-page":"529","article-title":"Learning relaxed belady for content distribution network caching","volume-title":"Proc. 17th USENIX Symp. Netw. Syst. Des. Implementation","author":"Song"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3485983.3494855"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2843948"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2365952.2365958"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2018.2831690"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3024644"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3038849"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3109727"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2022.3142809"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2956041"},{"key":"ref34","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zinkevich"},{"key":"ref35","article-title":"Introduction to online convex optimization","author":"Hazan","year":"2019"},{"key":"ref36","first-page":"345","article-title":"Online metric algorithms with untrusted predictions","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Antoniadis"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3447579"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2465533"},{"key":"ref39","first-page":"5299","article-title":"Online learning with a hint","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Dekel"},{"key":"ref40","first-page":"822","article-title":"Online learning with imperfect hints","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bhaskara"},{"key":"ref41","first-page":"3066","article-title":"Optimization, learning, and games with predictable sequences","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Rakhlin"},{"key":"ref42","first-page":"848","article-title":"Accelerating online convex optimization via adaptive prediction","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Mohri"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5014-x"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2933780"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.23919\/WIOPT.2018.8362806"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1842733.1842736"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref48","first-page":"3944","article-title":"Cautious regret minimization: Online optimization with long-term budget constraints","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liakopoulos"},{"key":"ref49","first-page":"2885","article-title":"Online convex optimization with perturbed constraints: Optimal rates against stronger benchmarks","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Valls"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2964200"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3093619"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584803"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.09.022"},{"issue":"4","key":"ref54","first-page":"19:1","article-title":"The MovieLens datasets: History and context","volume":"5","author":"Harper","year":"2015","journal-title":"ACM Trans. Interact. Intell. Syst."},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1561\/0100000104"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7537172"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.3036876"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901483"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844982"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/WoWMoM49955.2020.00052"},{"key":"ref61","doi-asserted-by":"crossref","DOI":"10.1109\/ICC42927.2021.9500487","article-title":"No-regret caching via online mirror descent","author":"Si Salem","year":"2021"},{"key":"ref62","first-page":"5877","article-title":"Dynamic regret of strongly adaptive methods","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhang"},{"issue":"1","key":"ref63","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":"ref64","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997"},{"key":"ref65","article-title":"A modern introduction to online learning","author":"Orabona","year":"2019"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1795"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2968424"},{"key":"ref68","article-title":"Amazon elastic CDN service - ElastiCache","year":"2022"},{"key":"ref69","article-title":"The elastic CDN solution","year":"2014"},{"key":"ref70","first-page":"569","article-title":"Online learning with sample path constraints","volume":"10","author":"Mannor","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"ref71","article-title":"Learning the best expert efficiently","author":"Anderson","year":"2019"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401167"},{"key":"ref73","article-title":"online-caching","author":"Mhaisen","year":"2022"},{"key":"ref74","article-title":"Projection onto the capped simplex","author":"Wang","year":"2015"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7755\/10491282\/10258320.pdf?arnumber=10258320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T19:56:06Z","timestamp":1712692566000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10258320\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":74,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2023.3317943","relation":{},"ISSN":["1536-1233","1558-0660","2161-9875"],"issn-type":[{"value":"1536-1233","type":"print"},{"value":"1558-0660","type":"electronic"},{"value":"2161-9875","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5]]}}}