{"id":"W4400434361","doi":"10.1145/3715773","title":"An Adaptive Language-Agnostic Pruning Method for Greener Language Models for Code","year":2025,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on software engineering.","topic":"Software Engineering Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Dalhousie University","funders":"Agencia Estatal de Investigación; Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Knut och Alice Wallenbergs Stiftelse","keywords":"Pruning; Computer science; Code (set theory); Artificial intelligence; Language model; Natural language processing; Programming language; Biology; Botany","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.0007975062,0.0008001346,0.0005373412,0.00107966,0.0003937839,0.0007702113,0.001538736,0.0006336298,0.001976058],"category_scores_gemma":[0.003810895,0.0003994316,0.0009833388,0.0006369354,0.0005519286,0.001447208,0.001191185,0.001318392,0.001253583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005297766,"about_ca_system_score_gemma":0.001387517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003341905,"about_ca_topic_score_gemma":0.009192916,"domain_scores_codex":[0.9993107,0.0001363843,0.00004081957,0.0001599602,0.0002919869,0.00006009433],"domain_scores_gemma":[0.9984639,0.0007280737,0.0001390262,0.000291068,0.0003346867,0.00004329547],"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.0003738739,0.0002345663,0.003853264,0.0003453953,0.0001170575,0.0005411748,0.0005718721,0.1462316,0.09092842,0.01695791,0.01290596,0.7269388],"study_design_scores_gemma":[0.00002170037,0.00007223363,0.0004543065,0.00001708269,0.00002433501,0.0001667365,0.00005378006,0.9662142,0.02136898,0.006397401,0.005191395,0.00001786314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02356315,0.0001869272,0.9668588,0.0001392007,0.00004302226,0.00007124526,0.0001966078,0.008108311,0.0008327282],"genre_scores_gemma":[0.2478322,0.0002408371,0.7416704,0.0003508778,0.00005716924,0.0002656317,0.001848395,0.002052319,0.00568213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003341905,"threshold_uncertainty_score":0.006644905,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02915474167711867,"score_gpt":0.3161663503427405,"score_spread":0.2870116086656219,"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."}}