{"id":"W3205746337","doi":"10.1017/9781108571401.013","title":"The Upper Confidence Bound Algorithm: Bernoulli Noise","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Bernoulli's principle; Computer science; Content (measure theory); Upper and lower bounds; Algorithm; Noise (video); Mathematics; Artificial intelligence; Engineering; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002010472,0.0004772656,0.0004063394,0.00009422233,0.0009035326,0.0004872531,0.002895899,0.0002777348,0.000003441606],"category_scores_gemma":[0.00002504154,0.0004338304,0.0003012968,0.00002183886,0.0003930374,0.0001879621,0.001448481,0.001155261,0.0001179198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001238468,"about_ca_system_score_gemma":0.0002329494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002231149,"about_ca_topic_score_gemma":0.000001438692,"domain_scores_codex":[0.9977649,0.00009450949,0.0002427407,0.0008947153,0.0005693788,0.0004337762],"domain_scores_gemma":[0.9977584,0.0002480303,0.0003010123,0.001176028,0.0001958969,0.0003205712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001044382,0.000004035398,8.192428e-7,0.0000195512,0.00009187881,0.0003919001,0.00007830396,0.000004644231,0.00000594976,0.9361567,0.02600359,0.03723212],"study_design_scores_gemma":[0.0003085114,0.00007073968,0.0000106457,0.00008523139,0.0000652141,0.00004098059,0.00001522858,0.01819663,0.00006131854,0.0001669931,0.9804652,0.0005133242],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000002837443,0.0004165728,0.1297533,0.0005487389,0.0007087275,0.0002909463,0.00007110733,0.0003649839,0.8678428],"genre_scores_gemma":[0.00008264551,0.0002185659,0.003308012,0.0003192073,0.0003402551,0.000001018667,0.00001638405,0.00004124914,0.9956726],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9544616,"threshold_uncertainty_score":0.9998114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01433503421105683,"score_gpt":0.2014665379844527,"score_spread":0.1871315037733959,"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."}}