{"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002249349,0.0002212935,0.000255483,0.00013735,0.0004890793,0.001149582,0.0006936816,0.00011079,0.000003255679],"category_scores_gemma":[0.0001270151,0.0002062568,0.00008044274,0.0009173931,0.00004285972,0.004853723,0.0001270114,0.0001673808,0.00001209033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000048339,"about_ca_system_score_gemma":0.00009034965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003491597,"about_ca_topic_score_gemma":0.000003900599,"domain_scores_codex":[0.9983018,0.00003269886,0.0007000995,0.0002808482,0.0003585197,0.0003260326],"domain_scores_gemma":[0.9984404,0.00003894259,0.0004477886,0.0002837016,0.0006443315,0.0001448075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008322436,0.000125876,0.0001163498,0.003409875,0.00005489868,0.0000032926,0.01030444,0.04290573,0.0004458133,0.005017352,0.003739072,0.9337941],"study_design_scores_gemma":[0.000609955,0.0001515629,0.00005660218,0.0000514738,0.000007486164,0.00002493404,0.000111437,0.9657679,0.0001098456,0.0002379466,0.03262254,0.000248336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009255664,0.0001767869,0.9935031,0.003253481,0.000838834,0.0006638707,0.00004458262,0.0005183242,0.00007546878],"genre_scores_gemma":[0.7053811,0.00002389546,0.2870251,0.005156613,0.001038219,0.0002995576,0.0008940514,0.0000446995,0.0001367487],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9335458,"threshold_uncertainty_score":0.9998873,"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."}}