{"id":"W2963179285","doi":"","title":"A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds.","year":2017,"lang":"en","type":"article","venue":"Spiral (Imperial College London)","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematical proof; Regret; Computer science; Mathematical optimization; Generalization; Modular design; Convex analysis; Gradient descent; Convex optimization; Regular polygon; Theoretical computer science; Mathematics; Artificial intelligence; Machine learning; Artificial neural network","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.005965238,0.001616037,0.001011276,0.001029311,0.0005359085,0.001853649,0.002215088,0.001670747,0.003807232],"category_scores_gemma":[0.01883811,0.0006826466,0.001329238,0.0009520498,0.003081104,0.00507923,0.003715644,0.006069391,0.0006824752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00173814,"about_ca_system_score_gemma":0.001460634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008968854,"about_ca_topic_score_gemma":0.000926797,"domain_scores_codex":[0.9976312,0.001039706,0.00008133036,0.0004032849,0.0006703002,0.0001741546],"domain_scores_gemma":[0.9930189,0.004980912,0.0004858072,0.0007031032,0.0005100624,0.0003011476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005521384,0.00006299721,0.0005931021,0.0002074554,0.0001003058,0.00006185839,0.0001542505,0.1764925,0.002297712,0.7758441,0.003599564,0.04053097],"study_design_scores_gemma":[0.00001084151,0.0000584795,0.000244356,0.00003775735,0.00002553139,0.00004604147,0.00001624935,0.6708438,0.001050935,0.3248907,0.002758516,0.00001677485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00311008,0.0007009285,0.9919751,0.0005113948,0.00005547514,0.00002327733,0.00002584658,0.0000598058,0.0035379],"genre_scores_gemma":[0.4622783,0.00265338,0.5213702,0.0009398939,0.0007019045,0.0003023965,0.0001990756,0.0003759264,0.0111789],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005965238,"threshold_uncertainty_score":0.03154755,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01233699994632156,"score_gpt":0.2446377531609609,"score_spread":0.2323007532146393,"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."}}