{"id":"https://openalex.org/W7135015639","doi":"https://doi.org/10.48550/arxiv.2603.10346","title":"On The Complexity of Best-Arm Identification in Non-Stationary Linear Bandits","display_name":"On The Complexity of Best-Arm Identification in Non-Stationary Linear Bandits","publication_year":2026,"publication_date":"2026-03-11","ids":{"openalex":"https://openalex.org/W7135015639","doi":"https://doi.org/10.48550/arxiv.2603.10346"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.10346","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10346","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,"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.10346","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128868822","display_name":"Leo Maynard-Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maynard-Zhang, Leo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002064980","display_name":"Zhihan Xiong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiong, Zhihan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059086538","display_name":"Kevin Jamieson","orcid":"https://orcid.org/0000-0003-2054-2985"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jamieson, Kevin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102886973","display_name":"Maryam Fazel","orcid":"https://orcid.org/0000-0001-5329-4522"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fazel, Maryam","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":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.9879999756813049,"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.9879999756813049,"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.00279999990016222,"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/T11182","display_name":"Auction Theory and Applications","score":0.0015999999595806003,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.727400004863739},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6093999743461609},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6007999777793884},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.597000002861023},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.5271000266075134},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4494999945163727},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.4332999885082245},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4171000123023987}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.727400004863739},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6093999743461609},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6007999777793884},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.597000002861023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5611000061035156},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.5271000266075134},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.4332999885082245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41769999265670776},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4171000123023987},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.40560001134872437},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.388700008392334},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.3882000148296356},{"id":"https://openalex.org/C79610928","wikidata":"https://www.wikidata.org/wiki/Q1656743","display_name":"Parameter identification problem","level":3,"score":0.36059999465942383},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3601999878883362},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.34220001101493835},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.33250001072883606},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C2777402240","wikidata":"https://www.wikidata.org/wiki/Q6783436","display_name":"Masking (illustration)","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26089999079704285},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2533999979496002}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.10346","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10346","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,"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.10346","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10346","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,"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":"Preprint"},"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,174],"study":[1],"the":[2,43,46,71,88,109,115,151,159,165,171,177,190,198],"fixed-budget":[3],"best-arm":[4],"identification":[5],"(BAI)":[6],"problem":[7],"in":[8,107,142],"non-stationary":[9],"linear":[10],"bandits.":[11],"Concretely,":[12],"given":[13],"a":[14,27,38,75,104,162],"fixed":[15],"time":[16],"budget":[17],"$T\\in":[18],"\\mathbb{N}$,":[19],"finite":[20],"arm":[21,44,110,126,147],"set":[22,111],"$\\mathcal{X}":[23],"\\subset":[24],"\\mathbb{R}^d$,":[25],"and":[26,169,196],"potentially":[28],"adversarial":[29],"sequence":[30],"of":[31,79,94,114,164,180,192,201],"unknown":[32],"parameters":[33],"$\\lbrace":[34],"\u03b8_t\\rbrace_{t=1}^{T}$":[35],"(hence":[36],"non-stationary),":[37],"learner":[39],"aims":[40],"to":[41,187],"identify":[42],"with":[45,57,87,128],"largest":[47],"cumulative":[48],"reward":[49],"$x_*":[50],"=":[51],"\\arg\\max_{x":[52],"\\in":[53],"\\mathcal{X}}":[54],"x^\\top\\sum_{t=1}^T":[55],"\u03b8_t$":[56],"high":[58],"probability.":[59],"In":[60],"this":[61,92,202],"setting,":[62],"it":[63,100],"is":[64,96,101],"well-known":[65,166],"that":[66,176],"uniformly":[67],"sampling":[68],"arms":[69],"from":[70,103,125],"G-optimal":[72],"design":[73],"yields":[74],"minimax-optimal":[76],"error":[77,178],"probability":[78,179],"$\\exp\\left(-\u0398\\left(T":[80],"/":[81],"H_{G}\\right)\\right)$,":[82],"where":[83],"$H_{G}$":[84],"scales":[85],"proportionally":[86],"dimension":[89],"$d$.":[90],"However,":[91],"notion":[93],"complexity":[95,200],"overly":[97],"pessimistic,":[98],"as":[99],"derived":[102],"lower":[105,139,155,184,194],"bound":[106,140,185],"which":[108],"consists":[112],"only":[113],"standard":[116],"basis":[117],"vectors,":[118],"thus":[119],"masking":[120],"any":[121,146],"potential":[122],"advantages":[123],"arising":[124],"sets":[127],"richer":[129],"geometric":[130],"structure.":[131],"To":[132],"address":[133],"this,":[134],"we":[135,157],"establish":[136],"an":[137],"arm-set-dependent":[138,199],"that,":[141],"contrast,":[143],"holds":[144],"for":[145],"set.":[148],"Motivated":[149],"by":[150],"ideas":[152],"underlying":[153],"our":[154,183,193],"bound,":[156,195],"propose":[158],"Adjacent-optimal":[160],"design,":[161,168],"specialization":[163],"$\\mathcal{X}\\mathcal{Y}$-optimal":[167],"develop":[170],"$\\textsf{Adjacent-BAI}$":[172,181],"algorithm.":[173],"prove":[175],"matches":[182],"up":[186],"constants,":[188],"verifying":[189],"tightness":[191],"establishing":[197],"setting.":[203]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-13T00:00:00"}