{"id":"W4285507276","doi":"10.1109/jsait.2022.3190859","title":"Successive Approximation Coding for Distributed Matrix Multiplication","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computation; Computer science; Coding (social sciences); Matrix multiplication; Algorithm; Parallel computing; Multiplication (music); Theoretical computer science; Distributed computing; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0009532269,0.0005489978,0.0004350191,0.0004650107,0.0004287695,0.0007431499,0.0007098584,0.0005519455,0.002198116],"category_scores_gemma":[0.004424367,0.0002092082,0.0002994293,0.001038341,0.0009681858,0.0009490566,0.0009356295,0.001389905,0.0006167719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008333248,"about_ca_system_score_gemma":0.001273593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002287391,"about_ca_topic_score_gemma":0.002999196,"domain_scores_codex":[0.9991726,0.0002328413,0.00003336451,0.00007473414,0.0004204162,0.00006592535],"domain_scores_gemma":[0.9984806,0.0008450763,0.00009774738,0.000247308,0.0002847147,0.00004451806],"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.0002127141,0.0000397165,0.0002879711,0.0001430953,0.0000311626,0.0001121939,0.0001842023,0.4348547,0.01413022,0.4140619,0.004552021,0.13139],"study_design_scores_gemma":[0.00001226887,0.00002647208,0.00002680344,0.00001201904,0.000003697332,0.00002464426,0.000005799427,0.9624441,0.002473034,0.03267767,0.00228732,0.000006175148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005325206,0.0002410772,0.9914967,0.0001589686,0.00006721135,0.00002504236,0.00002902863,0.000209913,0.002446853],"genre_scores_gemma":[0.4931603,0.0008259409,0.4985943,0.0002287943,0.0001687864,0.0002520548,0.0001610812,0.00009518211,0.006513484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002287391,"threshold_uncertainty_score":0.007353485,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01041348243025348,"score_gpt":0.2589577994833573,"score_spread":0.2485443170531039,"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."}}