{"id":"https://openalex.org/W4380669397","doi":"https://doi.org/10.1145/3578338.3593561","title":"Optimistic No-regret Algorithms for Discrete Caching","display_name":"Optimistic No-regret Algorithms for Discrete Caching","publication_year":2023,"publication_date":"2023-06-13","ids":{"openalex":"https://openalex.org/W4380669397","doi":"https://doi.org/10.1145/3578338.3593561"},"language":"en","primary_location":{"id":"doi:10.1145/3578338.3593561","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3578338.3593561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","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/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"],"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"],"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"],"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"],"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":0.2009,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47143859,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"69","last_page":"70"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"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.9950000047683716,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.8237228393554688},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8158800601959229},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7742066383361816},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7384765148162842},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6938401460647583},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6268119812011719},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5305604934692383},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.5134516954421997},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4879748225212097},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.4565408527851105},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.4514469504356384},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4367419183254242},{"id":"https://openalex.org/keywords/random-oracle","display_name":"Random oracle","score":0.418615460395813},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35026663541793823},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.34284737706184387},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33616185188293457},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3143867552280426},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.1609659492969513},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11247751116752625},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.11031597852706909},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.08662813901901245}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.8237228393554688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8158800601959229},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7742066383361816},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7384765148162842},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6938401460647583},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6268119812011719},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5305604934692383},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.5134516954421997},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4879748225212097},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.4565408527851105},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.4514469504356384},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4367419183254242},{"id":"https://openalex.org/C94284585","wikidata":"https://www.wikidata.org/wiki/Q228184","display_name":"Random oracle","level":4,"score":0.418615460395813},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35026663541793823},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.34284737706184387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33616185188293457},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3143867552280426},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.1609659492969513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11247751116752625},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.11031597852706909},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08662813901901245},{"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/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.0},{"id":"https://openalex.org/C203062551","wikidata":"https://www.wikidata.org/wiki/Q201339","display_name":"Public-key cryptography","level":3,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/3578338.3593561","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3578338.3593561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/17"}],"awards":[{"id":"https://openalex.org/G7448753368","display_name":null,"funder_award_id":"101017109 (DAEMON)","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":2,"referenced_works":["https://openalex.org/W4286571690","https://openalex.org/W4308745142"],"related_works":["https://openalex.org/W2061075966","https://openalex.org/W2147122795","https://openalex.org/W3147501184","https://openalex.org/W2167303720","https://openalex.org/W2046128376","https://openalex.org/W2268996566","https://openalex.org/W2363672756","https://openalex.org/W2109715593","https://openalex.org/W3161817247","https://openalex.org/W2077899426"],"abstract_inverted_index":{"We":[0,57,118],"take":[1],"a":[2,13,31,59,71,76],"systematic":[3],"look":[4],"at":[5],"the":[6,19,25,52,55,90,93,101,106,115,121,130],"problem":[7,122],"of":[8,21,54,73,78,92,103,123],"storing":[9],"whole":[10],"files":[11,125],"in":[12,18],"cache":[14],"with":[15,75,89,126],"limited":[16],"capacity":[17],"context":[20],"optimistic":[22,108],"learning,":[23],"where":[24],"caching":[26,66,116,124,133],"policy":[27],"has":[28],"access":[29],"to":[30,40,69,100],"prediction":[32],"oracle.":[33,56,94],"The":[34],"successive":[35],"file":[36],"requests":[37],"are":[38],"assumed":[39],"be":[41],"generated":[42],"by":[43],"an":[44],"adversary,":[45],"and":[46,67,129],"no":[47],"assumption":[48],"is":[49],"made":[50],"on":[51],"accuracy":[53,91],"provide":[58],"universal":[60],"lower":[61],"bound":[62],"for":[63],"prediction-assisted":[64],"online":[65],"proceed":[68],"design":[70],"suite":[72],"policies":[74,83],"range":[77],"performance-complexity":[79],"trade-offs.":[80],"All":[81],"proposed":[82],"offer":[84],"sublinear":[85],"regret":[86],"bounds":[87],"commensurate":[88],"In":[95],"this":[96],"pursuit,":[97],"we":[98],"design,":[99],"best":[102],"our":[104],"knowledge,":[105],"first":[107],"Follow-the-Perturbed":[109],"leader":[110],"policy,":[111],"which":[112],"generalizes":[113],"beyond":[114],"problem.":[117,134],"also":[119],"study":[120],"different":[127],"sizes":[128],"bipartite":[131],"network":[132]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-23T05:10:03.516525","created_date":"2025-10-10T00:00:00"}