{"id":"https://openalex.org/W7160143890","doi":"https://doi.org/10.48550/arxiv.2605.00268","title":"Fast Rates in $\u03b1$-Potential Games via Regularized Mirror Descent","display_name":"Fast Rates in $\u03b1$-Potential Games via Regularized Mirror Descent","publication_year":2026,"publication_date":"2026-04-30","ids":{"openalex":"https://openalex.org/W7160143890","doi":"https://doi.org/10.48550/arxiv.2605.00268"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.00268","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.00268","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.2605.00268","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135125280","display_name":"Claire Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Claire","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135248756","display_name":"Yuheng Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Yuheng","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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.37940001487731934,"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"}},"topics":[{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.37940001487731934,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.2126999944448471,"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/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.05909999832510948,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.6901000142097473},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.628600001335144},{"id":"https://openalex.org/keywords/offline-learning","display_name":"Offline learning","score":0.5613999962806702},{"id":"https://openalex.org/keywords/potential-game","display_name":"Potential game","score":0.4869999885559082},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45260000228881836},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.41350001096725464},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.3813999891281128},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.33559998869895935}],"concepts":[{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.6901000142097473},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.628600001335144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6018999814987183},{"id":"https://openalex.org/C2780490138","wikidata":"https://www.wikidata.org/wiki/Q7079636","display_name":"Offline learning","level":3,"score":0.5613999962806702},{"id":"https://openalex.org/C2778079155","wikidata":"https://www.wikidata.org/wiki/Q288500","display_name":"Potential game","level":3,"score":0.4869999885559082},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45260000228881836},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.41350001096725464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3982999920845032},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.3813999891281128},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36649999022483826},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33799999952316284},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.33559998869895935},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.326200008392334},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3154999911785126},{"id":"https://openalex.org/C2780102126","wikidata":"https://www.wikidata.org/wiki/Q10928179","display_name":"Online and offline","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.30550000071525574},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.29589998722076416},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C155930848","wikidata":"https://www.wikidata.org/wiki/Q1069099","display_name":"Normal-form game","level":4,"score":0.2743000090122223},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.27140000462532043},{"id":"https://openalex.org/C2982736386","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Statistical learning","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C164407509","wikidata":"https://www.wikidata.org/wiki/Q5384490","display_name":"Equilibrium selection","level":4,"score":0.2639999985694885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25920000672340393}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.00268","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.00268","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.2605.00268","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.00268","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"An":[0],"$\u03b1$-potential":[1,59,133],"game":[2,42],"is":[3,34],"a":[4,10,20,26,70,84,103],"multi-player":[5],"non-cooperative":[6],"interaction":[7],"in":[8,30,58],"which":[9],"global":[11],"potential":[12,41],"function":[13],"approximates":[14],"individual":[15],"player":[16],"rewards":[17],"up":[18],"to":[19,36,83],"structural":[21],"bias":[22],"$\u03b1$.":[23],"While":[24],"identifying":[25],"Nash":[27],"Equilibrium":[28],"(NE)":[29],"generic":[31],"general-sum":[32],"games":[33,60],"known":[35,85],"be":[37],"computationally":[38],"intractable,":[39],"the":[40,53,114,126],"structure":[43],"enables":[44],"tractable":[45],"NE":[46,57],"identification.":[47],"In":[48],"this":[49,66],"paper,":[50],"we":[51,68,96],"study":[52],"offline":[54,73,120,129],"learning":[55,130],"of":[56,119],"using":[61],"KL":[62],"regularization.":[63],"To":[64],"analyze":[65],"process,":[67],"propose":[69,97],"novel":[71],"Reference-Anchored":[72],"data":[74,81],"coverage":[75],"framework--a":[76],"verifiable":[77],"condition":[78],"that":[79,106],"anchors":[80],"requirements":[82],"reference":[86],"policy":[87],"rather":[88],"than":[89],"an":[90,108],"unknown":[91],"optimum.":[92],"Building":[93],"on":[94],"this,":[95],"Offline":[98],"Potential":[99],"Mirror":[100],"Descent":[101],"(OPMD),":[102],"decentralized":[104],"algorithm":[105],"achieves":[107],"accelerated":[109],"$\\widetilde{\\mathcal{O}}(1/n)$":[110],"statistical":[111],"rate,":[112],"surpassing":[113],"standard":[115],"$\\widetilde{\\mathcal{O}}(1/\\sqrt{n})$":[116],"rate":[117],"typical":[118],"multi-agent":[121],"learning.":[122],"This":[123],"work":[124],"characterizes":[125],"first":[127],"fast-rate":[128],"approach":[131],"for":[132],"games.":[134]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-05T00:00:00"}