{"id":"https://openalex.org/W4308745142","doi":"https://doi.org/10.1145/3570608","title":"Optimistic No-regret Algorithms for Discrete Caching","display_name":"Optimistic No-regret Algorithms for Discrete Caching","publication_year":2022,"publication_date":"2022-12-01","ids":{"openalex":"https://openalex.org/W4308745142","doi":"https://doi.org/10.1145/3570608"},"language":"en","primary_location":{"id":"doi:10.1145/3570608","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3570608","pdf_url":null,"source":{"id":"https://openalex.org/S4210193547","display_name":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","issn_l":"2476-1249","issn":["2476-1249"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","raw_type":"journal-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/A5059591386","display_name":"Naram Mhaisen","orcid":"https://orcid.org/0000-0003-0211-2666"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Naram Mhaisen","raw_affiliation_strings":["Delft University of Technology, Delft, Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-0211-2666","affiliations":[{"raw_affiliation_string":"Delft University of Technology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057128963","display_name":"Abhishek Sinha","orcid":"https://orcid.org/0000-0001-7220-0691"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Abhishek Sinha","raw_affiliation_strings":["Tata Institute of Fundamental Research, Mumbai, India"],"raw_orcid":"https://orcid.org/0000-0001-7220-0691","affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070393786","display_name":"Georgios S. Paschos","orcid":"https://orcid.org/0000-0002-5922-1612"},"institutions":[{"id":"https://openalex.org/I4210165652","display_name":"National Library of Luxembourg","ror":"https://ror.org/05e0vkr08","country_code":"LU","type":"government","lineage":["https://openalex.org/I4210165652"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Georgios Paschos","raw_affiliation_strings":["Amazon, Luxembourg, Luxembourg"],"raw_orcid":"https://orcid.org/0000-0002-5922-1612","affiliations":[{"raw_affiliation_string":"Amazon, Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I4210165652"]}]},{"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/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"George Iosifidis","raw_affiliation_strings":["Delft University of Technology, Delft, Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-1001-2323","affiliations":[{"raw_affiliation_string":"Delft University of Technology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5059591386"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":1.4245,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82720488,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"6","issue":"3","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9998999834060669,"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":0.9998999834060669,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.8483238220214844},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.822993814945221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8058305978775024},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7284489870071411},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6950134634971619},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6628556847572327},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6437812447547913},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.46860894560813904},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.46014460921287537},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.4392220675945282},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4317966401576996},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.2965613603591919},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2639155387878418},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2224397361278534},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.19114550948143005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11114361882209778}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.8483238220214844},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.822993814945221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8058305978775024},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7284489870071411},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6950134634971619},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6628556847572327},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6437812447547913},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.46860894560813904},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.46014460921287537},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.4392220675945282},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4317966401576996},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.2965613603591919},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2639155387878418},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2224397361278534},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.19114550948143005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11114361882209778},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3570608","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3570608","pdf_url":null,"source":{"id":"https://openalex.org/S4210193547","display_name":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","issn_l":"2476-1249","issn":["2476-1249"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[{"id":"https://openalex.org/G2406092791","display_name":null,"funder_award_id":"101017109","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W1972738071","https://openalex.org/W2000493066","https://openalex.org/W2019054034","https://openalex.org/W2024176568","https://openalex.org/W2039090559","https://openalex.org/W2054852454","https://openalex.org/W2060322444","https://openalex.org/W2061442141","https://openalex.org/W2078205146","https://openalex.org/W2087771945","https://openalex.org/W2090285170","https://openalex.org/W2106248279","https://openalex.org/W2128085284","https://openalex.org/W2141744833","https://openalex.org/W2149107760","https://openalex.org/W2169401877","https://openalex.org/W2171831991","https://openalex.org/W2210543184","https://openalex.org/W2230430964","https://openalex.org/W2279407724","https://openalex.org/W2293239647","https://openalex.org/W2404272329","https://openalex.org/W2496163386","https://openalex.org/W2609285553","https://openalex.org/W2746390786","https://openalex.org/W2800875871","https://openalex.org/W2911361087","https://openalex.org/W2962801070","https://openalex.org/W2962941768","https://openalex.org/W2963531342","https://openalex.org/W2964323557","https://openalex.org/W2966982543","https://openalex.org/W3001957700","https://openalex.org/W3005249494","https://openalex.org/W3005611113","https://openalex.org/W3034766183","https://openalex.org/W3159465427","https://openalex.org/W3162678658","https://openalex.org/W3188959416","https://openalex.org/W3196536943","https://openalex.org/W3208432568","https://openalex.org/W4200531363","https://openalex.org/W4205108433","https://openalex.org/W4205966765","https://openalex.org/W4246219036","https://openalex.org/W4248583813","https://openalex.org/W4255537561","https://openalex.org/W4286571690","https://openalex.org/W6676972989"],"related_works":["https://openalex.org/W3039767703","https://openalex.org/W2031173804","https://openalex.org/W2041820064","https://openalex.org/W2009566782","https://openalex.org/W2147511796","https://openalex.org/W2803610590","https://openalex.org/W1524955365","https://openalex.org/W2100901045","https://openalex.org/W2509523906","https://openalex.org/W2114386333"],"abstract_inverted_index":{"We":[0,150],"take":[1],"a":[2,13,31,37,68,80,85],"systematic":[3],"look":[4],"at":[5],"the":[6,19,25,58,61,99,102,119,132,137,147,153,162,170,173],"problem":[7,154],"of":[8,21,60,82,87,101,134,155,172],"storing":[9],"whole":[10],"files":[11,157],"in":[12,18],"cache":[14],"with":[15,84,98,158],"limited":[16],"capacity":[17],"context":[20],"optimistic":[22,140],"learning,":[23],"where":[24],"caching":[26,75,112,148,156,165],"policy":[27],"has":[28],"access":[29],"to":[30,46,78,117,131],"prediction":[32],"oracle":[33,120],"(provided":[34],"by,":[35],"e.g.,":[36],"Neural":[38],"Network).":[39],"The":[40],"successive":[41],"file":[42],"requests":[43],"are":[44],"assumed":[45],"be":[47],"generated":[48],"by":[49],"an":[50],"adversary,":[51],"and":[52,76,161],"no":[53],"assumption":[54],"is":[55],"made":[56],"on":[57],"accuracy":[59,100],"oracle.":[62,103],"In":[63,126],"this":[64,127],"setting,":[65],"we":[66,129,168],"provide":[67],"universal":[69],"lower":[70],"bound":[71],"for":[72],"prediction-assisted":[73],"online":[74,111],"proceed":[77],"design":[79],"suite":[81],"policies":[83,92,175],"range":[86],"performance-complexity":[88],"trade-offs.":[89],"All":[90],"proposed":[91,174],"offer":[93,122],"sublinear":[94],"regret":[95],"bounds":[96],"commensurate":[97],"Our":[104],"results":[105],"substantially":[106],"improve":[107],"upon":[108],"all":[109],"recently-proposed":[110],"policies,":[113],"which,":[114],"being":[115],"unable":[116],"exploit":[118],"predictions,":[121],"only":[123],"O(\u221aT)":[124],"regret.":[125],"pursuit,":[128],"design,":[130],"best":[133],"our":[135],"knowledge,":[136],"first":[138],"comprehensive":[139],"Follow-the-Perturbed":[141],"leader":[142],"policy,":[143],"which":[144],"generalizes":[145],"beyond":[146],"problem.":[149,166],"also":[151],"study":[152],"different":[159],"sizes":[160],"bipartite":[163],"network":[164],"Finally,":[167],"evaluate":[169],"efficacy":[171],"through":[176],"extensive":[177],"numerical":[178],"experiments":[179],"using":[180],"real-world":[181],"traces.":[182]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}