{"id":"https://openalex.org/W7213909148","doi":"https://doi.org/10.48550/arxiv.2609.21262","title":"Optimal Regret for Online Storage Control via Cumulative Policies","display_name":"Optimal Regret for Online Storage Control via Cumulative Policies","publication_year":2026,"publication_date":"2026-09-18","ids":{"openalex":"https://openalex.org/W7213909148","doi":"https://doi.org/10.48550/arxiv.2609.21262"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.21262","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.21262","pdf_url":"https://arxiv.org/pdf/2609.21262","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.21262","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039770127","display_name":"Kamiar Asgari","orcid":"https://orcid.org/0000-0002-2399-6432","observed_orcids":["https://orcid.org/0000-0002-2399-6432"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Asgari, Kamiar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029961049","display_name":"Michael J. Neely","orcid":"https://orcid.org/0000-0003-3524-1587","observed_orcids":["https://orcid.org/0000-0003-3524-1587"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neely, Michael J.","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":true,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9404000043869019,"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.9404000043869019,"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/T12288","display_name":"Optimization and Search Problems","score":0.04659999907016754,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.003800000064074993,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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-bounds","display_name":"regret bounds","score":0.699999988079071},{"id":"https://openalex.org/keywords/retention-coefficient","display_name":"retention coefficient","score":0.8059999942779541},{"id":"https://openalex.org/keywords/convex-cost-functions","display_name":"convex cost functions","score":0.6389999985694885},{"id":"https://openalex.org/keywords/minimax-regret","display_name":"minimax regret","score":0.5699999928474426},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7910000085830688}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8343999981880188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5666000247001648},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5461000204086304},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5281000137329102},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42969998717308044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.428600013256073},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.4081999957561493},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.38769999146461487},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.37779998779296875},{"id":"https://openalex.org/C203479927","wikidata":"https://www.wikidata.org/wiki/Q5165939","display_name":"Controller (irrigation)","level":2,"score":0.34689998626708984},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3443000018596649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33809998631477356},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.3296000063419342},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C2780958618","wikidata":"https://www.wikidata.org/wiki/Q945621","display_name":"Average cost","level":2,"score":0.3231000006198883},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3181999921798706},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3181999921798706},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.3142000138759613},{"id":"https://openalex.org/C42866809","wikidata":"https://www.wikidata.org/wiki/Q466764","display_name":"Fixed cost","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.2635999917984009}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.21262","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.21262","pdf_url":"https://arxiv.org/pdf/2609.21262","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.21262","doi":"https://doi.org/10.48550/arxiv.2609.21262","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.21262","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.21262","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.21262","pdf_url":"https://arxiv.org/pdf/2609.21262","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7213909148.pdf","grobid_xml":"https://content.openalex.org/works/W7213909148.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W7211986539"],"related_works":["https://openalex.org/W7211986539","https://openalex.org/W3093300558","https://openalex.org/W3006564690","https://openalex.org/W1990323885","https://openalex.org/W4309801641","https://openalex.org/W3127031965","https://openalex.org/W2971091362","https://openalex.org/W7215118581","https://openalex.org/W2970857099","https://openalex.org/W2946061571"],"abstract_inverted_index":{"We":[0],"study":[1],"online":[2],"control":[3],"of":[4,72],"a":[5,61,116],"scalar":[6],"storage":[7],"system":[8],"with":[9],"adversarial":[10],"nonnegative":[11],"arrivals,":[12],"known":[13],"retention":[14,78],"coefficient,":[15],"and":[16,23,32,39,60,80,102,107,143,150,162],"convex":[17],"costs":[18],"depending":[19],"on":[20],"both":[21],"state":[22],"action.":[24],"Each":[25],"action":[26],"must":[27],"respect":[28],"current":[29,37],"resource":[30],"availability":[31],"is":[33,70,134],"chosen":[34],"before":[35],"the":[36,45,83,90,130,151,159],"arrival":[38],"cost":[40,81,153],"function":[41],"are":[42,155],"revealed.":[43],"For":[44,76],"existing":[46],"simplex":[47,140],"disturbance-action":[48],"policy":[49,73,94,141,167],"class,":[50,97],"we":[51],"give":[52],"an":[53],"exact":[54],"reparameterization":[55],"by":[56],"cumulative":[57],"allocation":[58],"fractions":[59],"decay-weighted":[62],"projected":[63],"subgradient":[64],"update.":[65],"The":[66],"resulting":[67],"regret":[68,88,133],"bound":[69,119],"independent":[71],"memory":[74,101],"length.":[75],"fixed":[77,92],"coefficient":[79],"constants,":[82],"controller":[84],"achieves":[85],"$O(\\sqrt":[86],"T)$":[87,100],"against":[89,120],"best":[91],"infinite-memory":[93,145],"in":[95],"this":[96],"using":[98],"$O(\\log":[99],"arithmetic":[103],"operations":[104],"per":[105],"round":[106],"one":[108],"cost-subgradient":[109],"query.":[110],"A":[111],"storage-specific":[112],"block":[113],"construction":[114],"gives":[115],"matching":[117],"lower":[118],"every":[121,138],"causal":[122],"feasible":[123],"controller,":[124],"including":[125],"randomized":[126],"controllers.":[127],"Writing":[128],"$\u03c4=(1-\u03b1)^{-1}$,":[129],"minimax":[131],"expected":[132],"$\u0398(\\sqrt":[135],"T\\min\\{T,\u03c4\\}^{3/2})$":[136],"for":[137,165],"finite-memory":[139],"class":[142],"its":[144],"extension,":[146],"when":[147],"$\u03b1\\in[1/2,1)$,":[148],"$T\\ge4$,":[149],"positive":[152],"constants":[154],"fixed.":[156],"This":[157],"identifies":[158],"joint":[160],"horizon":[161],"retention-time":[163],"dependence":[164],"these":[166],"benchmarks.":[168]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-22T00:00:00"}