{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:12:09Z","timestamp":1768281129062,"version":"3.49.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"French Government through the \u201cPlan de Relance\u201d and \u201cProgramme d\u2019Investissements d\u2019Avenir"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/ton.2025.3636929","type":"journal-article","created":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:41:12Z","timestamp":1764787272000},"page":"2020-2030","source":"Crossref","is-referenced-by-count":0,"title":["Efficient and Optimal No-Regret Caching Under Partial Observation"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0887-9596","authenticated-orcid":false,"given":"Younes Ben","family":"Mazziane","sequence":"first","affiliation":[{"name":"Avignon University, Avignon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francescomaria","family":"Faticanti","sequence":"additional","affiliation":[{"name":"Univ. Lille, Inria, CNRS UMR 9189 CRIStAL, Lille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6643-0568","authenticated-orcid":false,"given":"Sara","family":"Alouf","sequence":"additional","affiliation":[{"name":"Inria, Université Côte d’Azur, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8779-0620","authenticated-orcid":false,"given":"Giovanni","family":"Neglia","sequence":"additional","affiliation":[{"name":"Inria, Université Côte d’Azur, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/12.677225"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.09.013"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2698164"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2017.3641638"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(77)80014-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2541468.2541470"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524380"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737446"},{"key":"ref9","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. 20th Int. Conf. Mach. Learn.","author":"Zinkevich"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3605209"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking55013.2022.9829806"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3410048.3410057"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3105880"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM55787.2022.9964551"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2024.110341"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3149001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/VCC60689.2023.10474978"},{"key":"ref20","first-page":"1281","article-title":"Follow the leader if you can, Hedge if you must","author":"Rooij","year":"2016","journal-title":"JMLR"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517925"},{"key":"ref22","first-page":"807","article-title":"Online linear optimization via smoothing","volume-title":"Proc. Conf. Learn. theory","volume":"35","author":"Abernethy"},{"key":"ref23","first-page":"1034","article-title":"Following the perturbed leader for online structured learning","volume-title":"Proc. ICML","author":"Cohen"},{"key":"ref24","first-page":"2197","article-title":"Fighting bandits with a new kind of smoothness","volume-title":"Proc. NIPS","volume":"28","author":"Abernethy"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref26","first-page":"1","article-title":"Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits","volume":"17","author":"Neu","year":"2016","journal-title":"JMLR"},{"key":"ref27","article-title":"An online gradient-based caching policy with logarithmic complexity and regret guarantees","author":"Carra","year":"2024","journal-title":"arXiv:2405.01263"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3606376.3593561"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2023.3317943"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10229044"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3420758"},{"key":"ref32","first-page":"134","article-title":"Adaptive selective sampling for online prediction with experts","volume-title":"Proc. NeurIPS","author":"Castro"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847729"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3149371"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901483"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844982"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901467"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3547353.3522632"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2968424"},{"key":"ref41","first-page":"4435","article-title":"LeadCache: Regret-optimal caching in networks","volume-title":"Proc. NeurIPS","author":"Paria"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749260"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11317935\/11273899.pdf?arnumber=11273899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:00:09Z","timestamp":1768255209000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11273899\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/ton.2025.3636929","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}