{"id":"https://openalex.org/W7163222723","doi":"https://doi.org/10.48550/arxiv.2606.01342","title":"Towards Optimal Robustness in Learning-Augmented Paging","display_name":"Towards Optimal Robustness in Learning-Augmented Paging","publication_year":2026,"publication_date":"2026-05-31","ids":{"openalex":"https://openalex.org/W7163222723","doi":"https://doi.org/10.48550/arxiv.2606.01342"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.01342","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01342","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.01342","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137628626","display_name":"Peng Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Peng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137647851","display_name":"Hailiang Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Hailiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137672740","display_name":"Xueyan Tang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tang, Xueyan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137688690","display_name":"Yixuan Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yixuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055284175","display_name":"Shuiguang Deng","orcid":"https://orcid.org/0000-0001-5015-6095"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Deng, Shuiguang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9240999817848206,"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/T12288","display_name":"Optimization and Search Problems","score":0.9240999817848206,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.01850000023841858,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.006800000090152025,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/robustness","display_name":"Robustness (evolution)","score":0.8888999819755554},{"id":"https://openalex.org/keywords/paging","display_name":"Paging","score":0.8758000135421753},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5569999814033508},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.41749998927116394},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.39739999175071716}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.8888999819755554},{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.8758000135421753},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7498000264167786},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5569999814033508},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.41749998927116394},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.39739999175071716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39149999618530273},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3273000121116638},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3253999948501587},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.29589998722076416},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2572000026702881}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.01342","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01342","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.01342","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01342","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Learning-augmented":[0],"paging":[1,96],"has":[2],"been":[3],"extensively":[4],"studied":[5],"in":[6,44,87],"recent":[7],"years.":[8],"A":[9],"key":[10],"advantage":[11],"over":[12],"naive":[13],"ML-based":[14],"approaches":[15],"is":[16],"\\emph{bounded":[17],"robustness},":[18],"which":[19,83,107],"guarantees":[20],"worst-case":[21],"performance":[22],"even":[23],"when":[24],"predictions":[25],"are":[26],"inaccurate,":[27],"making":[28],"these":[29],"algorithms":[30,97,118],"valuable":[31],"for":[32,144],"real-world":[33],"systems.":[34],"Prior":[35],"work":[36],"achieves":[37,135],"robustness":[38,113,138],"bounds":[39],"of":[40,78,111],"$2H_k":[41],"+":[42,148],"O(1)$":[43],"the":[45,52,79,88,103,109,126,136],"randomized":[46],"setting,":[47],"leaving":[48],"a":[49,75,100,131],"gap":[50],"to":[51,63,140],"optimal":[53],"competitive":[54],"ratio":[55],"$H_k$.":[56],"In":[57],"this":[58,65],"paper,":[59],"we":[60,92,129],"study":[61],"how":[62],"close":[64],"gap.":[66],"We":[67],"begin":[68],"by":[69,125],"reviewing":[70],"online":[71],"optimality":[72],"and":[73,98,114],"proving":[74],"new":[76,132],"property":[77],"latest":[80],"$H_k$-competitive":[81],"algorithm,":[82],"facilitates":[84],"our":[85],"analysis":[86],"learning-augmented":[89,95,145],"setting.":[90],"Then,":[91],"review":[93],"existing":[94],"introduce":[99],"unifying":[101],"primitive,":[102],"\\emph{relative":[104],"prediction":[105],"budget},":[106],"captures":[108],"essence":[110],"establishing":[112],"reveals":[115],"that":[116,134],"prior":[117],"either":[119],"overuse":[120],"or":[121],"underutilize":[122],"predictions.":[123],"Guided":[124],"above":[127],"analysis,":[128],"develop":[130],"framework":[133],"best-possible":[137],"up":[139],"an":[141],"additive":[142],"constant":[143],"paging:":[146],"$H_k":[147],"O(1)$.":[149],"Experiments":[150],"further":[151],"demonstrate":[152],"strong":[153],"practical":[154],"performance.":[155]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-03T00:00:00"}