{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002808763,0.0001693218,0.0001470035,0.0007296748,0.00128134,0.0001612042,0.001215536,0.0000612066,0.00009224632],"category_scores_gemma":[0.000004492814,0.0001906877,0.0001440708,0.001808203,0.00004615653,0.0003957548,0.00009501796,0.0003412153,0.000001300969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006101899,"about_ca_system_score_gemma":0.00004294885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001248375,"about_ca_topic_score_gemma":0.000006377272,"domain_scores_codex":[0.9983823,0.0001757656,0.0002650753,0.0004658365,0.0004939206,0.0002171423],"domain_scores_gemma":[0.9985991,0.00009559849,0.0001139603,0.001014682,0.00009598259,0.00008067626],"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.00004301049,0.001118715,0.0003641852,0.00001650331,0.00005159552,0.00002095701,0.001371472,0.6838676,0.001660174,0.2941952,0.001395289,0.01589532],"study_design_scores_gemma":[0.000317469,0.0002207999,0.0001561434,0.00002031489,0.00001051191,0.00002632558,0.00004684025,0.9707491,0.005035137,0.01212351,0.01097031,0.0003235383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003178312,0.00007971992,0.9951567,0.0002945617,0.0004686651,0.000197247,0.00002456408,0.0005608121,0.00003940589],"genre_scores_gemma":[0.7809283,0.0003916429,0.2178395,0.0006649712,0.00003043987,0.00006231236,0.00001870192,0.00002888626,0.00003529252],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.77775,"threshold_uncertainty_score":0.9855161,"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."}}