{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110182,0.0002138024,0.0001660527,0.0005159269,0.0005854583,0.0003233983,0.001552426,0.00006622474,0.0001960811],"category_scores_gemma":[0.0002187267,0.0002332048,0.0001364686,0.0004790433,0.00003844188,0.00238317,0.0002716606,0.000213105,0.0000874314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006089481,"about_ca_system_score_gemma":0.00006695859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006867884,"about_ca_topic_score_gemma":3.063622e-7,"domain_scores_codex":[0.9976591,0.0001486957,0.0006984644,0.0003363116,0.0009162698,0.0002411968],"domain_scores_gemma":[0.9977254,0.0005250199,0.000698136,0.0005133987,0.0004623975,0.0000756302],"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.0001795452,0.0001017767,0.00001528256,0.00001522738,0.00004218325,4.243816e-7,0.00168011,0.1012936,0.001123175,0.8862233,0.004367638,0.00495783],"study_design_scores_gemma":[0.001150449,0.0002634008,0.00003925464,0.0000137947,0.00001230508,0.00002060552,0.0003043804,0.9288583,0.0103935,0.04604097,0.01257199,0.0003310167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001054449,0.000007342544,0.9872631,0.002316536,0.002065894,0.00122951,0.0002208583,0.0005393215,0.005302976],"genre_scores_gemma":[0.9276741,0.00001546235,0.05921027,0.003540788,0.0002567953,0.005465972,0.001819944,0.00004205042,0.00197469],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9280528,"threshold_uncertainty_score":0.9509816,"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."}}