{"id":"https://openalex.org/W7128392898","doi":"https://doi.org/10.48550/arxiv.2602.06902","title":"Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory","display_name":"Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory","publication_year":2026,"publication_date":"2026-02-06","ids":{"openalex":"https://openalex.org/W7128392898","doi":"https://doi.org/10.48550/arxiv.2602.06902"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.06902","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036642346","display_name":"Emmanuel Esposito","orcid":"https://orcid.org/0000-0002-4748-3279"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qiu, Hao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046896574","display_name":"Andrew Jacobsen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jacobsen, Andrew","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123032540","display_name":"Hao Qiu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Esposito, Emmanuel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125421229","display_name":"Mengxiao Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Mengxiao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9210000038146973,"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.9210000038146973,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.03530000150203705,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.007499999832361937,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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","display_name":"Regret","score":0.91839998960495},{"id":"https://openalex.org/keywords/movement","display_name":"Movement (music)","score":0.5752000212669373},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5134000182151794},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5121999979019165},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.454800009727478},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44859999418258667},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.414900004863739}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.91839998960495},{"id":"https://openalex.org/C2780226923","wikidata":"https://www.wikidata.org/wiki/Q929848","display_name":"Movement (music)","level":2,"score":0.5752000212669373},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5419999957084656},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5134000182151794},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5121999979019165},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.454800009727478},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44859999418258667},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.414900004863739},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4088999927043915},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40700000524520874},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.3944999873638153},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3555000126361847},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.3449999988079071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3370000123977661},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3174999952316284},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C155745195","wikidata":"https://www.wikidata.org/wiki/Q1164179","display_name":"Comparator","level":3,"score":0.2624000012874603}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.06902","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.06902","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.06902","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.06902","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,50],"paper,":[2],"we":[3,17,107],"study":[4],"dynamic":[5,46,87,170],"regret":[6,47,88,160,171],"in":[7,89,158,166,173],"unconstrained":[8],"online":[9],"convex":[10],"optimization":[11],"(OCO)":[12],"with":[13,112,117],"movement":[14,25,130,156],"costs.":[15],"Specifically,":[16],"generalize":[18],"the":[19,24,43,59,63,72,79,92,102,138,152],"standard":[20],"setting":[21,141],"by":[22],"allowing":[23],"cost":[26],"coefficients":[27],"$\u03bb_t$":[28],"to":[29],"vary":[30],"arbitrarily":[31],"over":[32,66],"time.":[33],"Our":[34,76],"main":[35],"contribution":[36],"is":[37,58,71,143,150],"a":[38,133,163],"novel":[39,134],"algorithm":[40],"that":[41,122,142,151],"establishes":[42],"first":[44],"comparator-adaptive":[45,169],"bound":[48,161],"for":[49,83,97,137],"setting,":[51],"guaranteeing":[52],"$\\widetilde{\\mathcal{O}}(\\sqrt{(M^2+MP_T)(T+\\sum_t":[53],"\u03bb_t)})$":[54],"regret,":[55],"where":[56,95],"$P_T$":[57],"path":[60],"length":[61],"of":[62,104,144],"comparator":[64,74],"sequence":[65],"$T$":[67],"rounds":[68],"and":[69,86,115],"$M$":[70],"maximal":[73],"norm.":[75],"result":[77],"recovers":[78],"optimal":[80,168],"adaptive":[81],"rates":[82],"both":[84,123,174],"static":[85],"OCO":[90,111,116],"as":[91],"special":[93],"case":[94],"$\u03bb_t=0$":[96],"all":[98],"rounds.":[99],"To":[100],"demonstrate":[101],"versatility":[103],"our":[105,159],"results,":[106],"consider":[108],"two":[109],"applications:":[110],"delayed":[113,139],"feedback":[114,140],"time-varying":[118,129],"memory.":[119],"We":[120],"show":[121],"problems":[124],"can":[125],"be":[126],"translated":[127],"into":[128],"costs,":[131],"establishing":[132],"reduction":[135],"specifically":[136],"independent":[145],"interest.":[146],"A":[147],"crucial":[148],"observation":[149],"first-order":[153],"dependence":[154],"on":[155],"costs":[157],"plays":[162],"key":[164],"role":[165],"enabling":[167],"guarantees":[172],"settings.":[175]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-10T00:00:00"}