{"id":"W4214636767","doi":"10.1109/lcsys.2022.3155067","title":"Dynamic Regret of Online Mirror Descent for Relatively Smooth Convex Cost Functions","year":2022,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Convexity; Smoothness; Mathematical optimization; Lipschitz continuity; Convex optimization; Convex function; Regularization (linguistics); Upper and lower bounds; Mathematics; Function (biology); Bounded function; Computer science; Regular polygon; Artificial intelligence; Economics; Mathematical analysis","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004738177,0.001167963,0.001379049,0.0004639819,0.0006712439,0.001569991,0.001443258,0.001611799,0.001732246],"category_scores_gemma":[0.01596639,0.0005442151,0.0007065851,0.0004940105,0.002043679,0.001935823,0.001776042,0.0021743,0.0002790795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002147483,"about_ca_system_score_gemma":0.002149876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004110126,"about_ca_topic_score_gemma":0.003024249,"domain_scores_codex":[0.9981524,0.0008234478,0.00006149666,0.0003030236,0.0003988225,0.0002606823],"domain_scores_gemma":[0.9939542,0.004395813,0.0005531805,0.000466737,0.0003813767,0.0002485984],"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.0002516169,0.00005665537,0.0007208104,0.00004409645,0.00002673613,0.000109539,0.00003217756,0.9582618,0.001428404,0.02868069,0.0006644426,0.009723043],"study_design_scores_gemma":[0.000009794539,0.00003642647,0.0001345882,0.000003842048,0.000003146416,0.00001385999,0.000003881172,0.9936139,0.0003156108,0.005782227,0.00007839851,0.000004352888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1040244,0.000508224,0.8891774,0.0007535544,0.00005843051,0.00007875481,0.00009123458,0.0003684948,0.004939454],"genre_scores_gemma":[0.9443352,0.0002204564,0.05236114,0.0001728815,0.00003782861,0.00008756656,0.0001019753,0.00009495058,0.002588063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004738177,"threshold_uncertainty_score":0.02505821,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09309093525136584,"score_gpt":0.3857145837651675,"score_spread":0.2926236485138016,"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."}}