{"id":"W4294691466","doi":"10.23919/acc53348.2022.9867309","title":"Dynamic Regret Bounds without Lipschitz Continuity: Online Convex Optimization with Multiple Mirror Descent Steps","year":2022,"lang":"en","type":"article","venue":"2022 American Control Conference (ACC)","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Lipschitz continuity; Path (computing); Mathematical optimization; Convex optimization; Upper and lower bounds; Gradient descent; Mathematics; Path length; Sequence (biology); Regular polygon; Computer science; Artificial intelligence; Statistics; 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.005255562,0.002244114,0.002157708,0.0006904881,0.0008919062,0.002186632,0.002786006,0.001850999,0.003330674],"category_scores_gemma":[0.0294845,0.0009287113,0.001209724,0.000969309,0.002377071,0.004567646,0.003005063,0.003978761,0.0005402613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002421142,"about_ca_system_score_gemma":0.002474627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003566859,"about_ca_topic_score_gemma":0.00283503,"domain_scores_codex":[0.9970077,0.001101477,0.0001188059,0.0005635984,0.0007901286,0.0004182796],"domain_scores_gemma":[0.9815677,0.01340906,0.001483781,0.001934115,0.001019925,0.0005854266],"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.0003437217,0.0001814156,0.001738908,0.0001674448,0.00009575737,0.000201018,0.00008585379,0.907856,0.00224584,0.05123664,0.00294366,0.03290371],"study_design_scores_gemma":[0.00001123163,0.00004605237,0.0001465909,0.00001165974,0.000008160379,0.00002537016,0.000006621667,0.989037,0.0004567119,0.009977641,0.0002658262,0.000007151874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03454418,0.00180314,0.9553159,0.001223758,0.0001281078,0.0001075337,0.0001695415,0.000444674,0.006263145],"genre_scores_gemma":[0.8490126,0.001397024,0.1416997,0.0007805467,0.0002630989,0.0003090007,0.0003134781,0.0003395447,0.005885089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005255562,"threshold_uncertainty_score":0.02779442,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0478450906761866,"score_gpt":0.3652658143209036,"score_spread":0.317420723644717,"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."}}