{"id":"https://openalex.org/W7119016429","doi":"https://doi.org/10.48550/arxiv.2601.01069","title":"Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs","display_name":"Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs","publication_year":2026,"publication_date":"2026-01-03","ids":{"openalex":"https://openalex.org/W7119016429","doi":"https://doi.org/10.48550/arxiv.2601.01069"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.01069","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.01069","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":null,"license_id":null,"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.2601.01069","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122279064","display_name":"Jing Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wang, Jing","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122193083","display_name":"Peng Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Peng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5121324658","display_name":"Zhi-Hua Zhou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Zhi-Hua","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5122279064"],"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.9908000230789185,"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.9908000230789185,"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/T13553","display_name":"Age of Information Optimization","score":0.00139999995008111,"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/T12814","display_name":"Gaussian Processes and Bayesian Inference","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.8899000287055969},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5806000232696533},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5597000122070312},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.44510000944137573},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4081000089645386},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.40459999442100525},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.39719998836517334},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.36880001425743103}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8899000287055969},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5934000015258789},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5806000232696533},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5597000122070312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5196999907493591},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.40459999442100525},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.39719998836517334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38040000200271606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37630000710487366},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C117568660","wikidata":"https://www.wikidata.org/wiki/Q1650843","display_name":"Multinomial logistic regression","level":2,"score":0.3662000000476837},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.29109999537467957},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C102366305","wikidata":"https://www.wikidata.org/wiki/Q1097688","display_name":"Nonparametric statistics","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C2776045410","wikidata":"https://www.wikidata.org/wiki/Q25111241","display_name":"Parametric programming","level":3,"score":0.2606000006198883},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25949999690055847},{"id":"https://openalex.org/C24574437","wikidata":"https://www.wikidata.org/wiki/Q7135228","display_name":"Parametric model","level":3,"score":0.2515000104904175}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.01069","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.01069","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.01069","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.01069","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.70030677318573}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Non-stationary":[0],"parametric":[1,70,142],"bandits":[2,74],"have":[3],"attracted":[4],"much":[5],"attention":[6],"recently.":[7],"There":[8],"are":[9,54],"three":[10],"principled":[11],"ways":[12],"to":[13,84,136,205],"deal":[14],"with":[15,162,211],"non-stationarity,":[16,190],"including":[17,144],"sliding-window,":[18],"weighted,":[19],"and":[20,51,149,180,192,197,219,236],"restart":[21],"strategies.":[22],"As":[23],"many":[24],"non-stationary":[25,69,206],"environments":[26],"exhibit":[27],"gradual":[28],"drifting":[29],"patterns,":[30],"the":[31,52,65,105,123,170,183,189,195,233],"weighted":[32,66,159,234],"strategy":[33,67,235],"is":[34,48,82,115],"commonly":[35],"adopted":[36],"in":[37,91,175],"real-world":[38],"applications.":[39],"However,":[40],"previous":[41,127],"theoretical":[42],"studies":[43],"show":[44],"that":[45,78,114],"its":[46],"analysis":[47,101,243],"more":[49],"involved":[50],"algorithms":[53,120,230],"either":[55],"computationally":[56],"less":[57],"efficient":[58,117],"or":[59],"statistically":[60],"suboptimal.":[61],"This":[62],"paper":[63],"revisits":[64],"for":[68],"bandits.":[71],"In":[72],"linear":[73],"(LB),":[75],"we":[76,155,201,228],"discover":[77],"this":[79],"undesirable":[80],"feature":[81],"due":[83],"an":[85,92,163],"inadequate":[86],"regret":[87,125,138,239],"analysis,":[88],"which":[89,103],"results":[90],"overly":[93],"complex":[94],"algorithm":[95,113,161],"design.":[96],"We":[97],"propose":[98,229],"a":[99,110,157],"\\emph{refined":[100],"framework},":[102],"simplifies":[104],"derivation":[106],"and,":[107],"importantly,":[108],"produces":[109],"simpler":[111],"weight-based":[112],"as":[116,118,126],"window/restart-based":[119],"while":[121],"retaining":[122],"same":[124],"studies.":[128],"Furthermore,":[129],"our":[130,203,242],"new":[131],"framework":[132,204],"can":[133],"be":[134],"used":[135],"improve":[137],"bounds":[139],"of":[140],"other":[141],"bandits,":[143],"Generalized":[145],"Linear":[146,216],"Bandits":[147,151],"(GLB)":[148],"Self-Concordant":[150],"(SCB).":[152],"For":[153,225],"example,":[154],"develop":[156],"simple":[158],"GLB":[160],"$\\tilde{O}(k_\u03bc^{5/4}":[164],"c_\u03bc^{-3/4}":[165],"d^{3/4}":[166],"P_T^{1/4}T^{3/4})$":[167],"regret,":[168],"improving":[169],"$\\tilde{O}(k_\u03bc^{2}":[171],"c_\u03bc^{-1}d^{9/10}":[172],"P_T^{1/5}T^{4/5})$":[173],"bound":[174],"prior":[176],"work,":[177],"where":[178],"$k_\u03bc$":[179],"$c_\u03bc$":[181],"characterize":[182],"reward":[184],"model's":[185],"nonlinearity,":[186],"$P_T$":[187],"measures":[188],"$d$":[191],"$T$":[193],"denote":[194],"dimension":[196],"time":[198],"horizon.":[199],"Moreover,":[200],"extend":[202],"Markov":[207],"Decision":[208],"Processes":[209],"(MDPs)":[210],"function":[212],"approximation,":[213],"focusing":[214],"on":[215,232],"Mixture":[217,223],"MDP":[218],"Multinomial":[220],"Logit":[221],"(MNL)":[222],"MDP.":[224],"both":[226],"classes,":[227],"based":[231],"establish":[237],"dynamic":[238],"guarantees":[240],"using":[241],"framework.":[244]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}