{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:12:36Z","timestamp":1767989556937,"version":"3.49.0"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"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":[[2019,4]]},"DOI":"10.1109\/infocom.2019.8737446","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T00:35:56Z","timestamp":1560818156000},"page":"235-243","source":"Crossref","is-referenced-by-count":66,"title":["Learning to Cache With No Regrets"],"prefix":"10.1109","author":[{"given":"Georgios S.","family":"Paschos","sequence":"first","affiliation":[]},{"given":"Apostolos","family":"Destounis","sequence":"additional","affiliation":[]},{"given":"Luigi","family":"Vigneri","sequence":"additional","affiliation":[]},{"given":"George","family":"Iosifidis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1117\/12.774903"},{"key":"ref32","article-title":"Projection onto the capped simplex","author":"wang","year":"2015","journal-title":"arXiv preprint arXiv 1503"},{"key":"ref31","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.2.145"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844939"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2012.6193511"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524380"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2810156.2810168"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITC.2014.6932936"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844985"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2787979"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2596042"},{"key":"ref16","article-title":"Regret minimization for online buffering problems using the weighted majority algorithm","author":"sascha","year":"2010","journal-title":"COLT"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2493246.2493247"},{"key":"ref18","article-title":"Competitive caching with machine learning advice","author":"lykouris","year":"2018","journal-title":"ICML"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3125719.3125730"},{"key":"ref28","author":"hazan","year":"2006","journal-title":"Efficient algorithms for online convex optimization and their applications"},{"key":"ref4","article-title":"A versatile and accurate approximation for LRU cache performance","author":"fricker","year":"2012","journal-title":"ITC"},{"key":"ref27","article-title":"Optimal strategies and minimax lower bounds for online convex games","author":"abernethy","year":"2008","journal-title":"COLT"},{"key":"ref3","article-title":"Online convex optimization and no-regret learning: Algorithms, guarantees and applications","author":"belmega","year":"2018","journal-title":"arXiv 1804 04529"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316962","author":"billingsley","year":"1999","journal-title":"Convergence of Probability Measures"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2541468.2541470"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"ref2","author":"shalev-shwartz","year":"2012","journal-title":"Online Learning and Online Convex Optimization"},{"key":"ref9","author":"borodin","year":"1998","journal-title":"Online Computation and Competitive Analysis"},{"key":"ref1","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"ICML"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2351796"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901483"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.23919\/WIOPT.2018.8362806"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195469"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844982"},{"key":"ref26","article-title":"Optimal geographic caching in cellular networks","author":"blaszczyszyn","year":"2014","journal-title":"arXiv preprint arXiv 1409 7626"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2017.11.015"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","location":"Paris, France","start":{"date-parts":[[2019,4,29]]},"end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8732929\/8737365\/08737446.pdf?arnumber=8737446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:15:01Z","timestamp":1657854901000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8737446\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/infocom.2019.8737446","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}