{"id":"W4386988712","doi":"10.1007/s11081-023-09836-6","title":"A fast non-monotone line search for stochastic gradient descent","year":2023,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Stochastic gradient descent; Monotone polygon; Line search; Descent direction; Convergence (economics); Mathematical optimization; Descent (aeronautics); Mathematics; Line (geometry); Interpolation (computer graphics); Gradient descent; Computer science; Regular polygon; Applied mathematics; Algorithm; Artificial intelligence; Path (computing)","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.0001890408,0.0001322981,0.0001278565,0.0003374979,0.0001019106,0.0001103559,0.0001997094,0.00004898803,0.000003307273],"category_scores_gemma":[0.00005841871,0.0001400786,0.0000325326,0.0007031357,0.00001221052,0.0001945489,0.0001177848,0.00006321605,0.000004700455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003892887,"about_ca_system_score_gemma":0.00001848311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002382749,"about_ca_topic_score_gemma":1.940433e-7,"domain_scores_codex":[0.9991031,0.00000584892,0.0001806003,0.0002831482,0.000143721,0.0002835334],"domain_scores_gemma":[0.9994718,0.00008053849,0.00002982916,0.000203656,0.00009790824,0.0001162785],"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.000002267888,0.00001216755,0.000005514577,0.00002751074,0.000007217689,8.789253e-7,0.0003021482,0.9907073,0.0001769361,0.007406491,0.0000731142,0.001278431],"study_design_scores_gemma":[0.0003024144,0.00007245153,0.0000766685,0.00003994945,0.000004652187,0.000005266193,0.00001620769,0.9986345,0.0006242142,0.00003919701,0.00003486218,0.0001496711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009789275,0.00001847704,0.9972527,0.0002733528,0.0002218016,0.00045595,0.000004353349,0.0007677964,0.00002664638],"genre_scores_gemma":[0.2994004,0.00005538368,0.7000394,0.00004556027,0.00005669493,0.0002111407,0.00004331331,0.00003408454,0.0001139364],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2984215,"threshold_uncertainty_score":0.5712239,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01724247180531733,"score_gpt":0.2414483519281693,"score_spread":0.224205880122852,"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."}}