{"id":"W4396780329","doi":"10.1016/j.jfranklin.2024.106884","title":"Online composite optimization with time-varying regularizers","year":2024,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Regret; Metric (unit); Path (computing); Convex optimization; Upper and lower bounds; Function (biology); Regular polygon; Variation (astronomy); Convex function; Mathematical optimization; Mathematics; Computer science; Optimization problem; Online algorithm; Combinatorics; Statistics; Mathematical analysis; Physics; Engineering","routes":{"ca_aff":true,"ca_fund":false,"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.003945266,0.001789226,0.002250244,0.000809236,0.0005908298,0.002509731,0.001700069,0.002171408,0.004470748],"category_scores_gemma":[0.01568616,0.0009431105,0.0008514719,0.001408047,0.001856553,0.003560563,0.002589275,0.003268476,0.0009788483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001011027,"about_ca_system_score_gemma":0.001817221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00157549,"about_ca_topic_score_gemma":0.002200502,"domain_scores_codex":[0.997947,0.0008476104,0.0001072108,0.0004624488,0.000410152,0.0002255726],"domain_scores_gemma":[0.9882402,0.009355126,0.0005426573,0.0008252154,0.0007303526,0.0003064043],"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.001045106,0.0002974816,0.0005557354,0.0002522318,0.0001225249,0.0001321685,0.00006095214,0.8345932,0.002562899,0.08480228,0.004408583,0.07116677],"study_design_scores_gemma":[0.00002058519,0.00004771435,0.00004827214,0.000006437549,0.000009074798,0.00001226248,0.000004897933,0.9861869,0.0004920543,0.01290917,0.0002559809,0.000006709113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01609889,0.0004640049,0.9789463,0.0004565071,0.0002108153,0.00003530129,0.00008092886,0.0002451868,0.003462186],"genre_scores_gemma":[0.7113846,0.0008106426,0.2695165,0.000396293,0.0008119251,0.0002225211,0.000335113,0.0002757895,0.01624664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004470748,"threshold_uncertainty_score":0.02086478,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0543017719601523,"score_gpt":0.3727089263373512,"score_spread":0.3184071543771989,"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."}}