{"id":"W3162206701","doi":"10.1017/9781108571401.010","title":"The Upper Confidence Bound Algorithm","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Algorithm; Computer science; Upper and lower bounds; Mathematics; Mathematical analysis","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.004628044,0.002269197,0.00328023,0.004145395,0.001463917,0.005339501,0.00548668,0.003296091,0.04686476],"category_scores_gemma":[0.03211682,0.001209058,0.002109233,0.005484107,0.001577729,0.004870749,0.00494272,0.006277093,0.03101474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001589338,"about_ca_system_score_gemma":0.003905648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005563824,"about_ca_topic_score_gemma":0.004080416,"domain_scores_codex":[0.993513,0.001901331,0.0003675346,0.001435475,0.002247945,0.0005347482],"domain_scores_gemma":[0.9888852,0.006179662,0.0003748106,0.002342982,0.001932192,0.0002851972],"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.0003744791,0.0001664169,0.0008653169,0.0004774306,0.0002522942,0.0001277748,0.00006988252,0.05340625,0.001256117,0.07832759,0.09722539,0.767451],"study_design_scores_gemma":[0.0001642442,0.0001227504,0.0008437664,0.0003028958,0.0001925935,0.0006221487,0.00006716166,0.6332234,0.004936192,0.2857612,0.07366588,0.00009776364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001542168,0.003656861,0.9707246,0.0007977833,0.0005004122,0.000130901,0.0009286585,0.002833795,0.01888485],"genre_scores_gemma":[0.08737549,0.004934872,0.8454295,0.001497155,0.001365163,0.0007556534,0.007593211,0.002666632,0.04838237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04686476,"threshold_uncertainty_score":0.1567782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01470990901681131,"score_gpt":0.2009729710251998,"score_spread":0.1862630620083885,"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."}}