{"id":"https://openalex.org/W7147086713","doi":"https://doi.org/10.48550/arxiv.2603.28201","title":"A Perturbation Approach to Unconstrained Linear Bandits","display_name":"A Perturbation Approach to Unconstrained Linear Bandits","publication_year":2026,"publication_date":"2026-03-30","ids":{"openalex":"https://openalex.org/W7147086713","doi":"https://doi.org/10.48550/arxiv.2603.28201"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.28201","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28201","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.28201","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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/A5132641086","display_name":"Dorian Baudry","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Baudry, Dorian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132642549","display_name":"Shinji Ito","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ito, Shinji","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132589544","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":[]}],"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.987500011920929,"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.987500011920929,"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.002199999988079071,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.0012000000569969416,"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.7057999968528748},{"id":"https://openalex.org/keywords/perturbation","display_name":"Perturbation (astronomy)","score":0.570900022983551},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.49149999022483826},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4496000111103058},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.40459999442100525},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.391400009393692},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.38679999113082886}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7057999968528748},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6062999963760376},{"id":"https://openalex.org/C177918212","wikidata":"https://www.wikidata.org/wiki/Q803623","display_name":"Perturbation (astronomy)","level":2,"score":0.570900022983551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5167999863624573},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.49149999022483826},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4496000111103058},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.40459999442100525},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.391400009393692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39070001244544983},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.38679999113082886},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.33410000801086426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31869998574256897},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.30820000171661377},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.30230000615119934},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.25870001316070557}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.28201","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28201","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.28201","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28201","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,20,86,108],"revisit":[1],"the":[2,12,22,27,75,82,95,111,129,134,143],"standard":[3,40],"perturbation-based":[4],"approach":[5,31],"of":[6,14,77,106,148],"Abernethy":[7],"et":[8],"al.":[9],"(2008)":[10],"in":[11,26,52,121],"context":[13],"unconstrained":[15,28],"Bandit":[16,34],"Linear":[17,35,42],"Optimization":[18,36,43],"(uBLO).":[19],"show":[21],"surprising":[23],"result":[24],"that":[25],"setting,":[29],"this":[30],"effectively":[32],"reduces":[33],"(BLO)":[37],"to":[38,71,91],"a":[39],"Online":[41],"(OLO)":[44],"problem.":[45],"Our":[46],"framework":[47],"improves":[48],"on":[49,81,128,142],"prior":[50,104],"work":[51],"several":[53],"ways.":[54],"First,":[55],"we":[56,124],"derive":[57],"expected-regret":[58],"guarantees":[59,97,114],"when":[60],"our":[61,89],"perturbation":[62],"scheme":[63],"is":[64,147],"combined":[65],"with":[66,98],"comparator-adaptive":[67,84],"OLO":[68],"algorithms,":[69],"leading":[70],"new":[72],"insights":[73],"about":[74],"impact":[76],"different":[78],"adversarial":[79,139],"models":[80],"resulting":[83],"rates.":[85],"also":[87],"extend":[88],"analysis":[90],"dynamic":[92,119],"regret,":[93,131],"obtaining":[94],"first":[96,112],"optimal":[99],"$\\sqrt{P_T}$":[100],"path-length":[101],"dependencies":[102],"without":[103],"knowledge":[105],"$P_T$.":[107],"then":[109],"develop":[110],"high-probability":[113],"for":[115,138],"both":[116],"static":[117,130],"and":[118,132],"regret":[120],"uBLO.":[122],"Finally,":[123],"discuss":[125],"lower":[126],"bounds":[127],"prove":[133],"folklore":[135],"$\u03a9(\\sqrt{dT})$":[136],"rate":[137],"linear":[140],"bandits":[141],"Euclidean":[144],"ball,":[145],"which":[146],"independent":[149],"interest.":[150]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-02T00:00:00"}