{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004953699,0.001709956,0.002827431,0.002478895,0.0008057887,0.004014308,0.004939014,0.003243152,0.01975488],"category_scores_gemma":[0.03314962,0.001103555,0.001213879,0.00411077,0.001765686,0.004166555,0.004295626,0.005985213,0.01372227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001181733,"about_ca_system_score_gemma":0.002590002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003719784,"about_ca_topic_score_gemma":0.002759754,"domain_scores_codex":[0.9954349,0.001547006,0.0002201626,0.0007355408,0.001811127,0.0002512487],"domain_scores_gemma":[0.9887445,0.00818514,0.0003102128,0.00131038,0.001235269,0.0002145398],"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.0003317839,0.00009367289,0.0005116915,0.0003943838,0.0001575833,0.0001156945,0.00009900767,0.1161104,0.001321034,0.1138946,0.05672967,0.7102404],"study_design_scores_gemma":[0.0000662641,0.00003880678,0.0002461214,0.0001679403,0.00005288963,0.0002503879,0.00001998866,0.8265072,0.002585689,0.1453227,0.02468315,0.00005900918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005325817,0.001675959,0.9913709,0.0003400915,0.0002370967,0.00002771236,0.0001218054,0.001033011,0.004660667],"genre_scores_gemma":[0.04406979,0.003827331,0.9204404,0.0009970339,0.001020905,0.000400667,0.001402391,0.001782395,0.02605896],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01975488,"threshold_uncertainty_score":0.06608665,"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."}}