{"id":"https://openalex.org/W7143423283","doi":"https://doi.org/10.48550/arxiv.2603.25916","title":"Parameter-Free Dynamic Regret for Unconstrained Linear Bandits","display_name":"Parameter-Free Dynamic Regret for Unconstrained Linear Bandits","publication_year":2026,"publication_date":"2026-03-26","ids":{"openalex":"https://openalex.org/W7143423283","doi":"https://doi.org/10.48550/arxiv.2603.25916"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.25916","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25916","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.25916","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012673105","display_name":"Alberto Rumi","orcid":"https://orcid.org/0000-0001-7426-3012"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rumi, Alberto","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/A5130926565","display_name":"Nicol\u00f2 Cesa-Bianchi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cesa-Bianchi, Nicol\u00f2","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5063221243","display_name":"Fabio Vitale","orcid":"https://orcid.org/0000-0001-6286-5163"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vitale, Fabio","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.9909999966621399,"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.9909999966621399,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.004600000102072954,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.0007999999797903001,"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/regret","display_name":"Regret","score":0.9083999991416931},{"id":"https://openalex.org/keywords/comparator","display_name":"Comparator","score":0.5605000257492065},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5579000115394592},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5174000263214111},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4936000108718872},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.362199991941452}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.9083999991416931},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5764999985694885},{"id":"https://openalex.org/C155745195","wikidata":"https://www.wikidata.org/wiki/Q1164179","display_name":"Comparator","level":3,"score":0.5605000257492065},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5579000115394592},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5174000263214111},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5051000118255615},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4936000108718872},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44609999656677246},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.362199991941452},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3264000117778778},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C28901747","wikidata":"https://www.wikidata.org/wiki/Q177571","display_name":"Decision theory","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.25916","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25916","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":"doi:10.48550/arxiv.2603.25916","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25916","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":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":{"We":[0,39],"study":[1],"dynamic":[2],"regret":[3,85],"minimization":[4],"in":[5,29],"unconstrained":[6],"adversarial":[7],"linear":[8,80],"bandit":[9,50],"problems.":[10],"In":[11,72],"this":[12],"setting,":[13],"a":[14,41,102],"learner":[15],"must":[16],"minimize":[17],"the":[18,46,58,76,83],"cumulative":[19],"loss":[20],"relative":[21],"to":[22,44,54,57,92],"an":[23,68],"arbitrary":[24,69],"sequence":[25],"of":[26,48,60,67,87,98],"comparators":[27],"$\\boldsymbol{u}_1,\\ldots,\\boldsymbol{u}_T$":[28],"$\\mathbb{R}^d$,":[30],"but":[31],"receives":[32],"only":[33],"point-evaluation":[34],"feedback":[35],"on":[36],"each":[37],"round.":[38],"provide":[40,75],"simple":[42],"approach":[43],"combining":[45],"guarantees":[47],"several":[49],"algorithms,":[51],"allowing":[52],"us":[53],"optimally":[55],"adapt":[56],"number":[59],"switches":[61],"$S_T":[62],"=":[63],"\\sum_t\\mathbb{I}\\{\\boldsymbol{u}_t":[64],"\\neq":[65],"\\boldsymbol{u}_{t-1}\\}$":[66],"comparator":[70],"sequence.":[71],"particular,":[73],"we":[74],"first":[77],"algorithm":[78],"for":[79],"bandits":[81],"achieving":[82],"optimal":[84],"guarantee":[86],"order":[88],"$\\mathcal{O}\\big(\\sqrt{d(1+S_T)":[89],"T}\\big)$":[90],"up":[91],"poly-logarithmic":[93],"terms":[94],"without":[95],"prior":[96],"knowledge":[97],"$S_T$,":[99],"thus":[100],"resolving":[101],"long-standing":[103],"open":[104],"problem.":[105]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-31T00:00:00"}