{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001478367,0.0003649159,0.0007577128,0.001005806,0.0004195031,0.00006411565,0.002171387,0.0002877956,0.001691637],"category_scores_gemma":[0.001931672,0.0003677156,0.0005400712,0.00171436,0.0005491616,0.0002979341,0.00227872,0.001164266,0.00008072273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008733117,"about_ca_system_score_gemma":0.0007514901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001386928,"about_ca_topic_score_gemma":0.0004163031,"domain_scores_codex":[0.9960281,0.0004369051,0.0006839451,0.001622314,0.0007065937,0.0005221006],"domain_scores_gemma":[0.9937764,0.002262037,0.0008928753,0.001599812,0.001219595,0.000249235],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002885645,0.001917107,0.01868009,0.0002441926,0.000700325,0.0004292351,0.0008949512,0.9402561,0.0003545513,0.01242608,0.00725459,0.01395714],"study_design_scores_gemma":[0.002943669,0.0005466479,0.02831668,0.0001318919,0.0002127153,0.000004944684,0.005435687,0.8071297,0.00008494751,0.09886728,0.05540286,0.0009229046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2519071,0.0001456275,0.7385846,0.0003710758,0.001195776,0.002155326,0.004815674,0.0001039063,0.0007209644],"genre_scores_gemma":[0.959218,0.0001795832,0.004611852,0.00003564475,0.00002719405,0.00001483236,0.0004262677,0.00004853942,0.03543806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7339727,"threshold_uncertainty_score":0.9998775,"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."}}