{"id":"W4381568467","doi":"10.48550/arxiv.2306.10835","title":"Online Dynamic Submodular Optimization","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Submodular set function; Regret; Mathematical optimization; Online algorithm; Computer science; Gradient descent; Function (biology); Optimization problem; Time horizon; Upper and lower bounds; Approximation algorithm; Mathematics; Artificial intelligence; Artificial neural network","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014631,0.001546211,0.001651962,0.000591773,0.0005548915,0.001473177,0.002099771,0.001570358,0.00418964],"category_scores_gemma":[0.004782831,0.0006248081,0.0007592295,0.00126308,0.00109935,0.00202433,0.002027239,0.002541628,0.001039539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001355961,"about_ca_system_score_gemma":0.001853264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002007441,"about_ca_topic_score_gemma":0.002975374,"domain_scores_codex":[0.9987478,0.0004525838,0.00004050404,0.0002930467,0.0002714598,0.0001945991],"domain_scores_gemma":[0.9979387,0.001222404,0.0002146648,0.0003408391,0.0001611656,0.000122238],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001782516,0.0002680881,0.0005412898,0.0001707624,0.0000595661,0.00008749907,0.00006337611,0.7969048,0.001619673,0.07010331,0.01192886,0.1180745],"study_design_scores_gemma":[0.0000210085,0.00002470159,0.00004085417,0.000006506614,0.000003452916,0.0000162077,0.000006466159,0.9782171,0.0002844552,0.02036542,0.001009936,0.000003944768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00788277,0.0003155837,0.9855855,0.0004877177,0.00006656356,0.000091194,0.0001345665,0.0007437485,0.004692385],"genre_scores_gemma":[0.4470163,0.0005183397,0.5433095,0.0007397274,0.0001690483,0.0005350185,0.0006926554,0.0003751524,0.006644288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00418964,"threshold_uncertainty_score":0.01401573,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3093324176986729,"score_gpt":0.330028422291579,"score_spread":0.0206960045929061,"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."}}