{"id":"W3099873237","doi":"","title":"Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Regret; Computer science; Maximization; Order (exchange); Algorithm; Approximation algorithm; Mathematical optimization; Mathematics; Machine learning","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.006489846,0.004169527,0.004065565,0.002315552,0.001452802,0.00492709,0.007571765,0.004190541,0.01670684],"category_scores_gemma":[0.03128014,0.001888958,0.002622485,0.003687016,0.002656069,0.009638143,0.005700934,0.01027653,0.005016794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00410941,"about_ca_system_score_gemma":0.004779099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004448918,"about_ca_topic_score_gemma":0.008058358,"domain_scores_codex":[0.9948014,0.001772145,0.0002734612,0.0009955202,0.001367335,0.0007901536],"domain_scores_gemma":[0.9772019,0.01722409,0.0008228455,0.002540199,0.001599345,0.000611656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005646895,0.0007711775,0.0008346552,0.0005848759,0.0001939281,0.0001416757,0.0002700397,0.5662181,0.002446612,0.180851,0.02973805,0.2173852],"study_design_scores_gemma":[0.00004533282,0.00003814455,0.0001117915,0.00002739973,0.00002208637,0.00002993209,0.0000178993,0.9207066,0.0005295198,0.07747309,0.0009810813,0.00001718707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004580743,0.0008008614,0.9865568,0.0006433047,0.0002138458,0.0001162109,0.0002152927,0.001024193,0.005848662],"genre_scores_gemma":[0.2062551,0.001055329,0.7722706,0.001103906,0.0007913593,0.0008896793,0.001244035,0.001662464,0.01472765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01670684,"threshold_uncertainty_score":0.05589002,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04129501515726763,"score_gpt":0.2603703165956456,"score_spread":0.219075301438378,"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."}}