{"id":"W3209648960","doi":"10.1145/3520484","title":"Sparsity-Specific Code Optimization using Expression Trees","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Advanced Micro Devices; National Science Foundation","keywords":"Computer science; Parallel computing; Computation; Code (set theory); Kernel (algebra); Graph; Graphics; Generator (circuit theory); Computer graphics; Source code; Set (abstract data type); Algorithm; Code generation; Computational science; Theoretical computer science; Computer graphics (images); Key (lock); Mathematics; Programming language","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.0004993113,0.0008292336,0.0004261502,0.0005485859,0.0003693801,0.0006690622,0.001265014,0.0004977147,0.004415066],"category_scores_gemma":[0.002916947,0.000382148,0.0007313646,0.0006844603,0.0006384176,0.0008645234,0.00103634,0.001310371,0.002416266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005100624,"about_ca_system_score_gemma":0.001300207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001356827,"about_ca_topic_score_gemma":0.002207791,"domain_scores_codex":[0.9993188,0.0001216537,0.0000497002,0.0001044018,0.0002952222,0.0001102301],"domain_scores_gemma":[0.9990323,0.0003174018,0.00007863434,0.0002833231,0.0002491121,0.00003933388],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004870832,0.0003581856,0.005070717,0.0004572994,0.0001044878,0.0005199512,0.0004121076,0.3346803,0.1171846,0.07658747,0.03888962,0.4252481],"study_design_scores_gemma":[0.00007275903,0.00008419156,0.0003434293,0.00002248977,0.00001991988,0.0001007645,0.00004287943,0.913789,0.04628662,0.01992613,0.01928975,0.00002207547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03146704,0.0001190518,0.9435631,0.0002060188,0.00008247612,0.0001297509,0.0003377783,0.0173524,0.006742453],"genre_scores_gemma":[0.2372843,0.0001675031,0.7466965,0.0003020872,0.00004575428,0.0004105831,0.001602773,0.007697873,0.005792561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004415066,"threshold_uncertainty_score":0.01476985,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.054818163909668,"score_gpt":0.2913854049049199,"score_spread":0.2365672409952519,"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."}}