{"id":"W3008901784","doi":"10.1145/3626514","title":"A New Minimax Theorem for Randomized Algorithms","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Minimax; Mathematics; Randomized algorithm; Discrete mathematics; Algorithm; Bounded function; Computer science; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0103168,0.001567684,0.002365758,0.001789511,0.001557787,0.005157389,0.003418468,0.003121815,0.006284796],"category_scores_gemma":[0.03763332,0.001050716,0.002398315,0.001850751,0.006902821,0.01247772,0.004488651,0.01092287,0.001363163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00393,"about_ca_system_score_gemma":0.002549368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006913758,"about_ca_topic_score_gemma":0.0005233425,"domain_scores_codex":[0.9902395,0.003320868,0.0004627568,0.002320709,0.002957968,0.0006981624],"domain_scores_gemma":[0.9752993,0.01937062,0.0008948111,0.002559208,0.00144229,0.0004337729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005372411,0.00002958423,0.0002683167,0.0000833103,0.00004209244,0.00003262039,0.00008129881,0.02211777,0.000865053,0.9625469,0.002200666,0.01167857],"study_design_scores_gemma":[0.00004874235,0.00006035816,0.000126432,0.00004208639,0.00001692272,0.00004811107,0.00001419881,0.1477435,0.001000697,0.8468161,0.004062254,0.00002049592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009838562,0.0008638729,0.9716668,0.003270437,0.000213105,0.000102703,0.0002309995,0.0004107041,0.01340286],"genre_scores_gemma":[0.5657648,0.002337894,0.3969308,0.004421608,0.002049153,0.001731555,0.0006085288,0.001033998,0.02512161],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0103168,"threshold_uncertainty_score":0.05456114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03469313745623095,"score_gpt":0.2916385897286021,"score_spread":0.2569454522723712,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}