{"id":"https://openalex.org/W3008901784","doi":"https://doi.org/10.1145/3626514","title":"A New Minimax Theorem for Randomized Algorithms","display_name":"A New Minimax Theorem for Randomized Algorithms","publication_year":2023,"publication_date":"2023-10-18","ids":{"openalex":"https://openalex.org/W3008901784","doi":"https://doi.org/10.1145/3626514","mag":"3008901784"},"language":"en","primary_location":{"id":"doi:10.1145/3626514","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626514","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010258967","display_name":"Shalev Ben-David","orcid":"https://orcid.org/0009-0009-4176-8693"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Shalev Ben-David","raw_affiliation_strings":["University of Waterloo, Canada"],"raw_orcid":"https://orcid.org/0009-0009-4176-8693","affiliations":[{"raw_affiliation_string":"University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000042413","display_name":"Eric Blais","orcid":"https://orcid.org/0009-0000-5824-9034"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Eric Blais","raw_affiliation_strings":["University of Waterloo, Canada"],"raw_orcid":"https://orcid.org/0009-0000-5824-9034","affiliations":[{"raw_affiliation_string":"University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5010258967"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60568242,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"70","issue":"6","first_page":"1","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9987000226974487,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9979000091552734,"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/minimax","display_name":"Minimax","score":0.6232084631919861},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5812580585479736},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5750066637992859},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47292524576187134},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4526209831237793},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4345412254333496},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36489754915237427},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2999277710914612}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6232084631919861},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5812580585479736},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5750066637992859},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47292524576187134},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4526209831237793},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4345412254333496},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36489754915237427},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2999277710914612},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3626514","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626514","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G560051739","display_name":null,"funder_award_id":"RGPIN-2015","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G6615045860","display_name":null,"funder_award_id":"DGECR-2019-00027","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G7653699663","display_name":null,"funder_award_id":"RGPIN-2019-04804","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G8259325584","display_name":null,"funder_award_id":"RGPIN-2015-03907, RGPIN-2022-03329, RGPIN-2019-04804, and DGECR-2019-00027","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G832689143","display_name":null,"funder_award_id":"RGPIN-2019","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320322676","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W41330591","https://openalex.org/W655288721","https://openalex.org/W1490189322","https://openalex.org/W1517585663","https://openalex.org/W1536299660","https://openalex.org/W1582211629","https://openalex.org/W1859250467","https://openalex.org/W1985077192","https://openalex.org/W1986804393","https://openalex.org/W2003519998","https://openalex.org/W2005463836","https://openalex.org/W2010501977","https://openalex.org/W2023146810","https://openalex.org/W2025720061","https://openalex.org/W2031414318","https://openalex.org/W2048106445","https://openalex.org/W2071732851","https://openalex.org/W2110758705","https://openalex.org/W2121981260","https://openalex.org/W2129606454","https://openalex.org/W2129700748","https://openalex.org/W2130246629","https://openalex.org/W2135481450","https://openalex.org/W2144369373","https://openalex.org/W2159902206","https://openalex.org/W2160403361","https://openalex.org/W2201563107","https://openalex.org/W2611310478","https://openalex.org/W2884970704","https://openalex.org/W2905051967","https://openalex.org/W2953323745","https://openalex.org/W2965722881","https://openalex.org/W2971322484","https://openalex.org/W3008284578","https://openalex.org/W3010672433","https://openalex.org/W3010884633","https://openalex.org/W3013582633","https://openalex.org/W3103599873","https://openalex.org/W3127093867","https://openalex.org/W3157388067","https://openalex.org/W3178286633","https://openalex.org/W3217033513","https://openalex.org/W4231734115"],"related_works":["https://openalex.org/W2016058626","https://openalex.org/W2474724840","https://openalex.org/W2895916002","https://openalex.org/W1530911128","https://openalex.org/W1814049089","https://openalex.org/W2369683208","https://openalex.org/W2084836983","https://openalex.org/W1977348009","https://openalex.org/W2362133437","https://openalex.org/W1542540349"],"abstract_inverted_index":{"The":[0,230],"celebrated":[1],"minimax":[2,109,177,187,192],"principle":[3],"of":[4,24,108,159,173,196,204,233,237,248,252,273,290],"Yao":[5],"says":[6],"that":[7,27,118,128,257],"for":[8,68,86,96,120,131,194],"any":[9],"Boolean-valued":[10],"function":[11],"f":[12,25,29,43],"with":[13],"finite":[14],"domain,":[15],"there":[16],"is":[17,37,66,84,293],"a":[18,87,105,114,191,209,225,238,244,287],"distribution":[19,53,64,82,116],"\u03bc":[20,36,54,117],"over":[21,169],"the":[22,52,57,62,80,170,200,234,250,253],"domain":[23],"such":[26,258],"computing":[28,42],"to":[30,44,74,76,189,212,242],"error":[31,45,59,70,98],"\u03b5":[32,46],"against":[33],"inputs":[34],"from":[35,94],"just":[38],"as":[39,41,220],"hard":[40,63,81,115],"on":[47,56,166],"worst-case":[48],"inputs.":[49],"Notably,":[50],"however,":[51],"depends":[55],"target":[58],"level":[60,90],"\u03b5:":[61],"which":[65,83,111,286],"tight":[67,85,95],"bounded":[69,97],"might":[71,91],"be":[72,92,243,269],"trivial":[73],"solve":[75],"small":[77,88],"bias,":[78],"and":[79,144,150,202],"bias":[89,122,251],"far":[93],"levels.":[99],"In":[100],"this":[101,129],"work,":[102],"we":[103,184,207],"introduce":[104,208],"new":[106,210],"type":[107],"theorem":[110,178,188,193],"can":[112,268],"provide":[113],"works":[119,130],"all":[121],"levels":[123],"at":[124],"once.":[125],"We":[126,153,255,275],"show":[127,256],"randomized":[132,135,139,215,239],"query":[133,143],"complexity,":[134,137],"communication":[136,145],"some":[138],"circuit":[140],"models,":[141],"quantum":[142],"complexities,":[146],"approximate":[147,151],"polynomial":[148],"degree,":[149],"logrank.":[152],"also":[154],"prove":[155,190],"an":[156],"improved":[157],"version":[158,236],"Impagliazzo\u2019s":[160],"hardcore":[161],"lemma.":[162],"Our":[163],"proofs":[164],"rely":[165],"two":[167],"innovations":[168],"classical":[171],"approach":[172],"using":[174],"Von":[175],"Neumann\u2019s":[176],"or":[179],"linear":[180],"programming":[181],"duality.":[182],"First,":[183],"use":[185,281],"Sion\u2019s":[186],"ratios":[195],"bilinear":[197],"functions":[198],"representing":[199],"cost":[201],"score":[203,232],"algorithms.":[205],"Second,":[206],"way":[211,247],"analyze":[213],"low-bias":[214],"algorithms":[216,278,292],"by":[217,224],"viewing":[218],"them":[219],"\u201cforecasting":[221],"algorithms\u201d":[222],"evaluated":[223],"certain":[226],"proper":[227],"scoring":[228],"rule.":[229],"expected":[231,259],"forecasting":[235,277],"algorithm":[240],"appears":[241],"more":[245],"fine-grained":[246,288],"analyzing":[249],"algorithm.":[254],"scores":[260],"have":[261],"many":[262],"elegant":[263],"mathematical":[264],"properties\u2014for":[265],"example,":[266],"they":[267],"amplified":[270],"linearly":[271],"instead":[272],"quadratically.":[274],"anticipate":[276],"will":[279],"find":[280],"in":[282,285],"future":[283],"work":[284],"analysis":[289],"small-bias":[291],"required.":[294]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}