{"id":"https://openalex.org/W7155005648","doi":"https://doi.org/10.48550/arxiv.2604.16087","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","display_name":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","publication_year":2026,"publication_date":"2026-04-17","ids":{"openalex":"https://openalex.org/W7155005648","doi":"https://doi.org/10.48550/arxiv.2604.16087"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.16087","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16087","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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.16087","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134045736","display_name":"C\u00f4me Fiegel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fiegel, C\u00f4me","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134020118","display_name":"Pierre M\u00e9nard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M\u00e9nard, Pierre","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070075141","display_name":"Tadashi Kozuno","orcid":"https://orcid.org/0000-0002-8820-1362"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kozuno, Tadashi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134093725","display_name":"Michal Valko","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Valko, Michal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134035851","display_name":"Vianney Perchet","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Perchet, Vianney","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.9555000066757202,"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.9555000066757202,"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/T11031","display_name":"Game Theory and Applications","score":0.022199999541044235,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.006200000178068876,"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/nash-equilibrium","display_name":"Nash equilibrium","score":0.6615999937057495},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6373999714851379},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5715000033378601},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5400000214576721},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.510200023651123},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5016999840736389},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4374000132083893}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.6615999937057495},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6373999714851379},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5853999853134155},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5715000033378601},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5400000214576721},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.510200023651123},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5016999840736389},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4767000079154968},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4374000132083893},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4325999915599823},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4302999973297119},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.3587999939918518},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.35670000314712524},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3564000129699707},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.3059000074863434},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.26660001277923584},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.16087","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16087","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.16087","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16087","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":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,62,103],"study":[1],"the":[2,29,32,39,59,71,81,84,93,100,131],"problem":[3],"of":[4,31,56,70,99],"learning":[5],"in":[6,90],"zero-sum":[7],"matrix":[8],"games":[9],"with":[10,53,83],"repeated":[11],"play":[12],"and":[13,116,128],"bandit":[14],"feedback.":[15],"Specifically,":[16],"we":[17],"focus":[18],"on":[19,58,138],"developing":[20],"uncoupled":[21,66],"algorithms":[22,107],"that":[23,108],"guarantee,":[24],"without":[25],"communication":[26],"between":[27,126],"players,":[28],"convergence":[30,69,98],"last-iterate":[33],"to":[34,74,80,92,114],"a":[35,54,75,123,134,139],"Nash":[36,76],"equilibrium.":[37],"Although":[38],"non-bandit":[40],"case":[41],"has":[42,48],"been":[43,50],"studied":[44],"extensively,":[45],"this":[46,110],"setting":[47],"only":[49],"explored":[51],"recently,":[52],"bound":[55],"$\\mathcal{O}(T^{-1/8})$":[57],"exploitability":[60],"gap.":[61],"show":[63],"that,":[64],"for":[65,97],"algorithms,":[67],"guaranteeing":[68],"policy":[72],"profiles":[73],"equilibrium":[77],"is":[78],"detrimental":[79],"performance,":[82],"best":[85],"attainable":[86],"rate":[87,96,112],"being":[88],"$\u03a9(T^{-1/4})$":[89],"contrast":[91],"usual":[94],"$\u03a9(T^{-1/2})$":[95],"average":[101],"iterates.":[102],"then":[104],"propose":[105],"two":[106],"achieve":[109],"optimal":[111],"up":[113],"constant":[115],"logarithmic":[117],"factors.":[118],"The":[119],"first":[120],"algorithm":[121],"leverages":[122],"straightforward":[124],"trade-off":[125],"exploration":[127],"exploitation,":[129],"while":[130],"second":[132],"employs":[133],"regularization":[135],"technique":[136],"based":[137],"two-step":[140],"mirror":[141],"descent":[142],"approach.":[143]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-21T00:00:00"}