{"id":"W4292330968","doi":"10.48550/arxiv.2202.12843","title":"Dynamic Regret of Online Mirror Descent for Relatively Smooth Convex Cost Functions","year":2022,"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","keywords":"Regret; Smoothness; Convexity; Mathematical optimization; Lipschitz continuity; Convex optimization; Convex function; Regularization (linguistics); Upper and lower bounds; Computer science; Function (biology); Bounded function; Mathematics; Regular polygon; Economics; Artificial intelligence; Mathematical analysis","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.00501918,0.001068063,0.001348753,0.0004970751,0.0007128807,0.001674176,0.001436668,0.001624084,0.001695366],"category_scores_gemma":[0.01815397,0.0005210728,0.0006806023,0.0005654214,0.0019901,0.00209317,0.001798326,0.002265667,0.0002936742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002284189,"about_ca_system_score_gemma":0.00217745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004305537,"about_ca_topic_score_gemma":0.003339326,"domain_scores_codex":[0.9981145,0.0009018169,0.00006038877,0.0003062341,0.0003816618,0.0002353143],"domain_scores_gemma":[0.9933457,0.004932057,0.00057228,0.0005133338,0.0003795371,0.0002569951],"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.0003062616,0.00007597674,0.001006529,0.00005280507,0.00003285794,0.0001115551,0.00004218756,0.9398543,0.001372736,0.04274466,0.0009064886,0.01349379],"study_design_scores_gemma":[0.00001193648,0.00003400305,0.0001478196,0.000004408148,0.000003779684,0.00001229713,0.000004276062,0.9904616,0.0003259848,0.008894346,0.00009533935,0.0000041237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1321998,0.0005722723,0.8595321,0.0009872192,0.00006145822,0.00008682384,0.0001100718,0.0004196292,0.006030616],"genre_scores_gemma":[0.9335986,0.0002492668,0.06273534,0.000181343,0.00004129942,0.00009203286,0.0001253191,0.0001023954,0.002874356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00501918,"threshold_uncertainty_score":0.02654421,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3304196183855856,"score_gpt":0.3524291442450972,"score_spread":0.02200952585951166,"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."}}