{"id":"https://openalex.org/W4416440251","doi":"https://doi.org/10.1145/3798129.3800871","title":"Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games","display_name":"Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4416440251","doi":"https://doi.org/10.1145/3798129.3800871"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800871","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800871","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800871","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102877899","display_name":"Yang Cai","orcid":"https://orcid.org/0000-0002-5426-1324"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Cai","raw_affiliation_strings":["Yale University, New Haven, USA"],"raw_orcid":"https://orcid.org/0000-0002-5426-1324","affiliations":[{"raw_affiliation_string":"Yale University, New Haven, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034822411","display_name":"Constantinos Daskalakis","orcid":"https://orcid.org/0000-0002-5451-0490"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Constantinos Daskalakis","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0002-5451-0490","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101058302","display_name":"Haipeng Luo","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haipeng Luo","raw_affiliation_strings":["University of Southern California, Los Angeles, USA"],"raw_orcid":"https://orcid.org/0009-0002-4142-3627","affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035849375","display_name":"Chen-Yu Wei","orcid":"https://orcid.org/0000-0001-8735-4773"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chen-Yu Wei","raw_affiliation_strings":["University of Virginia, Charlottesville, USA"],"raw_orcid":"https://orcid.org/0000-0003-3890-8260","affiliations":[{"raw_affiliation_string":"University of Virginia, Charlottesville, USA","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100529754","display_name":"Weiqiang Zheng","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weiqiang Zheng","raw_affiliation_strings":["Yale University, New Haven, USA"],"raw_orcid":"https://orcid.org/0000-0001-9989-4697","affiliations":[{"raw_affiliation_string":"Yale University, New Haven, USA","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00615107,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1639","last_page":"1650"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.7998999953269958,"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.7998999953269958,"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.14059999585151672,"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/T11031","display_name":"Game Theory and Applications","score":0.027300000190734863,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7354000210762024},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.6603000164031982},{"id":"https://openalex.org/keywords/swap","display_name":"Swap (finance)","score":0.5722000002861023},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5447999835014343},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4968999922275543},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49410000443458557},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4147000014781952},{"id":"https://openalex.org/keywords/bregman-divergence","display_name":"Bregman divergence","score":0.3804999887943268},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.375900000333786}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7354000210762024},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6603000164031982},{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.5722000002861023},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5447999835014343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5382999777793884},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.531000018119812},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4968999922275543},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49410000443458557},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42260000109672546},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4147000014781952},{"id":"https://openalex.org/C149073432","wikidata":"https://www.wikidata.org/wiki/Q4960382","display_name":"Bregman divergence","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.375900000333786},{"id":"https://openalex.org/C2986087404","wikidata":"https://www.wikidata.org/wiki/Q15946010","display_name":"Online learning","level":2,"score":0.3513000011444092},{"id":"https://openalex.org/C115903097","wikidata":"https://www.wikidata.org/wiki/Q7094097","display_name":"Online machine learning","level":3,"score":0.34599998593330383},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33559998869895935},{"id":"https://openalex.org/C145071142","wikidata":"https://www.wikidata.org/wiki/Q1411116","display_name":"Fictitious play","level":3,"score":0.33390000462532043},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3334999978542328},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.3273000121116638},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.3174000084400177},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3061999976634979},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3005000054836273},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.29409998655319214},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.28119999170303345},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C88959737","wikidata":"https://www.wikidata.org/wiki/Q1546627","display_name":"Strategy","level":3,"score":0.2712000012397766},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.2621000111103058},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.25459998846054077}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800871","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800871","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2511.01852","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.01852","pdf_url":"https://arxiv.org/pdf/2511.01852","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.01852","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.01852","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.1145/3798129.3800871","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800871","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G420425208","display_name":null,"funder_award_id":"CCF-234264","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G845813560","display_name":null,"funder_award_id":"IS-1943607","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Learning":[0],"and":[1,14,38,79,85,141,155],"computation":[2],"of":[3,12,27,56,66,135],"equilibria":[4,62],"are":[5],"central":[6],"problems":[7],"in":[8,48,76,138,151,164],"game":[9,80],"theory,":[10],"theory":[11],"computation,":[13],"artificial":[15],"intelligence.":[16],"In":[17],"this":[18],"work,":[19],"we":[20],"introduce":[21],"proximal":[22,31,60,110],"regret,":[23,111],"a":[24,45,49,64,118,127],"new":[25,90,128],"notion":[26,121],"regret":[28,120],"based":[29],"on":[30,109],"operators":[32],"that":[33,96,113],"lies":[34],"strictly":[35],"between":[36],"external":[37,123],"swap":[39],"regret.":[40,124],"When":[41],"every":[42],"player":[43],"employs":[44],"no-proximal-regret":[46],"algorithm":[47,103],"general":[50],"convex":[51,166],"game,":[52],"the":[53,97,131,152],"empirical":[54],"distribution":[55],"play":[57],"converges":[58],"to":[59,148,156],"correlated":[61,68,87],"(PCE),":[63],"refinement":[65],"coarse":[67],"equilibria.":[69],"Our":[70,92],"framework":[71],"unifies":[72],"several":[73],"emerging":[74],"notions":[75],"online":[77,139],"learning":[78,140],"theory\u2014such":[81],"as":[82],"gradient":[83,136],"equilibrium":[84],"semicoarse":[86],"equilibrium\u2014and":[88],"introduces":[89],"ones.":[91],"main":[93],"result":[94],"shows":[95],"classic":[98],"Online":[99],"Gradient":[100,158],"Descent":[101,150],"(GD)":[102],"achieves":[104],"an":[105],"optimal":[106],"O(\u221aT)":[107],"bound":[108],"revealing":[112],"GD,":[114],"without":[115],"modification,":[116],"minimizes":[117],"stronger":[119],"than":[122],"This":[125],"provides":[126],"explanation":[129],"for":[130],"empirically":[132],"superior":[133],"performance":[134],"descent":[137],"games.":[142,167],"We":[143],"further":[144],"extend":[145],"our":[146],"analysis":[147],"Mirror":[149],"Bregman":[153],"setting":[154],"Optimistic":[157],"Descent,":[159],"which":[160],"yields":[161],"faster":[162],"convergence":[163],"smooth":[165]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-06T00:00:00"}