mlsanityData to 14 Oct 2026

Deriving Coding-Specific Sub-Models from LLMs using Resource-Efficient Pruning

arXiv 2501.05248 ↗First posted 9 Jan 2025cs.LG cs.AI cs.SEcited by 0

Not on the map. Why?

Abstract (arXiv)

Large Language Models (LLMs) have demonstrated their exceptional performance in various complex code generation tasks. However, their broader adoption is limited by significant computational demands and high resource requirements, particularly memory and processing power. To mitigate such requirements, model pruning techniques are used to create more compact models with significantly fewer parameters. However, current approaches do not focus on the efficient extraction of programming-language-specific sub-models. In this work, we explore the idea of efficiently deriving coding-specific sub-models through unstructured pruning (i.e., Wanda). We investigate the impact of different domain-specific calibration datasets on pruning outcomes across three distinct domains and extend our analysis to extracting four language-specific sub-models: Python, Java, C++, and JavaScript. We are the first to efficiently extract programming-language-specific sub-models using appropriate calibration datasets while maintaining acceptable accuracy w.r.t. full models. We are also the first to provide analytical evidence that domain-specific tasks activate distinct regions within LLMs, supporting the creation of specialized sub-models through unstructured pruning. We believe that this work has significant potential to enhance LLM accessibility for coding by reducing computational requirements to enable local execution on consumer-grade hardware, and supporting faster inference times critical for real-time development feedback.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 40 of its 64 references that are in the map. First posted on arXiv 9 Jan 2025.

Builds on

40 of 64 references.

References · 40

  1. 2017Attention Is All You Needcited by 60,361
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  4. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  5. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  6. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  7. 2021Program Synthesis with Large Language Modelscited by 3,637
  8. 2023Mistral 7Bcited by 3,164
  9. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  10. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  11. 2023Code Llama: Open Foundation Models for Codecited by 2,139
  12. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
28 more
  1. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
  2. 2020Knowledge Distillation: A Surveycited by 1,603
  3. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  4. 2024Gemma: Open Models Based on Gemini Research and Technologycited by 916
  5. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  6. 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 662
  7. 2019CodeSearchNet Challenge: Evaluating the State of Semantic Code Searchcited by 654
  8. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  9. 2023MAmmoTH: Building Math Generalist Models through Hybrid Instruction Tuningcited by 487
  10. 2021A White Paper on Neural Network Quantizationcited by 472
  11. 2020Knowledge Distillation and Student-Teacher Learning for Visual Intelligence: A Review and New Outlookscited by 316
  12. 2017A Survey of Model Compression and Acceleration for Deep Neural Networkscited by 301
  13. 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 284
  14. 2023A Survey on Model Compression for Large Language Modelscited by 269
  15. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  16. 2021Accelerating Sparse Deep Neural Networkscited by 223
  17. 2022Structured Pruning Learns Compact and Accurate Modelscited by 170
  18. 2019Distilling Task-Specific Knowledge from BERT into Simple Neural Networkscited by 153
  19. 2024Orca-Math: Unlocking the potential of SLMs in Grade School Mathcited by 151
  20. 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
  21. 2015Convolutional neural networks with low-rank regularizationcited by 103
  22. 2020Improving Post Training Neural Quantization: Layer-wise Calibration and Integer Programmingcited by 92
  23. 2023On the Impact of Calibration Data in Post-training Quantization and Pruningcited by 58
  24. 2024CroissantLLM: A Truly Bilingual French-English Language Modelcited by 53
  25. 2024MaskLLM: Learnable Semi-Structured Sparsity for Large Language Modelscited by 50
  26. 2024Pruning as a Domain-specific LLM Extractorcited by 13
  27. 2024LLaMA-NAS: Efficient Neural Architecture Search for Large Language Modelscited by 9
  28. 2023Towards Robust Pruning: An Adaptive Knowledge-Retention Pruning Strategy for Language Modelscited by 7

Built on by

Not cited yet.