{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001852464,0.001641077,0.00210767,0.00114397,0.0006599061,0.001238503,0.002143829,0.002486402,0.01068609],"category_scores_gemma":[0.004934362,0.001040409,0.001063379,0.001146707,0.0007533919,0.001474578,0.00207207,0.002627061,0.004732334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007193605,"about_ca_system_score_gemma":0.001898706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00303253,"about_ca_topic_score_gemma":0.003779973,"domain_scores_codex":[0.9988745,0.0003959994,0.00005383376,0.0001240388,0.0004839866,0.00006760049],"domain_scores_gemma":[0.9983321,0.0008026463,0.00006672597,0.0001554024,0.0005266748,0.0001165037],"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.0005279907,0.0003519122,0.0004436445,0.0005789629,0.0002235297,0.0002472338,0.0001116697,0.4672699,0.01636049,0.06658293,0.02053745,0.4267644],"study_design_scores_gemma":[0.00002929842,0.00004247576,0.00003798812,0.000008320573,0.000005583351,0.00002542005,0.000002545757,0.9945427,0.0006077394,0.003082739,0.001607696,0.000007496894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00117398,0.0001367577,0.9966353,0.00006945786,0.00009985111,0.00006245073,0.00003675595,0.000658,0.001127484],"genre_scores_gemma":[0.05521537,0.0002302892,0.936686,0.0001679521,0.0001539821,0.0004482383,0.0002650585,0.000575464,0.006257652],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01068609,"threshold_uncertainty_score":0.03574854,"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."}}