{"id":"https://openalex.org/W4411945954","doi":"https://doi.org/10.1145/3736252.3742639","title":"Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games","display_name":"Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games","publication_year":2025,"publication_date":"2025-07-02","ids":{"openalex":"https://openalex.org/W4411945954","doi":"https://doi.org/10.1145/3736252.3742639"},"language":"en","primary_location":{"id":"doi:10.1145/3736252.3742639","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3736252.3742639","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3736252.3742639","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3736252.3742639","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037886840","display_name":"Ashkan Soleymani","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ashkan Soleymani","raw_affiliation_strings":["MIT, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0009-0006-7278-9014","affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079969658","display_name":"Georgios Piliouras","orcid":"https://orcid.org/0000-0002-6236-3566"},"institutions":[{"id":"https://openalex.org/I4210090411","display_name":"Google DeepMind (United Kingdom)","ror":"https://ror.org/00971b260","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210090411","https://openalex.org/I4210128969"]},{"id":"https://openalex.org/I4210113297","display_name":"Google (United Kingdom)","ror":"https://ror.org/024bc3e07","country_code":"GB","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210113297","https://openalex.org/I4210128969"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Georgios Piliouras","raw_affiliation_strings":["Google DeepMind, London, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-6236-3566","affiliations":[{"raw_affiliation_string":"Google DeepMind, London, United Kingdom","institution_ids":["https://openalex.org/I4210113297","https://openalex.org/I4210090411"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070571735","display_name":"Gabriele Farina","orcid":"https://orcid.org/0000-0002-3976-0061"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gabriele Farina","raw_affiliation_strings":["MIT, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-3976-0061","affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037886840"],"corresponding_institution_ids":["https://openalex.org/I4210110987"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22041466,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"870","last_page":"870"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11674","display_name":"Sports Analytics and Performance","score":0.9164999723434448,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11674","display_name":"Sports Analytics and Performance","score":0.9164999723434448,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.9052000045776367,"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/regret","display_name":"Regret","score":0.9100103378295898},{"id":"https://openalex.org/keywords/optimism","display_name":"Optimism","score":0.7207843661308289},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7132492661476135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5745047926902771},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.419653058052063},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33319127559661865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2738853693008423},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1124139130115509},{"id":"https://openalex.org/keywords/psychology","display_name":"Psychology","score":0.08079215884208679},{"id":"https://openalex.org/keywords/social-psychology","display_name":"Social psychology","score":0.051757216453552246},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05086454749107361}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.9100103378295898},{"id":"https://openalex.org/C204017024","wikidata":"https://www.wikidata.org/wiki/Q485446","display_name":"Optimism","level":2,"score":0.7207843661308289},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7132492661476135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5745047926902771},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.419653058052063},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33319127559661865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2738853693008423},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1124139130115509},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.08079215884208679},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.051757216453552246},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05086454749107361}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3736252.3742639","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3736252.3742639","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3736252.3742639","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM Conference on Economics and Computation","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3736252.3742639","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3736252.3742639","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3736252.3742639","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411945954.pdf","grobid_xml":"https://content.openalex.org/works/W4411945954.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2101991911","https://openalex.org/W2155070487","https://openalex.org/W4311589891","https://openalex.org/W3123835761","https://openalex.org/W118270247"],"abstract_inverted_index":{"Recent":[0],"work":[1],"[Soleymani":[2],"et":[3,138,142],"al.,":[4],"2025]":[5],"introduced":[6],"a":[7,22,59,154],"variant":[8],"of":[9,47,76,166],"Optimistic":[10,109],"Multiplicative":[11],"Weights":[12],"Updates":[13],"(OMWU)":[14],"that":[15,40],"adaptively":[16],"controls":[17],"the":[18,48,88,124],"learning":[19,42,65,84,159],"pace":[20],"in":[21,32,66,117,128,160],"dynamic,":[23],"non-monotone":[24],"manner,":[25],"achieving":[26],"new":[27],"state-of-the-art":[28],"regret":[29,116,127],"minimization":[30],"guarantees":[31],"general":[33,67,161],"games.":[34,68,162],"In":[35,131],"this":[36,167],"work,":[37],"we":[38,96],"demonstrate":[39],"no-regret":[41,83],"acceleration":[43],"through":[44],"adaptive":[45],"pacing":[46,87],"learners":[49],"is":[50],"not":[51,101,148],"an":[52,81],"isolated":[53],"phenomenon.":[54],"We":[55],"introduce":[56],"Cautious":[57,69,108],"Optimism,":[58],"framework":[60],"for":[61,157],"substantially":[62],"faster":[63],"regularized":[64],"Optimism":[70],"takes":[71],"as":[72],"input":[73],"any":[74],"instance":[75],"Follow-the-Regularized-Leader":[77],"(FTRL)":[78],"and":[79],"outputs":[80],"accelerated":[82],"algorithm":[85],"by":[86],"underlying":[89],"FTRL":[90,110],"with":[91],"minimal":[92],"computational":[93],"overhead.":[94],"Importantly,":[95],"retain":[97],"uncoupledness":[98],"(learners":[99],"do":[100],"need":[102],"to":[103,133],"know":[104],"other":[105],"players'":[106],"utilities).":[107],"achieves":[111],"near-optimal":[112],"OT":[113],"(log":[114],"T)":[115],"diverse":[118],"self-play":[119],"(mixing-and-matching":[120],"regularizers)":[121],"while":[122],"preserving":[123],"optimal":[125],"O(T)":[126],"adversarial":[129],"scenarios.":[130],"contrast":[132],"prior":[134],"works":[135],"(e.g.":[136],"Syrgkanis":[137],"al.":[139,143],"[2015],":[140],"Daskalakis":[141],"[2021]),":[144],"our":[145],"analysis":[146],"does":[147],"rely":[149],"on":[150],"monotonic":[151],"step-sizes,":[152],"showcasing":[153],"novel":[155],"route":[156],"fast":[158],"A":[163],"full":[164],"version":[165],"paper":[168],"can":[169],"be":[170],"found":[171],"at":[172],"https://arxiv.org/abs/2506.05005.":[173]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}