{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955478,0.00009251061,0.000330969,0.0001361719,0.0001423397,0.0001240292,0.00468275,0.0000340654,0.00001232171],"category_scores_gemma":[0.002166603,0.00005109012,0.0006183147,0.0005763993,0.00006413827,0.0002221558,0.0009270383,0.0001623114,0.00001305066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001745879,"about_ca_system_score_gemma":0.0001325602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004660043,"about_ca_topic_score_gemma":9.419235e-7,"domain_scores_codex":[0.9988493,0.0001316292,0.0003740876,0.0001111054,0.0003329382,0.0002009749],"domain_scores_gemma":[0.9971985,0.001313755,0.000334761,0.0009438921,0.0001240576,0.00008498694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00405268,0.00008742767,0.00003929287,0.00002876439,0.0004189454,0.00003942772,0.003079365,0.0003271615,0.0005891382,0.2311757,0.3691853,0.3909768],"study_design_scores_gemma":[0.02687989,0.00006589701,0.0001642954,0.00004711061,0.00003114624,0.0001076042,0.0000345293,0.02832138,0.0009203627,0.9292282,0.01411068,0.00008891014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003939798,0.000364327,0.9420024,0.04828059,0.004471095,0.0004334807,0.00000339942,0.00007748949,0.0004273864],"genre_scores_gemma":[0.01445512,0.0001267981,0.979533,0.001051308,0.001424821,0.00001194396,3.884073e-7,0.00001850387,0.003378139],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6980525,"threshold_uncertainty_score":0.8701792,"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."}}