{"id":"W4289655150","doi":"10.1109/isit50566.2022.9834389","title":"Successive Approximation for Coded Matrix Multiplication","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computation; Multiplication (music); Matrix multiplication; Parallel computing; Computational science; Matrix (chemical analysis); Supercomputer; Algorithm; Theoretical computer science; 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.0008859158,0.0007517823,0.0005973075,0.0004797477,0.0003759629,0.0008218169,0.0008658572,0.000732562,0.004558913],"category_scores_gemma":[0.003706106,0.000266886,0.0004284688,0.0009386846,0.000924223,0.0008390261,0.0008416277,0.001546403,0.001294353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008385173,"about_ca_system_score_gemma":0.001400819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003798914,"about_ca_topic_score_gemma":0.005045788,"domain_scores_codex":[0.9993918,0.0001774141,0.0000223971,0.00005564595,0.0003015304,0.00005115128],"domain_scores_gemma":[0.9990246,0.000554448,0.00005780267,0.0001117588,0.0002212359,0.00003009111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001211238,0.00003531387,0.0002742345,0.0001799017,0.00004119914,0.0001012699,0.0001294035,0.6163551,0.005509832,0.2861814,0.004291184,0.08678003],"study_design_scores_gemma":[0.000006157509,0.000009867938,0.00001245781,0.000006554134,0.000001866224,0.00001220641,0.000003335714,0.9856603,0.0006472815,0.01171449,0.001922765,0.0000027263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002263032,0.0002335865,0.9938304,0.0001267117,0.00008354814,0.00002524809,0.00002132588,0.0001616586,0.003254467],"genre_scores_gemma":[0.2882822,0.001044821,0.6954861,0.0002116694,0.0001524332,0.0002966007,0.000154881,0.0001710459,0.01420025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004558913,"threshold_uncertainty_score":0.0152511,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01043538658053691,"score_gpt":0.2684972520790731,"score_spread":0.2580618654985362,"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."}}