{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007509952,0.001804163,0.002151412,0.001847724,0.001394401,0.004586724,0.003186567,0.002497118,0.009037875],"category_scores_gemma":[0.0268657,0.0009633174,0.002897876,0.002874097,0.005724477,0.01069641,0.004426293,0.0109852,0.002102377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003720687,"about_ca_system_score_gemma":0.002120502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001084081,"about_ca_topic_score_gemma":0.0007648931,"domain_scores_codex":[0.9934396,0.00200938,0.0003058089,0.001650648,0.002085399,0.0005092052],"domain_scores_gemma":[0.9848705,0.01099997,0.0006779267,0.001838902,0.001317295,0.0002953781],"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.0000657188,0.00004225816,0.0002779143,0.0001432843,0.00005380719,0.000058971,0.00009564163,0.01986206,0.0009706656,0.9520193,0.00636653,0.02004372],"study_design_scores_gemma":[0.00004499922,0.00005692011,0.0001736819,0.00004558457,0.00002201655,0.00006712234,0.00001125162,0.1079369,0.0009031614,0.8832698,0.007446039,0.0000224911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006622054,0.001537193,0.9724762,0.003746877,0.0004890187,0.00009760197,0.000318313,0.0004441376,0.01426853],"genre_scores_gemma":[0.4727682,0.004681241,0.469831,0.007725891,0.004889425,0.002320695,0.0009002181,0.001234234,0.03564916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009037875,"threshold_uncertainty_score":0.0397169,"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."}}