{"id":"W3127553026","doi":"10.1109/focs46700.2020.00045","title":"A New Minimax Theorem for Randomized Algorithms (Extended Abstract)","year":2020,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minimax; Computer science; Minimax theorem; Algorithm; Mathematics; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":false,"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.0004609425,0.0001956153,0.0004672252,0.00005888326,0.0001250831,0.0002360267,0.001152497,0.00006218922,0.0003426489],"category_scores_gemma":[0.00021911,0.0001527678,0.0003910582,0.00034163,0.00008325739,0.0003414839,0.0002235547,0.0001270179,0.00007563383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001045013,"about_ca_system_score_gemma":0.0001178484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003175929,"about_ca_topic_score_gemma":0.000003206656,"domain_scores_codex":[0.9984792,0.00004696762,0.0003689908,0.0005071916,0.0002597563,0.0003379137],"domain_scores_gemma":[0.9984096,0.0007275278,0.00009887129,0.000379238,0.00007694938,0.0003078589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001480667,0.00003544718,5.612893e-7,0.00001550457,0.00005881866,0.000008579429,0.0007617914,0.00000982703,0.0001041156,0.7528417,0.01413514,0.2305479],"study_design_scores_gemma":[0.08047298,0.0001507228,0.00003797574,0.00001243699,0.00002492426,0.00001243231,0.00005768293,0.4457041,0.003014059,0.4427097,0.02738598,0.0004170331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005864687,0.0001324458,0.9729586,0.01299596,0.0003603818,0.000731757,0.000005301123,0.000426804,0.01233015],"genre_scores_gemma":[0.0235641,0.00001757419,0.9708554,0.003988462,0.0004337241,0.00006476715,0.000005175735,0.00001518988,0.001055574],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4456943,"threshold_uncertainty_score":0.622969,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0333413938213585,"score_gpt":0.2703619376936957,"score_spread":0.2370205438723372,"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."}}