{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:25Z","timestamp":1773377605728,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517925","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1546-1551","source":"Crossref","is-referenced-by-count":17,"title":["Online Caching with Optimal Switching Regret"],"prefix":"10.1109","author":[{"given":"Samrat","family":"Mukhopadhyay","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Madras,Dept. of Electrical Engineering,Chennai,India,600036"}]},{"given":"Abhishek","family":"Sinha","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Madras,Dept. of Electrical Engineering,Chennai,India,600036"}]}],"member":"263","reference":[{"key":"ref10","first-page":"132","article-title":"Regret minimization for online buffering problems using the weighted majority algorithm","author":"geulen","year":"2010","journal-title":"COLT"},{"key":"ref11","first-page":"949","article-title":"Follow the leader with dropout perturbations","author":"van erven","year":"2014","journal-title":"Conference on Learning Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2428253"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"ref15","first-page":"333","article-title":"Competitive ratio vs regret minimization: achieving the best of both worlds","author":"daniely","year":"2019","journal-title":"Algorithmic Learning Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606818"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2557804"},{"key":"ref19","article-title":"No-regret caching via online mirror descent","author":"salem","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref4","article-title":"Competitive online algorithms","author":"albers","year":"1996","journal-title":"CiteSeer"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2394482"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394189"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref8","article-title":"Caching in networks without regret","author":"paria","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737446"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/301453.301487"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"ref1","volume":"18","author":"dan","year":"1990","journal-title":"An Approximate Analysis of the LRU and FIFO Buffer Replacement Schemes"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref22","article-title":"Learning to cache and caching to learn: Regret analysis of caching algorithms","author":"bura","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2541468.2541470"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3219617.3219627"},{"key":"ref23","article-title":"Online caching with optimal switching regret","author":"mukhopadhyay","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref26","first-page":"943","article-title":"Improved strongly adaptive online learning using coin betting","author":"jun","year":"2017","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref25","year":"0","journal-title":"Cdn trace"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517925.pdf?arnumber=9517925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:33Z","timestamp":1773347673000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517925\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517925","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}