{"id":"W2894591993","doi":"10.1109/allerton.2018.8635903","title":"Anytime Stochastic Gradient Descent: A Time to Hear from all the Workers","year":2018,"lang":"en","type":"article","venue":"","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Stochastic gradient descent; Exploit; Computation; Convergence (economics); Node (physics); Distributed computing; Focus (optics); Acceleration; Algorithm; Artificial intelligence; Computer security; 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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002446552,0.0001902263,0.0001569668,0.0001307127,0.000181793,0.0002101065,0.001367882,0.00005314614,0.0006155111],"category_scores_gemma":[0.0001098468,0.000132649,0.00006325654,0.0006248078,0.0001257867,0.0001973467,0.0004641919,0.00009702584,0.003690452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000864831,"about_ca_system_score_gemma":0.00004505644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001561146,"about_ca_topic_score_gemma":0.00001022864,"domain_scores_codex":[0.9983991,0.00005860076,0.0002439043,0.0005169059,0.0003644166,0.0004170908],"domain_scores_gemma":[0.9984329,0.000173884,0.00006499777,0.0009654193,0.0001389831,0.0002238482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002031854,0.0008324484,0.0003188636,0.000009659587,0.0004608942,0.00002984888,0.0237719,0.01352679,0.005080279,0.143263,0.7517296,0.06077356],"study_design_scores_gemma":[0.0005347032,0.0008912885,0.001278908,0.0001081032,0.00003799214,0.00002333514,0.00008148056,0.9675542,0.00349057,0.01442274,0.01082319,0.0007535309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00167066,0.00001969074,0.9894232,0.004543613,0.0002605341,0.0005574867,0.0000039672,0.0007274958,0.002793333],"genre_scores_gemma":[0.3236048,8.193451e-7,0.6650056,0.007470044,0.000268402,0.0001149503,0.000007663199,0.00003746873,0.003490296],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9540274,"threshold_uncertainty_score":0.9970853,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01617655381045896,"score_gpt":0.2389224668351279,"score_spread":0.2227459130246689,"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."}}