{"id":"W2806928859","doi":"10.1609/aaai.v32i1.12183","title":"Imitation Upper Confidence Bound for Bandits on a Graph","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Institut de Valorisation des Données","keywords":"Graph; Upper and lower bounds; Computer science; Imitation; Extension (predicate logic); Theoretical computer science; Mathematics; Mathematical optimization; Artificial intelligence; Psychology","routes":{"ca_aff":true,"ca_fund":true,"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":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002523905,0.0002711675,0.0003760135,0.0004398141,0.0005857067,0.0005577184,0.00227534,0.0001312933,0.0005105612],"category_scores_gemma":[0.01248803,0.0001765314,0.0002215828,0.00139474,0.001357473,0.0005461868,0.0002161681,0.000317042,0.0006867611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006789115,"about_ca_system_score_gemma":0.000168303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002103664,"about_ca_topic_score_gemma":0.00003376189,"domain_scores_codex":[0.9955236,0.00004129295,0.0009455759,0.0008645182,0.002071181,0.0005538819],"domain_scores_gemma":[0.9924998,0.001565899,0.0006297093,0.0004750876,0.004678448,0.0001510564],"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.001176041,0.0002417044,0.0002648122,0.00002440372,0.00002666757,4.271731e-7,0.002127091,0.0001040278,0.03758285,0.7951377,0.003893123,0.1594212],"study_design_scores_gemma":[0.00004610674,0.000716935,0.0003428815,0.0001074514,0.00000670871,0.000001742459,0.001210273,0.0119513,0.3999859,0.5846598,0.0008148344,0.0001560036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6739271,0.00006572068,0.2665839,0.01653489,0.003677525,0.004420714,0.0001553338,0.0001959037,0.03443891],"genre_scores_gemma":[0.9959992,0.00002031191,0.001545956,0.0003073197,0.0003062083,0.00009903599,9.328633e-7,0.0000215354,0.001699509],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3624031,"threshold_uncertainty_score":0.9958302,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3119812843693419,"score_gpt":0.4631698758885268,"score_spread":0.151188591519185,"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."}}