{"id":"W3158960540","doi":"10.1007/s10107-022-01839-y","title":"An optimal gradient method for smooth strongly convex minimization","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"Google (Canada)","funders":"H2020 European Research Council; Agence Nationale de la Recherche","keywords":"Mathematics; Constructive; Oracle; Mathematical optimization; Class (philosophy); Minification; Regular polygon; Point (geometry); Convex optimization; Upper and lower bounds; Proximal Gradient Methods; Sequence (biology); Computer science; Mathematical analysis","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002642268,0.0001313708,0.000193177,0.00006400565,0.0001600612,0.00006432994,0.0001646322,0.00003567687,0.00009487027],"category_scores_gemma":[0.00002777839,0.0001343757,0.00007170037,0.0001125586,0.0000213193,0.00007044979,0.00004550794,0.000130113,0.000002452675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005739657,"about_ca_system_score_gemma":0.00000744409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001259674,"about_ca_topic_score_gemma":2.998443e-7,"domain_scores_codex":[0.9991113,0.00004541555,0.0002205312,0.0001782552,0.0001690488,0.0002754321],"domain_scores_gemma":[0.9995349,0.0001016451,0.00003446746,0.0002252204,0.00003105677,0.0000726945],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008849316,0.000728439,0.00002557857,0.0003696808,0.0001600114,0.000024471,0.003463461,0.3419082,0.006678778,0.07655703,0.003030368,0.5669655],"study_design_scores_gemma":[0.0001832696,0.0002305905,0.000003726251,0.00001472268,0.00003304882,0.00001413442,0.0004774613,0.9721146,0.004645874,0.006338435,0.01576077,0.000183391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01896266,0.00005453971,0.9788982,0.00003321904,0.00008916826,0.0005550465,0.000006387281,0.0009711196,0.0004296955],"genre_scores_gemma":[0.4264705,5.208022e-7,0.5730935,0.00001690071,0.00003811752,0.00030589,0.00002260839,0.00003745606,0.00001445697],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6302063,"threshold_uncertainty_score":0.547968,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0240464595519915,"score_gpt":0.2911768973617581,"score_spread":0.2671304378097666,"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."}}