{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390747,0.0001441012,0.0001552701,0.0007920043,0.0005776695,0.0002615311,0.0006742533,0.00005467069,0.00002664305],"category_scores_gemma":[0.001073963,0.0001460672,0.00006016118,0.001294244,0.00002063594,0.001992048,0.00006350097,0.000386559,0.000007505038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006075131,"about_ca_system_score_gemma":0.0001434838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001163396,"about_ca_topic_score_gemma":2.033226e-7,"domain_scores_codex":[0.9982218,0.0002398319,0.0006767771,0.0001468902,0.000460856,0.0002538533],"domain_scores_gemma":[0.9975579,0.0005869935,0.0009880266,0.0002394566,0.0005551892,0.00007244692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002863519,0.0001411579,0.0000974431,0.00002558053,0.00002489576,0.000001614621,0.002703091,0.2304682,0.0003521449,0.7473645,0.001918262,0.01661671],"study_design_scores_gemma":[0.00153139,0.0003114153,0.0005114102,0.00004395937,0.000008545783,0.000120401,0.0003521715,0.9283648,0.004038246,0.06349031,0.0009578224,0.0002695898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003506773,0.00001041573,0.9944336,0.0003444865,0.0004929923,0.0007030302,0.00005231981,0.0002485474,0.0002078082],"genre_scores_gemma":[0.9583608,0.000008141237,0.04043365,0.0003712591,0.00005908563,0.0004967032,0.0002353493,0.00001137,0.00002367931],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.954854,"threshold_uncertainty_score":0.5956446,"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."}}