{"id":"W2997790181","doi":"10.1609/aaai.v34i04.5821","title":"Robust Stochastic Bandit Algorithms under Probabilistic Unbounded Adversarial Attack","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lockheed Martin (Canada)","funders":"Division of Electrical, Communications and Cyber Systems; National Science Foundation","keywords":"Regret; Sublinear function; Probabilistic logic; Attack model; Computer science; Bounded function; Expected value; Algorithm; Adversary; Mathematical optimization; Mathematics; Discrete mathematics; Artificial intelligence; Machine learning; Computer security; Statistics","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":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001690232,0.0004250077,0.0006628394,0.0002423065,0.0004461524,0.000673947,0.003611992,0.0001903382,0.001352113],"category_scores_gemma":[0.01377318,0.0002878188,0.0002818615,0.002313053,0.001230178,0.0006436964,0.0008037522,0.0008184405,0.001071697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001503396,"about_ca_system_score_gemma":0.0003875942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002751723,"about_ca_topic_score_gemma":0.00001882831,"domain_scores_codex":[0.9932614,0.00007929048,0.001404028,0.001264595,0.00324796,0.0007427293],"domain_scores_gemma":[0.9946414,0.001121555,0.0007771945,0.000520891,0.002527823,0.0004111215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002902007,0.0009754285,0.000163907,0.0001519095,0.0001829806,0.000009917344,0.007611756,0.3701377,0.01961957,0.4338343,0.006590581,0.15782],"study_design_scores_gemma":[0.0001621017,0.0006208702,0.0001487123,0.0001245697,0.00003567132,0.000007014631,0.0038536,0.5632754,0.03220922,0.3987413,0.0003440621,0.0004775067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09308951,0.00006989919,0.8512163,0.03971437,0.002447054,0.003533965,0.000148824,0.000319023,0.009461112],"genre_scores_gemma":[0.9963988,0.000008357762,0.001940126,0.0004093796,0.0004630426,0.00004746302,0.000001771836,0.00003664723,0.0006943809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9033093,"threshold_uncertainty_score":0.9999574,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.4478936109603608,"score_gpt":0.4201507851199051,"score_spread":0.02774282584045568,"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."}}