{"id":"https://openalex.org/W7133805592","doi":"https://doi.org/10.48550/arxiv.2603.03843","title":"Invariance-Based Dynamic Regret Minimization","display_name":"Invariance-Based Dynamic Regret Minimization","publication_year":2026,"publication_date":"2026-03-04","ids":{"openalex":"https://openalex.org/W7133805592","doi":"https://doi.org/10.48550/arxiv.2603.03843"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.03843","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","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/A5084221153","display_name":"Margherita Lazzaretto","orcid":"https://orcid.org/0000-0002-7524-9113"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lazzaretto, Margherita","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128175226","display_name":"Jonas Peters","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peters, Jonas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5044701034","display_name":"Niklas Pfister","orcid":"https://orcid.org/0000-0001-6203-9777"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pfister, Niklas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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.9769999980926514,"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.9769999980926514,"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/T12761","display_name":"Data Stream Mining Techniques","score":0.006099999882280827,"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/T10203","display_name":"Recommender Systems and Techniques","score":0.00279999990016222,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8353000283241272},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.722599983215332},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5095000267028809},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.45329999923706055},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.3799999952316284},{"id":"https://openalex.org/keywords/carry","display_name":"Carry (investment)","score":0.3479999899864197},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3278000056743622},{"id":"https://openalex.org/keywords/data-modeling","display_name":"Data modeling","score":0.31470000743865967}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8353000283241272},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.722599983215332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6071000099182129},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5095000267028809},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4984999895095825},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.45329999923706055},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3813000023365021},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.3799999952316284},{"id":"https://openalex.org/C2776299755","wikidata":"https://www.wikidata.org/wiki/Q432449","display_name":"Carry (investment)","level":2,"score":0.3479999899864197},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3278000056743622},{"id":"https://openalex.org/C67186912","wikidata":"https://www.wikidata.org/wiki/Q367664","display_name":"Data modeling","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3070000112056732},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3005000054836273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2935999929904938},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C159176650","wikidata":"https://www.wikidata.org/wiki/Q43261","display_name":"Horizon","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C108650721","wikidata":"https://www.wikidata.org/wiki/Q1783253","display_name":"Counterfactual thinking","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C107321475","wikidata":"https://www.wikidata.org/wiki/Q5374254","display_name":"Empirical risk minimization","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C149782125","wikidata":"https://www.wikidata.org/wiki/Q160039","display_name":"Econometrics","level":1,"score":0.2603999972343445},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.25459998846054077},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.2533999979496002}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.03843","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.03843","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.03843","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":"pmh:doi:10.48550/arxiv.2603.03843","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","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":{"We":[0,58,107],"consider":[1],"stochastic":[2],"non-stationary":[3,77],"linear":[4,8],"bandits":[5],"where":[6],"the":[7,13,24,35,55,70,96,117],"parameter":[9],"connecting":[10],"contexts":[11],"to":[12,60,66,92,103],"reward":[14,56,71,97],"changes":[15],"over":[16,38],"time.":[17],"Existing":[18],"algorithms":[19],"in":[20,44,95,124],"this":[21,81],"setting":[22],"localize":[23],"policy":[25],"by":[26,68],"gradually":[27],"discarding":[28],"or":[29],"down-weighting":[30],"past":[31,90],"data,":[32],"effectively":[33],"shrinking":[34],"time":[36],"horizon":[37],"which":[39],"learning":[40],"can":[41],"occur.":[42],"However,":[43],"many":[45],"settings":[46],"historical":[47,129],"data":[48,63,91,130],"may":[49],"still":[50],"carry":[51],"partial":[52],"information":[53],"about":[54],"model.":[57],"propose":[59],"leverage":[61],"such":[62],"while":[64],"adapting":[65],"changes,":[67],"assuming":[69],"model":[72,98],"decomposes":[73],"into":[74],"stationary":[75],"and":[76,99,111],"components.":[78],"Based":[79],"on":[80],"assumption,":[82],"we":[83],"introduce":[84],"ISD-linUCB,":[85],"an":[86],"algorithm":[87],"that":[88,113],"uses":[89],"learn":[93],"invariances":[94],"subsequently":[100],"exploits":[101],"them":[102],"improve":[104],"online":[105],"performance.":[106],"show":[108],"both":[109],"theoretically":[110],"empirically":[112],"leveraging":[114],"invariance":[115],"reduces":[116],"problem":[118],"dimensionality,":[119],"yielding":[120],"significant":[121],"regret":[122],"improvements":[123],"fast-changing":[125],"environments":[126],"when":[127],"sufficient":[128],"is":[131],"available.":[132]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-06T00:00:00"}