{"id":"https://openalex.org/W2919316173","doi":"https://doi.org/10.1109/infocom.2019.8737446","title":"Learning to Cache With No Regrets","display_name":"Learning to Cache With No Regrets","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2919316173","doi":"https://doi.org/10.1109/infocom.2019.8737446","mag":"2919316173"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2019.8737446","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070393786","display_name":"Georgios S. Paschos","orcid":"https://orcid.org/0000-0002-5922-1612"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Georgios S. Paschos","raw_affiliation_strings":["France Research Center, Huawei Technologies, Paris"],"affiliations":[{"raw_affiliation_string":"France Research Center, Huawei Technologies, Paris","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062222447","display_name":"Apostolos Destounis","orcid":"https://orcid.org/0000-0003-0420-3430"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Apostolos Destounis","raw_affiliation_strings":["France Research Center, Huawei Technologies, Paris"],"affiliations":[{"raw_affiliation_string":"France Research Center, Huawei Technologies, Paris","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032446417","display_name":"Luigi Vigneri","orcid":"https://orcid.org/0000-0002-2922-3748"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luigi Vigneri","raw_affiliation_strings":["IOTA Foundation, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"IOTA Foundation, Berlin, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044138533","display_name":"George Iosifidis","orcid":"https://orcid.org/0000-0003-1001-2323"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"George Iosifidis","raw_affiliation_strings":["School of Computer Science and Statistics, Trinity College Dublin, Ireland"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Statistics, Trinity College Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5070393786"],"corresponding_institution_ids":["https://openalex.org/I4210123571"],"apc_list":null,"apc_paid":null,"fwci":7.9578,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.97756969,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"243"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12238","display_name":"Green IT and Sustainability","score":0.972100019454956,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.9199889898300171},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7621027827262878},{"id":"https://openalex.org/keywords/hindsight-bias","display_name":"Hindsight bias","score":0.7404733896255493},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7002626657485962},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5858892202377319},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5025975704193115},{"id":"https://openalex.org/keywords/popularity","display_name":"Popularity","score":0.49341216683387756},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.4333987236022949},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41053009033203125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3960421681404114},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36404067277908325},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34265100955963135},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.277673602104187},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21502426266670227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1585099995136261},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.144138365983963}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.9199889898300171},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7621027827262878},{"id":"https://openalex.org/C10347200","wikidata":"https://www.wikidata.org/wiki/Q1960297","display_name":"Hindsight bias","level":2,"score":0.7404733896255493},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7002626657485962},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5858892202377319},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5025975704193115},{"id":"https://openalex.org/C2780586970","wikidata":"https://www.wikidata.org/wiki/Q1357284","display_name":"Popularity","level":2,"score":0.49341216683387756},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.4333987236022949},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41053009033203125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3960421681404114},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36404067277908325},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34265100955963135},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.277673602104187},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21502426266670227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1585099995136261},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.144138365983963},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C180747234","wikidata":"https://www.wikidata.org/wiki/Q23373","display_name":"Cognitive psychology","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2019.8737446","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6100000143051147,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W60189517","https://openalex.org/W177617673","https://openalex.org/W889419725","https://openalex.org/W1481341908","https://openalex.org/W1552828154","https://openalex.org/W1987225815","https://openalex.org/W2024176568","https://openalex.org/W2039090559","https://openalex.org/W2039434047","https://openalex.org/W2041645394","https://openalex.org/W2047251584","https://openalex.org/W2054852454","https://openalex.org/W2077723394","https://openalex.org/W2094087391","https://openalex.org/W2096220631","https://openalex.org/W2148825261","https://openalex.org/W2156588926","https://openalex.org/W2158750015","https://openalex.org/W2164705534","https://openalex.org/W2166482131","https://openalex.org/W2279407724","https://openalex.org/W2292132230","https://openalex.org/W2293085755","https://openalex.org/W2404272329","https://openalex.org/W2495983308","https://openalex.org/W2563036668","https://openalex.org/W2746390786","https://openalex.org/W2773687131","https://openalex.org/W2798019336","https://openalex.org/W2802739963","https://openalex.org/W2803681848","https://openalex.org/W2911361087","https://openalex.org/W2962801070","https://openalex.org/W2963417042","https://openalex.org/W2963531342","https://openalex.org/W2963785501","https://openalex.org/W4254313632","https://openalex.org/W6602391300","https://openalex.org/W6628881136","https://openalex.org/W6681723013","https://openalex.org/W6683011382","https://openalex.org/W6684502749","https://openalex.org/W6750127495"],"related_works":["https://openalex.org/W3197854638","https://openalex.org/W3140454661","https://openalex.org/W4245029315","https://openalex.org/W2139970489","https://openalex.org/W1492315459","https://openalex.org/W1512434910","https://openalex.org/W2540910169","https://openalex.org/W3089780453","https://openalex.org/W3148904318","https://openalex.org/W2998446700"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,36,93,122,140,147],"novel":[4,94],"caching":[5,24,41,83,102],"analysis":[6],"that,":[7],"contrary":[8],"to":[9,49,71,80,139,145],"prior":[10],"work,":[11],"makes":[12],"no":[13,159],"modeling":[14],"assumptions":[15],"for":[16,97,108],"the":[17,23,27,45,50,57,75,86,98,115,126,153],"file":[18],"request":[19,58],"sequence.":[20],"We":[21,90],"cast":[22],"problem":[25],"in":[26,54,74],"framework":[28],"of":[29,38,100,142],"Online":[30,116],"Linear":[31],"optimization":[32],"(OLO),":[33],"and":[34,150],"introduce":[35],"class":[37],"minimum":[39],"regret":[40,99,123],"policies,":[42],"which":[43],"minimize":[44],"losses":[46],"with":[47],"respect":[48],"best":[51],"static":[52],"configuration":[53],"hindsight":[55],"when":[56,85],"model":[59,88],"is":[60,131],"unknown.":[61],"These":[62],"policies":[63],"are":[64,69],"very":[65],"important":[66],"since":[67],"they":[68,78],"robust":[70],"popularity":[72,87],"deviations":[73],"sense":[76],"that":[77,114,124,152],"learn":[79],"adjust":[81],"their":[82],"decisions":[84],"changes.":[89],"first":[91],"prove":[92],"lower":[95,127],"bound":[96],"any":[101],"policy,":[103],"improving":[104],"existing":[105],"OLO":[106],"bounds":[107],"our":[109,137],"setting.":[110],"Then":[111],"we":[112,135],"show":[113,151],"Gradient":[117],"Ascent":[118],"(OGA)":[119],"policy":[120],"guarantees":[121],"matches":[125],"bound,":[128],"hence":[129],"it":[130],"universally":[132],"optimal.":[133],"Finally,":[134],"shift":[136],"attention":[138],"network":[141],"caches":[143],"arranged":[144],"form":[146],"bipartite":[148],"graph,":[149],"Bipartite":[154],"Subgradient":[155],"Algorithm":[156],"(BSA)":[157],"has":[158],"regret.":[160]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":4}],"updated_date":"2026-01-11T23:08:45.486102","created_date":"2025-10-10T00:00:00"}