{"id":"https://openalex.org/W7154743369","doi":"https://doi.org/10.48550/arxiv.2604.15242","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","display_name":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","publication_year":2026,"publication_date":"2026-04-16","ids":{"openalex":"https://openalex.org/W7154743369","doi":"https://doi.org/10.48550/arxiv.2604.15242"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-05595379v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05595379","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"Preprints, Working Papers, ..."},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.15242","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133865444","display_name":"Come Fiegel","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fiegel, Come","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133846061","display_name":"Pierre Menard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Menard, 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/A5133917375","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/A5133865724","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":5,"corresponding_author_ids":["https://openalex.org/A5133865444"],"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.8446999788284302,"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.8446999788284302,"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.09539999812841415,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.014700000174343586,"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/convergence","display_name":"Convergence (economics)","score":0.7156000137329102},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.6621999740600586},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5964000225067139},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5281999707221985},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.47589999437332153},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.3303999900817871}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7156000137329102},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6621999740600586},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5964000225067139},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5281999707221985},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5195000171661377},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47999998927116394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4771000146865845},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.47589999437332153},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3303999900817871},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C49555168","wikidata":"https://www.wikidata.org/wiki/Q176583","display_name":"Stochastic matrix","level":3,"score":0.2727000117301941},{"id":"https://openalex.org/C2986087404","wikidata":"https://www.wikidata.org/wiki/Q15946010","display_name":"Online learning","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.267300009727478},{"id":"https://openalex.org/C2988995629","wikidata":"https://www.wikidata.org/wiki/Q2915729","display_name":"Matrix algebra","level":3,"score":0.26159998774528503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26100000739097595}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-05595379v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05595379","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"Preprints, Working Papers, ..."},{"id":"doi:10.48550/arxiv.2604.15242","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15242","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.2604.15242","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15242","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":[{"score":0.5309138894081116,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"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,64,84],"study":[1],"the":[2,28,38,51,67,90,99],"problem":[3],"of":[4,41,69,92],"learning":[5],"minimax":[6],"policies":[7],"in":[8,22,50],"zero-sum":[9],"matrix":[10],"games.":[11],"Fiegel":[12],"et":[13],"al.":[14],"(2025)":[15],"recently":[16],"showed":[17],"that":[18,66],"achieving":[19],"last-iterate":[20],"convergence":[21,81],"this":[23,54,61,79],"setting":[24,91],"is":[25],"harder":[26],"when":[27],"players":[29],"are":[30],"uncoupled,":[31],"by":[32],"proving":[33,95],"a":[34,70,75,96],"lower":[35],"bound":[36,97],"on":[37],"exploitability":[39],"gap":[40],"Omega(t^{-1/4}).":[42],"Some":[43],"online":[44],"mirror":[45],"descent":[46],"algorithms":[47],"were":[48],"proposed":[49],"literature":[52],"for":[53],"problem,":[55],"but":[56],"none":[57],"have":[58],"truly":[59],"attained":[60],"rate":[62],"yet.":[63],"show":[65],"use":[68],"log-barrier":[71],"regularization,":[72],"along":[73],"with":[74,82,98],"dual-focused":[76],"analysis,":[77],"allows":[78],"O-tilde(t^{-1/4})":[80],"high-probability.":[83],"additionally":[85],"extend":[86],"our":[87],"idea":[88],"to":[89],"extensive-form":[93],"games,":[94],"same":[100],"rate.":[101]},"counts_by_year":[],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2026-04-18T00:00:00"}