{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:55:08Z","timestamp":1730278508863,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"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,11,1]]},"DOI":"10.1109\/itw54588.2022.9965906","type":"proceedings-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:47:00Z","timestamp":1670446020000},"page":"684-689","source":"Crossref","is-referenced-by-count":1,"title":["Universal Caching"],"prefix":"10.1109","author":[{"given":"Ativ","family":"Joshi","sequence":"first","affiliation":[{"name":"Tata Institute of Fundamental Research,School of Technology and Computer Science,Mumbai,India,400 005"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Sinha","sequence":"additional","affiliation":[{"name":"Tata Institute of Fundamental Research,School of Technology and Computer Science,Mumbai,India,400 005"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055501"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/234752.234753"},{"key":"ref10","article-title":"Mirror descent meets fixed share (and feels no regret)","volume":"25","author":"cesa-bianchi","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref11","first-page":"3477","article-title":"Minimax regret of switching-constrained online convex optimization: No phase transition","volume":"33","author":"chen","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref12","article-title":"Adaptive algorithms for online decision problems","volume":"14","author":"hazan","year":"2007","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"ref13","first-page":"1405","article-title":"Strongly adaptive online learning","author":"daniely","year":"2015","journal-title":"International Conference on Machine Learning"},{"key":"ref14","first-page":"5882","article-title":"Dynamic regret of strongly adaptive methods","author":"zhang","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34106-9_24"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref17","first-page":"398","article-title":"Online optimization: Competing with dynamic comparators","author":"jadbabaie","year":"2015","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965906"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.144706"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970342465X"},{"key":"ref4","article-title":"LeadCache: Regret-optimal caching in networks","volume":"34","author":"paria","year":"2021","journal-title":"Advances in neural information processing systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737446"},{"article-title":"Lower bounds for small depth arithmetic and boolean circuits","year":"2001","author":"shpilka","key":"ref27"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref29","first-page":"979","article-title":"Small-loss bounds for online learning with partial information","author":"lykouris","year":"2018","journal-title":"Conference on Learning Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517925"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3491047"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1561\/0100000104"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394189"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007424614876"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261817"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729988"},{"key":"ref21","first-page":"342","article-title":"k-experts-Online Policies and Fundamental Limits","author":"mukhopadhyay","year":"2022","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9196-9"},{"journal-title":"Sampling Algorithms","year":"2006","author":"till\u00e9","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1556"}],"event":{"name":"2022 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2022,11,1]]},"location":"Mumbai, India","end":{"date-parts":[[2022,11,9]]}},"container-title":["2022 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9965754\/9965755\/09965906.pdf?arnumber=9965906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:42:31Z","timestamp":1672083751000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9965906\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/itw54588.2022.9965906","relation":{},"subject":[],"published":{"date-parts":[[2022,11,1]]}}}