{"id":"https://openalex.org/W4416961310","doi":"https://doi.org/10.1109/ton.2025.3636929","title":"Efficient and Optimal No-Regret Caching Under Partial Observation","display_name":"Efficient and Optimal No-Regret Caching Under Partial Observation","publication_year":2025,"publication_date":"2025-12-03","ids":{"openalex":"https://openalex.org/W4416961310","doi":"https://doi.org/10.1109/ton.2025.3636929"},"language":"en","primary_location":{"id":"doi:10.1109/ton.2025.3636929","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ton.2025.3636929","pdf_url":null,"source":{"id":"https://openalex.org/S5407042750","display_name":"IEEE Transactions on Networking","issn_l":"2998-4157","issn":["2998-4157"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Networking","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-05400041","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079858792","display_name":"Younes Ben Mazziane","orcid":"https://orcid.org/0000-0002-0887-9596"},"institutions":[{"id":"https://openalex.org/I198415970","display_name":"Universit\u00e9 d'Avignon et des Pays de Vaucluse","ror":"https://ror.org/00mfpxb84","country_code":"FR","type":"education","lineage":["https://openalex.org/I198415970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Younes Ben Mazziane","raw_affiliation_strings":["Avignon University, Avignon, France"],"raw_orcid":"https://orcid.org/0000-0002-0887-9596","affiliations":[{"raw_affiliation_string":"Avignon University, Avignon, France","institution_ids":["https://openalex.org/I198415970"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002267438","display_name":"Francescomaria Faticanti","orcid":"https://orcid.org/0000-0002-3075-313X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]},{"id":"https://openalex.org/I4387153239","display_name":"Centre de Recherche en Informatique, Signal et Automatique de Lille","ror":"https://ror.org/05vrs3189","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I2279609970","https://openalex.org/I4387153239","https://openalex.org/I7454413"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Francescomaria Faticanti","raw_affiliation_strings":["Univ. Lille, Inria, CNRS UMR 9189 CRIStAL, Lille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. Lille, Inria, CNRS UMR 9189 CRIStAL, Lille, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I2279609970","https://openalex.org/I4387153239"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075282032","display_name":"Sara Alouf","orcid":"https://orcid.org/0009-0009-6643-0568"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sara Alouf","raw_affiliation_strings":["Inria, Université Côte d’Azur, Sophia Antipolis, France","NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)"],"raw_orcid":"https://orcid.org/0009-0009-6643-0568","affiliations":[{"raw_affiliation_string":"Inria, Université Côte d’Azur, Sophia Antipolis, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085721523","display_name":"Giovanni Neglia","orcid":"https://orcid.org/0000-0001-8779-0620"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Giovanni Neglia","raw_affiliation_strings":["Inria, Université Côte d’Azur, Sophia Antipolis, France","NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)"],"raw_orcid":"https://orcid.org/0000-0001-8779-0620","affiliations":[{"raw_affiliation_string":"Inria, Université Côte d’Azur, Sophia Antipolis, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"NEO - Network Engineering and Operations (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34757812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":null,"first_page":"2020","last_page":"2030"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.46209999918937683,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.46209999918937683,"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/T11478","display_name":"Caching and Content Delivery","score":0.20489999651908875,"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.17669999599456787,"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/cache","display_name":"Cache","score":0.6747000217437744},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.6500999927520752},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6383000016212463},{"id":"https://openalex.org/keywords/false-sharing","display_name":"False sharing","score":0.4878000020980835},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4496000111103058},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4275999963283539},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.4259999990463257},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4239000082015991},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.42089998722076416},{"id":"https://openalex.org/keywords/observability","display_name":"Observability","score":0.40860000252723694}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6948999762535095},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6747000217437744},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.6500999927520752},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6383000016212463},{"id":"https://openalex.org/C5165142","wikidata":"https://www.wikidata.org/wiki/Q5432732","display_name":"False sharing","level":5,"score":0.4878000020980835},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4496000111103058},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4275999963283539},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.4259999990463257},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4239000082015991},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.42089998722076416},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.40860000252723694},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.3799000084400177},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3617999851703644},{"id":"https://openalex.org/C68649174","wikidata":"https://www.wikidata.org/wiki/Q1379116","display_name":"Base station","level":2,"score":0.3488999903202057},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34060001373291016},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.33730000257492065},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.33649998903274536},{"id":"https://openalex.org/C2777851325","wikidata":"https://www.wikidata.org/wiki/Q7094102","display_name":"Online model","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.3294999897480011},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.29910001158714294},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.29739999771118164},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29269999265670776},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27720001339912415},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.27379998564720154},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.2703000009059906},{"id":"https://openalex.org/C152361515","wikidata":"https://www.wikidata.org/wiki/Q181328","display_name":"Bernoulli's principle","level":2,"score":0.26100000739097595}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ton.2025.3636929","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ton.2025.3636929","pdf_url":null,"source":{"id":"https://openalex.org/S5407042750","display_name":"IEEE Transactions on Networking","issn_l":"2998-4157","issn":["2998-4157"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Networking","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-05400041v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-05400041","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Networking, 2025, pp.1-11. ⟨10.1109/TON.2025.3636929⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-05400041v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-05400041","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Networking, 2025, pp.1-11. ⟨10.1109/TON.2025.3636929⟩","raw_type":"info:eu-repo/semantics/article"},"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":{"Online":[0],"learning":[1,144],"algorithms":[2,30],"have":[3],"been":[4],"successfully":[5],"used":[6],"to":[7,101,130,164,182],"design":[8],"caching":[9,112,184,205],"policies":[10,206],"with":[11,20,118,186,203],"sublinear":[12],"regret":[13,153],"in":[14,48,109,133],"the":[15,25,60,72,81,103,111,121,127,131,141,167,171,200,209],"total":[16],"number":[17,172],"of":[18,38,62,68,123,173],"requests,":[19],"no":[21],"statistical":[22],"assumption":[23],"about":[24],"request":[26,117,217],"sequence.":[27],"Most":[28],"existing":[29],"involve":[31],"computationally":[32],"expensive":[33],"operations":[34],"and":[35,66,80,207,215],"require":[36],"knowledge":[37],"all":[39,69],"past":[40],"requests.":[41,174],"However,":[42],"this":[43,85],"may":[44],"not":[45],"be":[46],"feasible":[47],"practical":[49],"scenarios":[50],"such":[51],"asfemtocaching,":[52],"where":[53],"a":[54,89,94,116,137,187,192],"base":[55],"station":[56],"(BS)":[57],"jointly":[58],"decides":[59],"content":[61],"many":[63],"edge":[64,128],"caches":[65,79,129],"visibility":[67],"requests":[70,124],"at":[71],"BS":[73,132],"requires":[74],"constant":[75],"communication":[76],"between":[77],"these":[78],"BS.":[82],"To":[83],"capture":[84],"constraint,":[86],"we":[87,99,176],"study":[88],"single":[90],"cache":[91,168],"problem":[92],"under":[93],"more":[95],"restrictive":[96],"setting,":[97],"that":[98,148,178],"refer":[100],"as":[102],"Bernoulli":[104],"Partial":[105],"Observability":[106],"(BPO)":[107],"model,":[108],"which":[110],"policy":[113,180],"only":[114],"observes":[115],"probability$p$,":[119],"reflecting":[120],"fraction":[122],"forwarded":[125],"from":[126],"thefemtocachingexample.":[134],"We":[135],"propose":[136],"policy,":[138],"based":[139],"on":[140],"classic":[142,204],"online":[143],"algorithm":[145],"Follow-the-Perturbed-Leader":[146],"(FPL),":[147],"achieves":[149],"an":[150],"asymptotically":[151],"optimal":[152],"bound":[154],"of$\\mathcal":[155],"{O}(\\sqrt":[156],"{CT/p})$under":[157],"BPO":[158],"in$\\mathcal":[159],"{O}(1)$amortized":[160],"time":[161],"complexity":[162],"as$T$goes":[163],"infinity,":[165],"where$C$is":[166],"size":[169],"and$T$is":[170],"Moreover,":[175],"show":[177],"our":[179],"extends":[181],"bipartite":[183],"albeit":[185],"sublinear$\\alpha":[188],"$-regret":[189],"for$\\alpha":[190],"=1-1/e$and":[191],"higher":[193],"computational":[194],"cost.":[195],"The":[196],"experimental":[197],"evaluation":[198],"compares":[199],"proposed":[201,210],"solution":[202],"validates":[208],"approach":[211],"using":[212],"both":[213],"synthetic":[214],"real-world":[216],"traces.":[218]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-12-03T00:00:00"}